A Secure Family of Composite Finite Fields Suitable for Fast Implementation of Elliptic Curve Cryptography-Reference-Cited by-同舟云学术

A Secure Family of Composite Finite Fields Suitable for Fast Implementation of Elliptic Curve Cryptography

Published:2001 Issue: Volume: Page:108-116
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Ciet Mathieu,Jean-Jacques Quisquater,Sica Francesco

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-45311-3_11

Reference24 articles.

1. D.G. Cantor. Computing in the Jacobian of a Hyperelliptic Curve. Mathematics of Computation, 48(177):95–101, 1987.

2. A. Enge and P. Gaudry. A General Framework for Subexponential Discrete Logarithm Algorithms. In LIX/RR/00/04-Laboratoire d’Informatique-Ecole Polytechnique-Palaiseau, to appear in Acta Arithmetica, Available at http://www.math.uni-augsburg.de/~enge/Publikationen.html , June 2000.

3. S. Gao and H.W. Lenstra JR. Optimal Normal Bases. Designs, Codes and Cryptography, 2:315–323, 1992.

4. Lect Notes Comput Sci;P. Gaudry,2000

5. P. Gaudry, F. Hess, and N.P. Smart. Constructive and Destructive Facets of Weil Descent on Elliptic Curves. Journal of Cryptology, to appear.

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Extractors for binary elliptic curves;Designs, Codes and Cryptography;2008-03-12

2. Public-Key Cryptography for RFID Tags and Applications;RFID Security;2008

3. Generalising the GHS Attack on the Elliptic Curve Discrete Logarithm Problem;LMS Journal of Computation and Mathematics;2004

4. The GHS Attack Revisited;Lecture Notes in Computer Science;2003