A cyclic window algorithm for ECC defined over extension fields

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

Volumn 2229, Issue , 2001, Pages 62-73

  Aoki, Kazumaro ^a   Hoshino, Fumitaka ^a   Kobayashi, Tetsutaro ^a  

^a NTT CORPORATION   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

GEOMETRY;

ELLIPTIC CURVE; EXTENSION FIELD; GROUP OPERATIONS; OPTIMAL EXTENSION FIELD; PENTIUM; SCALAR MULTIPLICATION; SLIDING WINDOW ALGORITHMS; WINDOW ALGORITHM;

LARGE SCALE SYSTEMS;

EID: 84957001477     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45600-7_8     Document Type: Conference Paper

References (11)

1. Menezes, A.J., van Oorschot, P.C., Vanstone, S.A.: Handbook of applied cryptography. CRC Press (1997)
2. Bailey, D.V., Paar, C.: Optimal extension fields for fast arithmetic in public-key algorithms. In Krawczyk, H., ed.: Advances in Cryptology - CRYPTO’98. Volume 1462 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, Heidelberg, New York(1998) 472-485
3. Koblitz, N.: CM-curves with good cryptographic properties. In Feigenbaum, J., ed.: Advances in Cryptology - CRYPTO’91. Volume 576 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, Heidelberg, New York (1992) 279-287
4. Kobayashi, T., Morita, H., Kobayashi, K., Hoshino, F.: Fast elliptic curve algorithm combining frobenius map and table reference to adapt to higher characteristic. In Stern, J., ed.: Advances in Cryptology - EUROCRYPT’99. Volume 1592 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, Heidelberg, New York(1999) 176-189 (A preliminary version was written in Japanese and presented at SCIS’99-W4-1.4).
5. Solinas, J.A.: An improved algorithm for arithmetic on a family of elliptic curves. In Kaliski Jr., B.S., ed.: Advances in Cryptology - CRYPTO’97. Volume 1294 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, Heidelberg, New York (1997) 357-371
6. Lim, C.H., Lee, P.J.: More flexible exponentiation with precomputation. In Desmedt, Y.G., ed.: Advances in Cryptology - CRYPTO’94. Volume 839 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, Heidelberg, New York (1994) 95-107
7. n). In Imai, H., Zheng, Y., eds.: Public Key Cryptography - Third International Workshop on Practice and Theory in Public Key Cryptosystems, PKC 2000. Volume 1751 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, Heidelberg, New York (2000) 405-421
8. Lim, C.H., Hwang, H.S.: Speeding up elliptic scalar multiplication with precomputation. In Song, J.S., ed.: Information Security and Cryptology - ICISC’99. Volume 1787 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, Heidelberg, New York (2000) 102-119
9. n) based on optimal addition sequences. IEICE Transactions Fundamentals of Electronics, Communications and Computer Sciences (Japan) E84-A(2001) 114-119
10. Cohen, H., Miyaji, A., Ono, T.: Efficient elliptic curve exponentiation using mixed coordinates. In Ohta, K., Pei, D., eds.: Advances in Cryptology - ASIACRYPT’98. Volume 1514 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, Heidelberg, New York (1998) 51-65
11. Aoki, K., Hoshino, F., Kobayashi, T., Oguro, H.: Elliptic curve arithmetic using SIMD. In Davida, G., Frankel, Y., eds.: Information Security Conference - ISC’01. Lecture Notes in Computer Science. Springer-Verlag, Berlin, Heidelberg, New York (2001) to appear. (Preliminary version written in Japanese was appeared in SCIS2000-B05 and ISEC2000-161.).