Vlad Traista-Popescu

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
It is common knowledge that RSA can fail when used with weak random number generators. In this paper we present two algorithms that we used to find vulnerable public keys together with a simple procedure for recovering the private key from a broken public key. Our study focused on finding RSA keys with 512 and 1024 bit length, which are not considered safe,(More)
  • 1