ON THE CHOICE OF POLYNOMIALS FOR THE NUMBER FIELD SIEVE
Abstract
In the paper an algorithm is suggested for quick estimate of sieving time and the number of relations for the number field sieve algorithm.
About the Authors
D. V. Vasilyev
Institute of Mathematics of the National Academy of Sciences of Belarus, Minsk
Russian Federation
Russian Federation
A. S. Kudin
Institute of Mathematics of the National Academy of Sciences of Belarus, Minsk
Russian Federation
Russian Federation
References
1. Rivest R., Shamir A., Adleman B. // Communications of the ACM. 1978. Vol. 21, iss. 2.
2. Vanstone S., Menezes A., Oorschot P. van. Handbook of Applied Cryptography. London, 1996.
3. Diffie W., HellmanM. // Information Theory IEEE Transactions. 1976. Vol. 22 (2). P. 644-654.
4. Buhler J. P., Lenstra H. W., Pomerance С. // Springer Berlin / Heidelberg, Lecture Notes in Mathematics. 1993. Vol. 1554. P. 50-94.
5. Pollard J. M. // Springer Berlin / Heidelberg, Lecture Notes in Mathematics. 1993. Vol. 1554. P. 43-49.
6. Lercier R., JouxA. // Mathematics of computation. 1999. Vol. 72. P. 953-967.
7. Murphy В. A. Polynomial Selection for the Number Filed Sieve Integer Factorization Algorithm. PhD thesis. The Australian National University, 1999.
8. Kleinjung Th. // Math. Comp. 2006. Vol. 75. P. 2037-2047.
9. Monico C. GGNFS suite // sourceforge. net [Electronic resource]. 2012. Mode of access: http://sourceforge.net/projects/ggnfs/. Date of access: 17.09.2013.
10. General number filed sieve implementation // sourceforge. net [Electronic resource]. 2012. Mode of access: http://gdlog. sourceforge.net/. Date of access: 17.09.2013.
Review
Views:
450
Email this article 