On the discrete logarithm problem on algebraic tori

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

Volumn 3621 LNCS, Issue , 2006, Pages 66-85

  Granger, R ^a   Vercauteren, F ^b  

^a UNIVERSITY OF BRISTOL   (United Kingdom)

^b UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE ALGORITHMS; CRYPTOGRAPHY; DIFFERENTIATION (CALCULUS); DISCRETE TIME CONTROL SYSTEMS; PROBLEM SOLVING; SOFTWARE PROTOTYPING;

ALGEBRAIC TORI; DISCRETE LOGARITHMS; INDEX CALCULUS; LOGARITHM PROBLEMS;

ALGEBRA;

EID: 33745149365     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (28)

1. L. M. Adleman and J. DeMarrais. A subexponential algorithm for discrete logarithms over all finite fields. Math. Comp., 61 (203), 1-15, 1993.
2. A. E. Brouwer, R. Pellikaan and E. R. Verheul. Doing more with fewer bits. In Advances in Cryptology (ASIACRYPT 1999), Springer LNCS 1716, 321-332, 1999.
3. B. Buchberger. A theoretical basis for the reduction of polynomials to canonical forms. ACM SIGSAM Bull., 10 (3), 19-29, 1976.
4. C. Diem. On the discrete logarithm problem in elliptic curves over non-prime fields. Preprint 2004. Available from the author.
5. W. Diffie and M. E. Hellman. New directions in cryptography. IEEE Trans. Inform. Theory 22 (6), 644-1354, 1976.
6. T. ElGamal. A public key cryptosystem and a signature scheme based on discrete logarithms. In Advances in Cryptology (CRYPTO 1984), Springer LNCS 196, 10-18, 1985.
7. 4), J. Pure Appl. Algebra 139 (1-3), 61-88, 1999.
8. 5), In Proceedings of the 2002 International Symposium on Symbolic and Algebredc Computation, 75-83, 2002.
9. FIPS 186-2, Digital signature standard. Federal Information Processing Standards Publication 186-2, February 2000.
10. P. Gaudry. Index calculus for abelian varieties and the elliptic curve discrete logarithm problem. Cryptology ePrint Archive, Report 2004/073. Available from http://eprint.iacr.org/2004/073.
11. P. Gaudry and E. Thomé. A double large prime variation for small genus hyperelliptic index calculus. Cryptology ePrint Archive, Report 2004/153. Available from http://eprint.iacr.org/2004/153.
12. R. Granger, D. Page and M. Stam. A comparison of CEILIDH and XTR. In Algorithmic Number Theory Symposium (ANTS-VI), Springer LNCS 3076, 235-249, 2004.
13. B. A. LaMacchia and A. M. Odlyzko. Solving large sparse linear systems over finite fields. In Advances in Cryptology (CRYPTO 1990), Springer LNCS 537, 109-133, 1991.
14. D. Lazard. Résolution des systèmes d'équations algébriques, Theoret. Comput. Sci., 15 (1), 77-110, 1981.
15. A. K. Lenstra. Using cyclotomic polynomials to construct efficient discrete logarithm cryptosystems over finite fields. In Proceedings of ACISP97, Springer LNCS 1270, 127-138, 1997.
16. A. K. Lenstra and E. Verheul. The XTR public key system. In Advances in Cryptology (CRYPTO 2000), Springer LNCS 1880, 1-19, 2000.
17. 6m). In Selected Areas in Cryptography (SAC 2001), Springer LNCS 2259, 301-312, 2001.
18. A. J. Menezes, P. van Oorschot and S. A. Vanstone. The Handbook of Applied Cryptography, CRC press, 1996.
19. A. Miyaji, M. Nakabayashi and S. Takano. New explicit conditions of elliptic curve traces for FR-reduction. IEICE Trans. Fundamentals E84-A (5), 1234-1243, 2001.
20. K. Nagao. Improvement of Thériault algorithm of index calculus for Jacobian of hyperelliptic curves of small genus. Cryptology ePrint Archive, Report 2004/161. Available from http://eprint.iacr.org/2004/161.
21. A. M. Odlyzko. Discrete logarithms in finite fields and their cryptographic significance. In Advances in Cryptology (EUROCRYPT 1984), Springer LNCS 209, 224-314, 1985.
22. K. Rubin and A. Silverberg. Torus-based cryptography. In Advances in Cryptology (CRYPTO 2003), Springer LNCS 2729, 349-365, 2003.
23. K. Rubin and A. Silverberg. Using primitive subgroups to do more with fewer bits. In Algebraic Number Theory Symposium (ANTS-VI), Springer LNCS 3076, 18-41, 2004.
24. C. P. Schnorr. Efficient signature generation by smart cards. J. Cryptology, 4, 161-174, 1991.
25. P. Smith and C. Skinner. A public-key cryptosystem and a digital signature system based on the Lucas function analogue to discrete logarithms. In Advances in Cryptology (ASIACRYPT 1995), Springer LNCS 917, 357-364, 1995.
26. N. Thériault. Index calculus attack for hyperelliptic curves of small genus. In Advances in Cryptology (ASIACRYPT 2003), Springer LNCS 2894, 75-92, 2003.
27. M. van Dijk, R. Granger, D. Page, K. Rubin, A. Silverberg, M. Stam and D. Woodruff. Practical cryptography in high dimensional tori. In Advances in Cryptology (EUROCRYPT 2005), Springer LNCS 3494, 234-250, 2005.
28. M. van Dijk and D. P. Woodruff. Asymptotically optimal communication for torus-based cryptography. In Advances in Cryptology (CRYPTO 2004), Springer LNCS 3152, 157-178, 2004.