Attacks on the RSA cryptosystem using integer factorization
Jelena Smiljanić, Predrag Ivaniš · 2011
This paper describes how integer factorization algorithms may be used to break the RSA cryptosystem. Complexity and efficiency of Trial division, Lehman's method, Pollard's ρ method and Quadratic Sieve algorithm are analyzed. The corresponding numerical results are presented for typical secret key lengths.