High-speed software multiplication in F2m

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

Volumn 1977, Issue , 2000, Pages 203-212

  L´Opez, Julio ^a   Dahab, Ricardo ^b  

^a UNIVERSIDAD DEL VALLE   (Colombia)

^b UNIVERSITY OF CAMPINAS   (Brazil)

Author keywords

Elliptic Curve Cryptography; Multiplication in F2m; Polynomial Basis

Indexed keywords

GEOMETRY;

ELLIPTIC CURVE CRYPTOGRAPHY; HIGH SPEED; MULTIPLICATION IN F2M; POLYNOMIAL BASIS; SHIFT-AND-ADD; SOFTWARE IMPLEMENTATION;

PUBLIC KEY CRYPTOGRAPHY;

EID: 84947777892     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44495-5_18     Document Type: Conference Paper

References (12)

1. G. B. Agnew, R. C. Mullin and S. A. Vanstone, “An implementation of elliptic curve cryptosystems over F 2155 ”, IEEE journal on selected areas in communications, 11, pp. 804-813, 1993. 203
2. ANSI X9.62, “The elliptic curve digital signature algorithm (ECDSA)”, American Bankers Association, 1999. 204
3. Blackberry, http://www.blackberry.net 210, 211
4. I. Blake, G. Seroussi, and N. Smart, Elliptic Curves in Cryptography, Cambridge University Press, 1999. 205, 208
5. C. K. Koc and T. Acar, “Montgomery multiplication in GF(2k)”, Designs, Codes and Cryptography, 14, pp. 57-69, 1998. 205
6. C. H. Lim and P. J. Lee, “More flexible exponentiation with precomputation”, In Advances in Cryptography-CRYPTO’94, pp. 95-107, Springer-Verlag, 1994. 203, 207
7. J. Lopez and R. Dahab, “Fast multiplication on elliptic curves over GF(2n) without precomputation”, Cryptographic Hardware and Embedded Systems -CHES’99, lNCS 1717, pp. 316-327, 1999. 211
8. A. Menezes, P. van Oorschot and S. Vanstone, Handbook of Applied Cryptography, CRC Press, 1997. 203
9. R. Mullin, I. Onyszchuk, S. Vanstone and R. Wilson, “Optimal normal bases in GF(pn)”, Discrete Applied Mathematics, 22, pp. 149-161
10. National Institute of Standards and Technology, “Digital signature standard”, FIPS Publication 186-2, February 2000. Available at http://csrc.nist.gov/fips 210
11. R. Schroeppel, H. Orman, S. O’Malley and O. Spatscheck, “Fast key exchange with elliptic curve systems”, University of Arizona, C. S., Tech. report 95-03, 1995. 205, 206
12. E. De Win, A. Bosselaers, S. Vanderberghe, P. De Gersem and J. Vandewalle, “A fast software implementation for arithmetic operations in GF(2n),” Advances in Cryptology, Proc. Asiacrypt’96, LNCS 1163, pp. 65-76, Springer-Verlag, 1996. 205