High-speed hardware implementations of Elliptic Curve Cryptography: A survey
Journal of Systems Architecture: the EUROMICRO Journal
Journal of VLSI Signal Processing Systems
IEEE Transactions on Computers
Fast elliptic curve cryptography on FPGA
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Computers and Electrical Engineering
High Speed Compact Elliptic Curve Cryptoprocessor for FPGA Platforms
INDOCRYPT '08 Proceedings of the 9th International Conference on Cryptology in India: Progress in Cryptology
Fast point multiplication on Koblitz curves: Parallelization method and implementations
Microprocessors & Microsystems
On parallelization of high-speed processors for elliptic curve cryptography
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Koblitz curves and integer equivalents of frobenius expansions
SAC'07 Proceedings of the 14th international conference on Selected areas in cryptography
Efficient finite field processor for GF(2163) and its implementation
International Journal of High Performance Systems Architecture
Customizable elliptic curve cryptosystems
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
FPGA implementation of point multiplication on koblitz curves using kleinian integers
CHES'06 Proceedings of the 8th international conference on Cryptographic Hardware and Embedded Systems
Integration, the VLSI Journal
Controlling incoming connections using certificates and distributed hash tables
NEW2AN'07 Proceedings of the 7th international conference on Next Generation Teletraffic and Wired/Wireless Advanced Networking
Pushing the limits of high-speed GF(2m) elliptic curve scalar multiplication on FPGAs
CHES'12 Proceedings of the 14th international conference on Cryptographic Hardware and Embedded Systems
| Hi-index | 0.00 |
In this paper a high performance elliptic curve co-processoris developed which is optimized for a binary fieldrecommended by NIST. The architecture uses a field multipliercapable of performing a field multiplication over theextension field with degree 163 in 0.060 µsec. The co-processoruses López and Dahab's projective coordinatesystem and is optimized specifically for Koblitz curves. Anefficient implementation of Itoh and Tsujii's method for inversionwith performance comparable to the extended Euclideanalgorithm is used. A prototype of the processor hasbeen implemented for the binary extension field with degree163 on a Xilinx XCV2000E FPGA. The prototype runs at 66MHz and performs an elliptic curve scalar multiplication in0.233 msec on a generic curve and 0.075 msec on a Koblitzcurve.