Analysis of the gallant-lambert-vanstone method based on efficient endomorphisms: Elliptic and hyperelliptic curves

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

Volumn 2595, Issue , 2003, Pages 21-36

  Sica, Francesco ^a   Ciet, Mathieu ^a   Quisquater, Jean Jacques ^a  

^a Microelectronics Laboratory   (Belgium)

Author keywords

Algebraic number fields; Efficiently computable endomorphisms; Elliptic curve cryptography; Fast performance

Indexed keywords

CRYPTOGRAPHY; PUBLIC KEY CRYPTOGRAPHY;

ALGEBRAIC NUMBER FIELDS; BEST CONSTANTS; EFFICIENTLY COMPUTABLE ENDOMORPHISMS; ELLIPTIC CURVE CRYPTOGRAPHY; EXPLICIT BOUNDS; FAST PERFORMANCE; HYPER-ELLIPTIC CURVES; MINIMAL POLYNOMIALS;

GEOMETRY;

EID: 35248862660     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36492-7_3     Document Type: Article

References (18)

1. I. Blake, G. Seroussi, and N. Smart. Elliptic Curves in Cryptography, volume 265 of London Mathematical Society. Cambridge University Press, 2000.
2. H. Cohen. A Course in Computational Algebraic Number Theory, volume 138 of Graduate Texts in Mathematics. Springer, 1996.
3. H. Daudé, P. Flajolet, and B. Vallée. An Average-case Analysis of the Gaussian Algorithm for Lattice Reduction. Technical Report 2798, INRIA, February 1996.
4. H. Davenport. Multiplicative Number Theory, volume 74 of Graduate Texts in Mathematics. Springer Verlag, 1980.
5. R. P. Gallant, J. L. Lambert, and S. A. Vanstone. Faster Point Multiplication on Elliptic Curves with Efficient Endomorphisms. In J. Kilian, editor, Advances in Cryptology - Proceedings of CRYPTO 2001, volume 2139 of Lecture Notes in Computer Science, pages 190-200. Springer, 2001.
6. D. M. Gordon. A Survey of Fast Exponentiation Methods. Journal of Algorithms, 27(1):129-146, 1998.
7. D. Kim and S. Lim. Integer Decomposition for Fast Scalar Multiplication on Elliptic Curves. In Howard Keys and Kaisa Nyberg, editors, Selected Areas in Cryptography, 9th Annual International Workshop, SAC 2002, Lecture Notes in Computer Science. Springer, 2002. (this volume).
8. K. Koblitz. Elliptic Curve Cryptosystems. Mathematics of Computation, 48(177):203-209, 1987.
9. D. Kohel. Endomorphism Rings of Elliptic Curves over Finite Fields. PhD thesis, UC Berkeley, 1996.
10. T. Lange. Efficient Arithmetic on Hyperelliptic Koblitz Curves. PhD thesis, University of Essen, 2001.
11. A. K. Lenstra, H. W. Lenstra Jr., and L. Lovász. Factoring polynomials with rational coefficients. Mathematische Ann., 261:513-534, 1982.
12. A.J. Menezes. Elliptic Curve Public Key Cryptosystems. Kluwer Academic Publishers, 1995.
13. V. Miller. Use of Elliptic Curves in Cryptography. In A. M. Odlyzko, editor, Advances in Cryptology - Proceedings of CRYPTO 1986, volume 263 of Lecture Notes in Computer Science, pages 417-426. Springer, 1986.
14. V. Müller. Efficient Point Multiplication for Elliptic Curves over Special Optimal Extension Fields. In Walter de Gruyter, editor, Public-Key Cryptography and Computational Number Theory, pages 197-207, Warschau, Poland, September 11-15, 2000 (2001).
15. Y-H. Park, S. Jeong, C. Kim, and J. Lim. An Alternate Decomposition of an Integer for Faster Point Multiplication on Certain Elliptic Curves. In D. Naccache and P. Paillier, editors, Advances in Cryptology - Proceedings of PKC 2002, volume 2274 of Lecture Notes in Computer Science, pages 323-334. Springer, 2002.
16. Y-H. Park, S. Jeong, and J. Lim. Speeding Up Point Multiplication on Hyperelliptic Curves with Efficiently-computable Endomorphisms. In L. Knudsen, editor, Advances in Cryptology - Proceedings of EUROCRYPT 2002, volume 2332 of Lecture Notes in Computer Science, pages 197-208. Springer, 2002.
17. J. A. Solinas. An Improved Algorithm for Arithmetic on a Family of Elliptic Curves. In Burton S. Kaliski Jr., editor, Advances in Cryptology - Proceedings of CRYPTO 1997, volume 1294 of Lecture Notes in Computer Science, pages 357-371. Springer, 1997.
18. E. Waterhouse. Abelian varieties over finite fields. Ann. Sci. École Norm. Sup., 2:521-560, 1969.