Affiliation:
1. Mepco Schlenk Engineering College, India
2. The American University in Cairo, Egypt
Abstract
Most cryptographic systems are based on an underlying difficult problem. The RSA cryptosystem and many other cryptosystems rely on the fact that factoring a large composite number into two prime numbers is a hard problem. The are many algorithms for factoring integers. This chapter presents some of the basic algorithms for integer factorization like the Trial Division, Fermat's Algorithm. Pollard's Rho Method, Pollard's p-1 method and the Elliptic Curve Method. The Number Field Sieve algorithm along with Special Number field Sieve and the General Number Field Sieve are also used in factoring large numbers. Other factoring algorithms discussed in this chapter are the Continued Fractions Algorithms and the Quadratic Sieve Algorithm.
Reference16 articles.
1. A Kilobit Special Number Field Sieve Factorization
2. Factorization of a 512-Bit RSA Modulus
3. Childers, G. (2012). Factorization of a 1061-bit number by the special number field sieve. Cryptology ePrint Archive, Report 2012/444.
4. A World Wide Number Field Sieve factoring record: On to 512 bits
5. Kleinjung, T., Aoki, K., Franke, J., Lenstra, A., Thome, E., Bos, J., … Zimmermann, P. (2010). Factorization of a 768-bit RSA modulus (Cryptology ePrint Archive, Report 2010/006).
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献