Abstract
In the underlying finite field arithmetic of an elliptic curve cryptosystem, field multiplication is the next computational costly operation other than field inversion. We present two novel algorithms for efficient implementation of field multiplication and modular reduction used frequently in an elliptic curve cryptosystem defined over GF(2n). We provide a complexity study of the two algorithms and present an implementation performance of the algorithms over GF(2167).
Chapter PDF
Similar content being viewed by others
References
Han, Y., Mitchell, C., Gollmann, D.: Minimal Weight k-SR Representation. In: Boyd, C. (ed.) Cryptography and Coding 1995. LNCS, vol. 1025, pp. 34–43. Springer, Heidelberg (1995)
Gollmann, D., Han, Y., Mitchell, C.: Redundant integer representations and fast exponentiation. Designs, Codes and Cryptography 7, 135–151 (1996)
Dewin, E.: Fast software Implementation for Arithmetic Operations in GF(2n). In: Kim, K.-c., Matsumoto, T. (eds.) ASIACRYPT 1996. LNCS, vol. 1163, pp. 65–76. Springer, Heidelberg (1996)
Gallant, R., Lambert, R., Vanstone, S.: Improving the Parallelized Pollard Lambda Search on Binary Anomalous Curves, P1363 Standards Internet Web Site (1998) Online available: http://grouper.ieee.org/groups/1363/contributions
Guajardo, J., Paar, C.: Efficient Algorithms for Elliptic Curve Cryptosystem. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 342–356. Springer, Heidelberg (1997)
Han, Y., Zhang, J., Tan, P.-C.: Efficient Elliptic Curve Cryptosystems. In: International Workshop on Cryptographic Techniques and E-Commerce (CrypTEC 1999), Hong Kong (1999)
Han, Y., Zhang, J., Tan, P.-C.: Direct Computation for Elliptic Curve Cryptosystem. In: Workshop on Cryptographic Hardware and Embedded Systems, Worcester Polytechnic Institute, Worcester, Massachusetts (1999)
Knuth, D.E.: The Art of Computer Programming, 2nd edn. Seminumerical Algorithms, vol. 2. Addison-Wesley, Reading (1981)
Koblitz, N.: Elliptic curve cryptosystems. Mathematics of Computation 48, 203–209 (1987)
Koc, C.K., Acar, T.: Montgomery Multiplication in GF(2k). In: Design, Codes and Cryptography, pp. 1–14. Kluwer Academic Publishers, Boston (1997)
Lidl, R., Niederreiter, H.: Introduction to Finite Fields and Their Applications. Cambridge University Press, Cambridge (1994)
Menezes, A.J.: Elliptic Curve Public Key Cryptosystems. Kluwer Academic Publishers, Boston (1993)
McEliece, R.J.: Finite Fields for Computer Scientist and Engineers. Kluwer Academic Publishers, Dordrecht (1987)
Miller, V.: Uses of elliptic curves in cryptography. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol. 218, pp. 417–426. Springer, Berlin (1986)
Morain, F., Olivos, J. et al: Speeding up the Computation on an Elliptic Curve using Addition-Subtraction Chains. In: RAIRO Informatique Theorique Et Applications - Theoretical Informatics and Applications, vol. 24(6), pp. 531–543 (1990)
Schroeppel, R., Orman, H., O’Malley, S., Spatscheck, O.: Fast key exchange with elliptic curve systems. In: Coppersmith, D. (ed.) Advances in Cryptology - CRYPTO 1995. LNCS, vol. 973, pp. 43–56. Springer, Heidelberg (1995)
Wiener, M.J., Zuccherato, R.J.: Faster Attacks on Elliptic Curve Crytosystems, IEEE P1363 Standards Internet Web Site (April 1998) Online available http://grouper.ieee.org/groups/1363/contributions
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Han, Y., Leong, PC., Tan, PC., Zhang, J. (1999). Fast Algorithms for Elliptic Curve Cryptosystems over Binary Finite Field. In: Lam, KY., Okamoto, E., Xing, C. (eds) Advances in Cryptology - ASIACRYPT’99. ASIACRYPT 1999. Lecture Notes in Computer Science, vol 1716. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-48000-6_8
Download citation
DOI: https://doi.org/10.1007/978-3-540-48000-6_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66666-0
Online ISBN: 978-3-540-48000-6
eBook Packages: Springer Book Archive