Low-Power Elliptic Curve Cryptography Using Scaled Modular Arithmetic [chapter]

E. Öztürk, B. Sunar, E. Savaş
2004 Lecture Notes in Computer Science  
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
more » ... 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.
doi:10.1007/978-3-540-28632-5_7 fatcat:m434epm46bgxlmdp7it4mogxdy