Browse > Article
http://dx.doi.org/10.13089/JKIISC.2016.26.3.631

Efficient Optimization Method for Polynomial Selection  

Kim, Suhri (Center for Information Security Technologies(CIST), Korea University)
Kwon, Heetaek (Center for Information Security Technologies(CIST), Korea University)
Lee, Yongseong (Center for Information Security Technologies(CIST), Korea University)
Chang, Nam Su (Sejong Cyber University)
Yoon, Kisoon (NSHC)
Kim, Chang Han (Semyung University)
Park, Young-Ho (Sejong Cyber University)
Hong, Seokhie (Center for Information Security Technologies(CIST), Korea University)
Publication Information
Journal of the Korea Institute of Information Security & Cryptology / v.26, no.3, 2016 , pp. 631-643 More about this Journal
Abstract
Currently, General Number Field Sieve(GNFS) is known as the most efficient way for factoring large numbers. CADO-NFS is an open software based on GNFS, that was used to factor RSA-704. Polynomial selection in CADO-NFS can be divided into two stages - polynomial selection, and optimization of selected polynomial. However, optimization of selected polynomial in CADO-NFS is an immense procedure which takes 90% of time in total polynomial selection. In this paper, we introduce modification of optimization stage in CADO-NFS. We implemented precomputation table and modified optimization algorithm to reduce redundant calculation for faster optimization. As a result, we select same polynomial as CADO-NFS, with approximately 40% decrease in time.
Keywords
GNFS; Polynomial Selection; Root optimization;
Citations & Related Records
연도 인용수 순위
  • Reference
1 B. A. Murphy, "Polynomial Selection for the Number Field Sieve Integer Factorization Algorithm," Ph.D. Thesis, The Australian National University, 1999.
2 R. Rivest, A. Shamir, L. Adleman, "A Method for Obtaining Digital Signature and Public-Key Cryptosystems," ACM, vol.21(2), pp.120-126, 1978.   DOI
3 T. Kleinjung. "Polynomial selection," In CADO workshop on integer factorization, INRIA Nancy, http://cado.gforge.inria.fr/workshop/slides/kleinjung.pdf. 2008.
4 T. Kleinjung. "On polynomial selection for the general number field sieve," Mathematics of Computation, pp. 2037-2047, 2006.
5 S. Bai "Polynomial Selection for the Number Field Sieve," Ph.D. Thesis ,The Australian National University, 2011.
6 S. Bai, E. Thom'e, P. Zimmermann. Factorisation of RSA-704 with CADO-NFS. Report, http://eprint.iacr .org/2012/369.pdf.
7 T. Kleinjung, K. Aoki, J. Franke, A. K. Lenstra, E. Thom'e, J. W. Bos, P. Gaudry, A. Kruppa,P. L. Montgomery, D. A. Osvik, H. J. J. te Riele, A. Timofeev, and P. Zimmermann. "Factorization of a 768-bit RSA modulus," CRYPTO '10, vol.6223 LNCS, pp 333-350, 2010.
8 A. K. Lenstra and H. W. Lenstra, Jr., editors. "The Development of the Number Field Sieve," vol. 1554 of Lecture Notes in Mathematics. Springer, 1993.
9 Matthew E. Briggs "An Introduction to the General Number Field Sieve," Master Thesis. Virginia Polytechnic Institute and State University. April, 1998.
10 P. Gaudry, A. Kruppa, et al. "CADO-NFS," http://cado-nfs.gforge.inria.fr
11 B. A. Murphy, R. P. Brent, "On Quadratic Polynomials for the Number Field Sieve," CATS'98, pp 199-231, 1998.