Abstract
In this paper, we propose fast finite field and elliptic curve (EC) algorithms useful for embedding cryptographic functions on high performance device such that most instructions take just one cycle. In such case, the integer multiplications and additions have the same com- putational cost so that the computational cost analyses that were pre- viously done in traditional manner may be invalid and in some cases the new algorithms should be introduced for fast computation. In our implementation, column major method for field multiplication and BP inversion algorithm are used for fast field arithmetic, and mixed coor- dinates method is used for efficient EC exponentiation. We give here analyses on various algorithms that are useful for implementing EC ex- ponentiation on CalmRISC microcontroller with MAC2424 coprocessor, as well as new exact analyses on BP (Bailey-Paar) inversion algorithm and EC exponentiation. Using techniques shown in this paper, we imple- mented EC exponentiation for various coordinate systems and the best result took 122ms, assuming 50ns clock cycle.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Bailey, D., Paar, C.: Efficient Arithmetic in Finite Field Extensions with Application in Elliptic Curve Cryptography, To appear in Journal of Cryptology (Available at http://ece.wpi.edu/People/faculty/cxp.html)
Bailey, D. V. and Paar, C.: Optimal extension field for fast arithmetic in public key algorithms, Advances in Cryptology-Crypto’98, Lecture Notes in Computer Science, Vol 1462. Springer-Verlag, (1998), 472–485.
Chudnovsky, D. V. and Chudnovsky, G. V.: Sequences of numbers generated by addition in formal groups and new primality and factorization tests, Advances in Applied Math., Vol. 7. (1986), 385–434.
Cohen, H.: A course in computational algebraic number theory, Graduate Texts in Math., Vol. 138. Springer-Verlag, (1993).
Cohen, H., Miyaji, A. and Ono, T.: Efficient Elliptic Curve Exponentiation Using Mixed Coordinates, Advances in Cryptology-Asiacrypt’98, Lecture Notes in Computer Science, Vol. 1514. Springer-Verlag, (1998), 50–65.
IEEE P1363: Standard Specifications for Public Key Cryptography, Working Draft 12, Nov. (1999).
Itoh, K., Takenaka, M., Torll, N., Temma, S. and Kurihara, Y.: Fast Implementation of Public-Key Cryptography on a DSP TMS320C6201, Cryptographic Hardware and Embedded Systems`99, Lecture Notes in Computer Science, Vol. 1717. Springer Verlag, (1999), 61–72.
Koblitz, N.:, Elliptic Curve Cryptosystems, Math. Comp., Vol. 48. pp. (1987), 203–209.
Koyama, K. and Tsuruoka, Y.: Speeding up elliptic cryptosystems by using a signed binary window method, Advances in Cryptology-Proceedings of Crypto’92, Lecture Notes in Computer Science, Vol. 740. Springer-Verlag, (1993), 345–357.
Lim, C. H. and Hwang, H. S.: Fast Implementation of Elliptic Curve Arithmetic in GF(pn), Public Key Cryptography, Lecture Notes in Computer Science, Vol. 1751. Springer-Verlag, (2000), 405–421.
Miller, V. S.: Use of Elliptic Curves in Cryptography, Advances in Cryptology-Proceedings of Crypto’85, Lecture Notes in Computer Science, Vol. 218. Springer-Verlag, (1986), 417–426.
Silverman, J. H.: The Arithmetic of Elliptic Curves, GTM 106. Springer-Verlag, New York (1986).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wook Chung, J., Gyoo Sim, S., Joong Lee, P. (2000). Fast Implementation of Elliptic Curve Defined over GF(pm) on CalmRISC with MAC2424 Coprocessor. In: Koç, Ç.K., Paar, C. (eds) Cryptographic Hardware and Embedded Systems — CHES 2000. CHES 2000. Lecture Notes in Computer Science, vol 1965. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44499-8_4
Download citation
DOI: https://doi.org/10.1007/3-540-44499-8_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41455-1
Online ISBN: 978-3-540-44499-2
eBook Packages: Springer Book Archive