A comparison of CEILIDH and XTR

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

Volumn 3076, Issue , 2004, Pages 235-249

  Granger, R ^a   Page, D ^a   Stam, M ^a  

^a UNIVERSITY OF BRISTOL   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

NUMBER THEORY;

ALGEBRAIC TORUS; COMPRESSION FACTOR; DISCRETE LOGARITHMS; PUBLIC KEY CRYPTOSYSTEMS; SIMPLE GROUPS;

PUBLIC KEY CRYPTOGRAPHY;

EID: 24144449163     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24847-7_17     Document Type: Review

References (28)

1. L.M. Adleman and M.A. Huang. Function Field Sieve Method for Discrete Logarithms over Finite Fields. Info. and Comp., 151(1-2), 5-16, 1999.
2. L.F. Blake, G. Seroussi and N.P. Smart. Elliptic Curves in Cryptography. Cambridge University Press, 1999.
3. A. Bosselaers, R. Govaerts and J. Vandewalle. Comparison of Three Modular Reduction Functions. In Advances in Cryptology (CRYPTO) Springer LNCS 773, 175-186, 1994.
4. H. Cohen, A. Miyaji and T. Ono. Efficient Elliptic Curve Exponentiation Using Mixed Coordinates. In Advances in Cryptology (ASIACRYPT), Springer LNCS 1514, 51-65, 1998.
5. P. Gaudry, F. Hess and N.P. Smart. Constructive And Destructive Facets Of Weil Descent On Elliptic Curves. In J. of Cryptology, 15(1), 19-46, 2002.
6. D.M. Gordon. Discrete Logarithms in GF(p) Using the Number Field Sieve. In SIAM J. of Disc. Math., 6, 124-138, 1993.
7. m) Using Normal Bases. Info. and Comp., 78(3), 171-177, 1988.
8. A. Joux and R. Lercier. The Function Field Sieve is Quite Special. In Alg. Numb. Th. Symp. (ANTS-V), Springer LNCS 2369, 431-145, 2002.
9. D. E. Knuth. The Art of Computer Programming. Vol. 2, Addison-Wesley, 1981.
10. N. Koblitz. Elliptic Curve Cryptosystems. In Math. Comp., 48, 203-209, 1987.
11. N. Koblitz. Hyperelliptic Cryptosystems. In J. of Cryptology, 1, 139-150, 1989.
12. A.K. Lenstra. Using Cyclotomic Polynomials to Construct Efficient Discrete Logarithm Cryptosystems over Finite Fields. In Proc. ACISP97, Springer LNCS 1270, 127-138, 1997.
13. A.K. Lenstra and E.R. Verheul. The XTR Public Key System. In Advances in Cryptology (CKYPTO), Springer LNCS 1880, 1-19, 2000.
14. C.H. Lim and P.J. Lee. More flexible exponentiation with precomputation. In Advances in Cryptology (CRYPTO), Springer LNCS 839, 95-107, 1994.
15. V. Miller. Uses of Elliptic Curves in Cryptography. In Advances in Cryptology (CRYPTO), Springer LNCS 218, 417-426, 1985.
16. P.L. Montgomery. Modular Multiplication Without Trial Division. Math. Comp., 44, 519-521, 1985.
17. J. Proos. Joint Sparse Forms and Generating Zero Columns when Combing. University of Waterloo, Technical Report CORR 2003-23,
18. K. Rubin and A. Silverberg. Supersingular abelian varieties in Cryptology. In Advances in Cryptology (CRYPTO), Springer LNCS 2442, 336-353, 2002.
19. K. Rubin and A. Silverberg. Torus-Based Cryptography. In Advances in Cryptology (CRYPTO), Springer LNCS 2729, 349-365, 2003.
20. V. Shoup. Lower Bounds for Discrete Logarithms and Related Problems. In Advances in Cryptology (EUROCRYPT), Springer LNCS 1233, 256-266, 1997.
21. J.A. Solinas. Low-Weight Binary Representations for Pairs of Integers. University of Waterloo, Technical Report CORR 2001-41,
22. M. Stam and A. Lenstra. Efficient Subgroup Exponentiation in Quadratic and Sixth Degree Extensions. In Cryptographic Hardware and Embedded Systems (CHES), Springer LNCS 2523, 318-332, 2002.
23. M. Stam and A. Lenstra. Speeding Up XTR. In Advances in Cryptology (ASIACRYPT), Springer LNCS 2248, 125-143, 2001.
24. E.G. Straus. Problems and Solutions: (5125) Addition Chains of Vectors. In American Mathematical Monthly, 71, 806-808, 1964.
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) Springer LNCS 917, 357-364, 1995.
26. E. Teske. Speeding up Pollard's Rho Method for Computing discrete Logarithms. In Alg. Numb. Th. Symp. (ANTS-III), Springer LNCS 1423, 541-554, 1998.
27. N. Thériault. Index Calculus Attack for Hyperelliptic Curves of Small Genus. In Advances in Cryptology (ASIACRYPT), Springer LNCS 2894, 75-92, 2003.
28. V.E. Voskresenskiǐ. Algebraic Groups and Their Birational Invariants. In Translations of Mathematical Monographs, 179, American Mathematical Society, 1998.