A scalable dual-field elliptic curve cryptographic processor
- 2 April 2003
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 52 (4), 449-460
- https://doi.org/10.1109/tc.2003.1190586
Abstract
We propose an elliptic curve (EC) cryptographic processor architecture that can support Galois fields GF(p) and GF(2/sup n/) for arbitrary prime numbers and irreducible polynomials by introducing a dual field multiplier. A Montgomery multiplier with an optimized data bus and an on-the-fly redundant binary converter boost the throughput of the EC scalar multiplication. All popular cryptographic functions such as DSA, EC-DSA, RSA, CRT, and prime generation are also supported. All commands are organized in a hierarchical structure according to their complexity. Our processor has high scalability and flexibility between speed, hardware area, and operand size. In the hardware evaluation using a 0.13-/spl mu/m CMOS standard cell library, the high-speed design using 117.5 Kgates with a 64-bit multiplier achieved operation times of 1.21 ms and 0.19 ms for a 160-bit EC scalar multiplication in GF(p) and GF(2/sup n/), respectively. A compact version with an 8-bit multiplier requires only 28.3 K gates and executes the operations in 7.47 ms and 2.79 ms. Not only 160-bit operations, but any bit length can be supported by any hardware configuration so long as the memory capacity is sufficient.This publication has 19 references indexed in Scilit:
- An implementation of ElGamal elliptic curves cryptosystemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Rapid prototyping for hardware accelerated elliptic curve public-key cryptosystemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- FPGA implementation of a microcoded elliptic curve cryptographic processorPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Efficient Implementation of Elliptic Curve Cryptosystems on an ARM7 with Hardware AcceleratorLecture Notes in Computer Science, 2001
- Use of Elliptic Curves in CryptographyPublished by Springer Science and Business Media LLC ,2000
- Implementation of Elliptic Curve Cryptographic Coprocessor over GF(2m) on an FPGALecture Notes in Computer Science, 2000
- An Energy Efficient Reconfigurable Public-Key Cryptography Processor ArchitectureLecture Notes in Computer Science, 2000
- Analyzing and comparing Montgomery multiplication algorithmsIEEE Micro, 1996
- Elliptic curve cryptosystemsMathematics of Computation, 1987
- Modular Multiplication Without Trial DivisionMathematics of Computation, 1985