Two efficient algorithms for arithmetic of elliptic curves using Frobenius map-Reference-Cited by-同舟云学术

Two efficient algorithms for arithmetic of elliptic curves using Frobenius map

Published:1998 Issue: Volume: Page:195-202
ISSN:0302-9743
Container-title:Public Key Cryptography
language:
Short-container-title:

Author:

Cheon Jung Hee,Park Sungmo,Park Sangwoo,Kim Daeho

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/BFb0054025

Reference11 articles.

1. J. Guajardo and C. Paar, “Efficient algorithms for elliptic curve cryptosystems”, Proc. Crypto '97, Springer-Verlag, 1997, pp. 342–356.

2. K. Koyama and Y. Tsuruoka, “Speeding up Elliptic Cryptosystems by using a singed binary window method”, Proc. Crypto '92, Springer-Verlag, 1993, pp. 43–56.

3. N. Koblitz, A Course in Number Theory and Cryptography, Springer-Verlag, 1991.

4. N. Koblitz, “CM curves with good cryptographic properties”, Proc. Crypto '91, Springer-Verlag, 1992, pp. 279–287.

5. N. Koblitz, “Hyperelliptic Cryptosystems”, Journal of Cryptology 1(1989), pp. 139–150.

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

1. A DPA Countermeasure by Randomized Frobenius Decomposition;Information Security Applications;2006

2. A General Expansion Method Using Efficient Endomorphisms;Information Security and Cryptology - ICISC 2003;2004

3. New Frobenius Expansions for Elliptic Curves with Efficient Endomorphisms;Lecture Notes in Computer Science;2003

4. Fast Implementation of Elliptic Curve Arithmetic in GF(p n );Public Key Cryptography;2000

5. Speeding Up Elliptic Scalar Multiplication with Precomputation;Lecture Notes in Computer Science;2000