The number field sieve in the medium prime case

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4117 LNCS, Issue , 2006, Pages 326-344

  Joux, Antoine ^a,c   Lercier, Reynald ^a,b   Smart, Nigel ^d   Vercauteren, Frederik ^e,f  

^a Delegation Generale pour l'Armement   (France)

^b CELAR   (France)

^c UNIVERSITY OF VERSAILLES   (France)

^d UNIVERSITY OF BRISTOL   (United Kingdom)

^e UNIVERSITY OF LEUVEN   (Belgium)

^f RESEARCH FOUNDATION FLANDERS FWO   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; SECURITY OF DATA; SECURITY SYSTEMS;

FUNCTION FIELD SIEVE; LOGARITHMS; MEDIUM PRIME CASE; NUMBER FIELD SIEVE;

CRYPTOGRAPHY;

EID: 33749552215     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11818175_19     Document Type: Conference Paper

References (21)

1. L. Adleman and J. DeMarrais. A subexponential algorithm for discrete logarithms over all finite fields. In D. Stinson, editor, Proceedings of CRYPTO'93, volume 773 of Lecture Notes in Comput. Sci., pages 147-158. Springer, 1993.
2. L. Adleman and J. DeMarrais. A subexponential algorithm for discrete logarithms over all finite fields. Math. Comp., 61(203):1-15, 2003.
3. L.M. Adleman. The function field sieve. In Algorithmic Number Theory, Proceedings of the ANTS-I conference, volume 877 of Lecture Notes in Comput. Sci., pages 108-121, 1994.
4. L.M. Adleman and M.A. Huang. Function field sieve method for discrete logarithms over finite fields. In Information and Computation, volume 151, pages 5-16. Academic Press, 1999.
5. E. R. Canfield, Paul Erdos, and Carl Pomerance. On a problem of Oppenheim concerning "factorisatio numerorum". J. Number Theory, 17(1): 1-28, 1983.
6. H. Cohen. A course in computational algebraic number theory, volume 138 of Graduate Texts in Mathematics. Springer-Verlag, Berlin, 1993.
7. D.M. Gordon. Discrete logarithms in GF(p) using the number field sieve. SIAM J. Discrete Math., 6(1): 124-138, 1993.
8. R. Granger, A. Holt, D. Page, N. Smart, and F. Vercauteren. Function field sieve in characteristic three. In D. Buell, editor, Algorithmic Number Theory, Proceedings of the ANTS-VI conference, volume 3076 of Lecture Notes in Comput. Sci., pages 223-234. Springer, 2004.
9. R. Granger and F. Vercauteren. On the discrete logarithm problem on algebraic tori. In V. Shoup, editor, Proceedings of CRYPTO'2005, volume 3621 of Lecture Notes in Comput. Sci., pages 66-85. Springer, 2005.
10. A. Ivić and G. Tenenbaum. Local densities over integers free of large prime factors. Quart. J. Math. Oxford Ser. (2), 37(148):401-417, 1986.
11. A. Joux and R. Lercier. The function field sieve is quite special. In C. Fieker and D. Kohel, editors, Algorithmic Number Theory, Proceedings of the ANTS-V conference, volume 2369 of Lecture Notes in Comput. Sci., pages 431-445. Springer, 2002.
12. A. Joux and R. Lercier. Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method. Math. Comp., 72:953-967, 2003.
13. A. Joux and R. Lercier. The function field sieve in the medium prime case. In S. Vaudenay, editor, Proceedings of EUROCRYPT'2006, volume 4004 of Lecture Notes in Comput. Sci., pages 254-270. Springer, 2006.
14. A. K. Lenstra, H. W. Lenstra, Jr., and L. Lovász. Factoring polynomials with rational coefficients. Math. Ann., 261(4):515-534, 1982.
15. p18 - 101 digits. NM-BRTHRY mailing list, June 2005.
16. U.M. Maurer and Y. Yacobi. A non-interactive public-key distribution system. Des. Codes Cryptogr., 9(3):305-316, 1996.
17. J. Neukirch. Algebraic number theory, volume 322 of Grundlehren der Mathematischen Wissenschaften. Springer-Verlag, Berlin, 1999.
18. O. Schirokauer. Discrete logarithms and local units. Philos. Trans. Roy. Soc. London Ser. A, 345(1676):409-423, 1993.
19. O. Schirokauer. Virtual logarithms. J. Algorithms, 57(2): 140-147, 2005.
20. O. Schirokauer, D. Weber, and T. Denny. Discrete logarithms: the effectiveness of the index calculus method. In Algorithmic Number Theory, Proceedings of the ANTS-II conference, volume 1122 of LNCS, pages 337-361. Springer, Berlin, 1996.
21. D. Weber. Computing discrete logarithms with the general number field sieve. In Algorithmic Number Theory, Proceedings of the ANTS-II conference, volume 1122 of LNCS, pages 391-403. Springer, Berlin, 1996.