We have seen that the security of the RSA system and the Rabin system is closely connected to the difficulty of factoring a positive integer into primes. But it is not known whether the integer factoring problem is in fact difficult to solve. On the contrary, over the years many efficient integer factoring algorithms have been invented, and the number of digits required for secure RSA moduli has been increased from 512 to 1024 bits.
KeywordsPrime Number Factor Base Factoring Algorithm Proper Divisor Integer Factoring Problem
Unable to display preview. Download preview PDF.