On polynomial selection for the general number field sieve-Reference-Cited by-同舟云学术

On polynomial selection for the general number field sieve

Published:2006-06-28 Issue:256 Volume:75 Page:2037-2047
ISSN:0025-5718
Container-title:Mathematics of Computation
language:en
Short-container-title:Math. Comp.

Author:

Kleinjung Thorsten

Abstract

The general number field sieve (GNFS) is the asymptotically fastest algorithm for factoring large integers. Its runtime depends on a good choice of a polynomial pair. In this article we present an improvement of the polynomial selection method of Montgomery and Murphy which has been used in recent GNFS records.

Publisher

American Mathematical Society (AMS)

Subject

Applied Mathematics,Computational Mathematics,Algebra and Number Theory

Link

http://www.ams.org/mcom/2006-75-256/S0025-5718-06-01870-9/S0025-5718-06-01870-9.pdf

Reference6 articles.

1. S. Cavallar, W. M. Lioen, H. J. J. teRiele, B. Dodson, A. K. Lenstra, P. L. Montgomery, B. Murphy et al., Factorization of a 512-bit RSA modulus, Report MAS-R0007, CWI.

2. J. Franke, T. Kleinjung et al., RSA-576, E-mail announcement, 2003. \url{http://www.crypto-world.com/announcements/rsa576.txt}

3. The number field sieve: an annotated bibliography;Lenstra, H. W., Jr.,1993

4. On quadratic polynomials for the number field sieve;Murphy, Brian,1998

5. Modelling the yield of number field sieve polynomials;Murphy, Brian,1998

Cited by 32 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Analysis and Improvements to the Special Number Field Sieve for Discrete Logarithm Problems;2021 IEEE 5th International Conference on Cryptography, Security and Privacy (CSP);2021-01-08

2. Factorization and Malleability of RSA Moduli, and Counting Points on Elliptic Curves Modulo N;Mathematics;2020-11-27

3. First-Degree Prime Ideals of Biquadratic Fields Dividing Prescribed Principal Ideals;Mathematics;2020-08-26

4. Relation collection using Pollard special-q sieving to solve integer factorization and discrete logarithm problem;The Journal of Supercomputing;2020-07-02

5. A Study on the Performance of Base-m Polynomial Selection Algorithm Using GPU;Artificial Intelligence and Applied Mathematics in Engineering Problems;2020