Fast generation of pairs (k, [k]P) for koblitz elliptic curves

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

Volumn 2259, Issue , 2001, Pages 151-164

  Coron, Jean Sébastien ^a   M’Raïhi, David ^b   Tymen, Christophe ^a  

^a ECOLE NORMALE SUPÉRIEURE   (France)

^b GEMPLUS   (France)

Author keywords

Accelerated signature schemes; Binary anomalous curve; Elliptic curve; Pseudo random generators; Scalar multiplication

Indexed keywords

AUTHENTICATION; GEOMETRY;

ANOMALOUS CURVE; ELLIPTIC CURVE; PSEUDORANDOM GENERATORS; SCALAR MULTIPLICATION; SIGNATURE SCHEME;

CRYPTOGRAPHY;

EID: 84949200440     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45537-x_12     Document Type: Conference Paper

References (19)

1. V. Boyko, M. Peinado, and R. Venkatesan. Speeding up discrete log and factoring based schemes via precomputations. In Advances in Cryptology - Eurocrypt’98, pages 221-235. Springer Verlag, 1998.
2. D.M. Gordon. A survey of fast exponentiation methods. Journal of Algorithms, 27:129-146, 1998.
3. B.S. Kaliski Jr. and T.L. Yin. Storage-efficient finite field basis conversion. In Selected areas in Cryptography - SAC’98, volume 1556, 1998.
4. N. Koblitz. Elliptic curve cryptosystems. Mathematics of Computation, 48:203-209, 1987.
5. N. Koblitz. CM-curves with good cryptographic properties. In Joan Feigenbaum, editor, Advances in Cryptology - Crypto’91, pages 279-287, Berlin, 1991. Springer- Verlag. Lecture Notes in Computer Science Volume 576.
6. W. Meier and O. Staffelbach. Efficient multiplication on certain non-supersingular elliptic curves. In Advances in Cryptology - Crypto’92, volume LNCS 740, pages 333-344. Springer Verlag, 1993.
7. A.J. Menezes. Elliptic Curve Public Key Cryptosystems. Kluwer Academic Publishers, 1993.
8. V.S. Miller. Use of elliptic curves in cryptography. In Springer Verlag, editor, Proceedings of Crypto 85, volume LNCS 218, pages 417-426. Springer Verlag, 1986.
9. F. Morain and J. Olivos. Speeding up the computation of an elliptic curve using addition-subtraction chains. Inform. Theory Appl., 24:531-543, 1990.
10. P. Nguyen. La géométrie des nombres en cryptologie. PhD thesis, Université de Paris 7, 1999.
11. P. Nguyen and J. Stern. The hardness of the hidden subset sum problem and its cryptographic implications. In Michael Wiener, editor, Advances in Cryptology - Crypto’99, pages 31-46, Berlin, 1999. Springer-Verlag. Lecture Notes in Computer Science.
12. Phong Nguyen, Igor Shparlinsky, and Jacques Stern. Distribution of Modular Subset Sums and the Security of the Server Aided Exponentiation. In Workshop on Cryptography and Computational Number Theory, 1999.
13. IEEE P1363. Standard Specifications for Public Key Cryptography. August 1998.
14. P. de Rooij. On the security of the Schnorr scheme using preprocessing. In DonaldW. Davies, editor, Advances in Cryptology - EuroCrypt’91, pages 71-80, Berlin, 1991. Springer-Verlag. Lecture Notes in Computer Science Volume 547.
15. P. de Rooij. On Schnorr’s preprocessing for digital signature schemes. In Tor Helleseth, editor, Advances in Cryptology - EuroCrypt’93, pages 435-439, Berlin, 1993. Springer-Verlag. Lecture Notes in Computer Science Volume 765.
16. P. de Rooij. Efficient exponentiation using precomputation and vector addition chains. In Alfredo De Santis, editor, Advances in Cryptology - EuroCrypt’94, pages 389-399, Berlin, 1995. Springer-Verlag. Lecture Notes in Computer Science Volume 950.
17. C. P. Schnorr. Efficient identification and signatures for smart cards. In Jean- Jacques Quisquater and Joos Vandewalle, editors, Advances in Cryptology - Euro- Crypt’89, pages 688-689, Berlin, 1989. Springer-Verlag. Lecture Notes in Computer Science Volume 434.
18. C. P. Schnorr. Efficient identification and signatures for smart cards. Journal of Cryptology, 4:161-174, 1991.
19. J.A. Solinas. An improved algorithm for arithmetic on a family of elliptic curves. In BurtKaliski, editor, Advances in Cryptology - Crypto’97, pages 357-371, Berlin, 1997. Springer-Verlag. Lecture Notes in Computer Science Volume 1294.