The function 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 4004 LNCS, Issue , 2006, Pages 254-270

  Joux, Antoine ^a,c   Lercier, Reynald ^a,b  

^a DGA ^*

^b CELAR   (France)

^c UNIVERSITY OF VERSAILLES   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; FUNCTIONS;

DISCRETE LOGARITHMS; FINITE FIELDS; SHORT SIGNATURE SCHEMES; TORUS REPRESENTATIONS;

CRYPTOGRAPHY;

EID: 33746094263     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11761679_16     Document Type: Conference Paper

References (30)

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. 3d., 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. D. Boneh and M. Franklin. Identity based encryption from the Weil pairing, In Crypto '2001, volume 2139 of Lecture Notes in Computer Science, pages 213-229, 2001.
6. D. Boneh, B. Lynn, and H. Shacham. Short signatures from the Weil pairing. In C. Boyd, editor, Proceedings of ASIACRYPT'2001, volume 2248 of Lecture Notes in Comput. Sci., pages 514-532. Springer, 2001.
7. D. Boneh, B. Lynn, and H. Shacham. Short signatures from the Weil pairing. J. of Cryptology, 17(4):297-319, 2004.
8. A.E. Brouwer, R. Pellikaan, and E.R. Verheul. Doing More with Fewer Bits. In Advances in Cryptology - ASIACRYPT '99, volume 1716 of Lecture Notes in Computer Science, pages 321-332. Springer, 1999.
9. D. Coppersmith. Fast evaluation of logarithms in fields of characteristic two. IEEE transactions on information theory, IT-30(4):587-594, July 1984.
10. D. Gordon. Discrete logarithms in GF(p) using the number field sieve. SIAM J. Discrete Math. 6:124-138, 1993.
11. 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.
12. 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.
13. A. Joux. A one round protocol for tripartite diffie-hellman. In Fourth Algorithmic Number Theory Symposium, volume 1838 of Lecture Notes in Computer Science, pages 385-394, 2000.
14. 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.
15. 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.
16. A. Joux, R. Lercier, N. Smart, and F. Vercauteren. The number field sieve in the medium prime case. Preprint.
17. B.A. LaMacchia and A.M. Odlyzko. Solving Large Sparse Linear Systems Over Finite Fields. In Advances in Cryptology - CRYPTO '90, volume 537 of Lecture Notes in Computer Science, pages 109-133. Springer-Verlag, 1991.
18. C. Lanczos. Solutions of systems of linear equations by minimized iterations. In J. Res. Nat., volume 49, pages 33-53. Bureau of Standards, 1952.
19. M.J.J. Lennon and P.J. Smith. LUC: A New Public Key System. In IFIP TC11 Ninth International Conference on Information Security IFIP/Sec, pages 103-117, 1993.
20. A. K. Lenstra and H. W. Lenstra, Jr., editors. The development of the number field sieve, volume 1554 of Lecture Notes in Mathematics. Springer-Verlag, 1993.
21. A.K. Lenstra and E.R. Verheul. The XTR Public Key System. In Advances in Cryptology - CRYPTO 2000, volume 1880 of Lecture Notes in Computer Science, pages 1-19. Springer, 2000.
22. R. Lercier and F. Vercauteren. Discrete logarithms in double-struck F signp18 - 101 digits, NM-BRTHRY mailing list, June 2005.
23. A. M. Odlyzko. Discrete logarithms in finite fields and their cryptographic significance, In T. Beth, N. Cot, and I. Ingemarsson, editors, Advances in Cryptology - EUROCRYPT '84, volume 209 of Lecture Notes in Computer Science, pages 224-314. Springer-Verlag, 1985.
24. D. Panario, X. Gourdon, and P. Flajolet. An analytic approach to smooth polynomials over finite fields. In J. Buhler, editor, Algorithmic Number Theory, Proceedings of the ANTS-III conference, volume 1423, pages 226-236. Springer, 1998.
25. J. M. Pollard. Monte Carlo methods for index computation (mod p). Math. Comp., 32:918-924, 1978.
26. K. Rubin and A. Silverberg. Supersingular abelian varieties in cryptology. In M. Yung, editor, Proceedings of CRYPTO'2002, volume 2442 of Lecture Notes in Comput. Sci., pages 336-353. Springer, 2002.
27. K. Rubin and A. Silverberg. Torus-Based Cryptography. In Advances in Cryptology - CRYPTO 2003, volume 2442 of Lecture Notes in Computer Science, pages 349-365. Springer, 2003.
28. O. Schirokauer, Discrete logarithms and local units. Phil. Trans. R. Soc. Lond. A 345, pages 409-423, 1993.
29. M. van Dijk, R. Granger, D. Page, K. Rubin, A. Silverberg, M. Stam, and D. Woodruff. Practical cryptography in high dimensional tori. In R. Cramer, editor, Proceedings of EUROCRYPT'2005, volume 3494 of Lecture Notes in Comput. Sci., pages 234-250. Springer, 2005.
30. D.H. Wiedemann, Solving Sparse Linear Equations Over Finite Fields. IEEE Trans. Information Theory, 32:54-62, 1986.