Revisiting Fermat's Factorization for the RSA Modulus

Details Revisiting Fermat's Factorization for the RSA Modulus Revisiting Fermat's Factorization for the RSA Modulus

2009-10-21

arxiv.org/abs/0910.4179v1

Computer Science

Cryptography and Security

Scientific paper

We revisit Fermat's factorization method for a positive integer $n$ that is a product of two primes $p$ and $q$. Such an integer is used as the modulus for both encryption and decryption operations of an RSA cryptosystem. The security of RSA relies on the hardness of factoring this modulus. As a consequence of our analysis, two variants of Fermat's approach emerge. We also present a comparison between the two methods' effective regions. Though our study does not yield a new state-of-the-art algorithm for integer factorization, we believe that it reveals some interesting observations that are open for further analysis.

Affiliated with

Also associated with

No associations

Rating

Revisiting Fermat's Factorization for the RSA Modulus does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Revisiting Fermat's Factorization for the RSA Modulus, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Revisiting Fermat's Factorization for the RSA Modulus will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-689459