Jelena Smiljanić, Predrag Ivaniš
Abstract
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.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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.
Key concepts: Cryptosystem, Integer factorization, Integer (computer science), Factorization, Computer science, Key (lock), Quadratic equation, Quadratic residue