Low-Power Elliptic Curve Cryptography Using Scaled Modular Arithmetic
We introduce new modulus scaling techniques for transforming a class of primes into special forms which enables efficient arithmetic. The scaling technique may be used to improve multiplication and inversion in finite fields. We present an efficient inversion algorithm that utilizes the structure of scaled modulus. Our inversion algorithm exhibits superior performance to the Euclidean algorithm and lends itself to efficient hardware implementation due to its simplicity. Using the scaled modulus technique and our specialized inversion algorithm we develop an elliptic curve processor architecture. The resulting architecture successfully utilizes redundant representation of elements in GF(p) and provides a low-power, high speed, and small footprint specialized elliptic curve implementation.
KeywordsElliptic Curve Clock Cycle Inversion Algorithm Elliptic Curve Cryptography Division Algorithm
- 3.Crandall, R.E.: Method and Apparatus for Public Key Exchange in a Cryptographic System. U.S. Patent Number 5,159,632 (October 1992) Google Scholar
- 8.National Institute for Standards and Technology. Digital Signature Standard (DSS). Federal Register 56,169 (August 1991) Google Scholar
- 10.Schroeppel, R., Orman, H., O’Malley, S., Spatscheck, O.: Fast key exchange with elliptic curve systems. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol. 963, pp. 43–56. Springer, Heidelberg (1995)Google Scholar
- 11.Solinas, J.A.: Generalized Mersenne Numbers. CORR-99-39, CACR Technical Report, University of Waterloo (1999)Google Scholar
- 13.Walter, C.D.: Faster Modular Multiplication by Operand Scaling. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 313–323. Springer, Heidelberg (1992)Google Scholar