A fast algorithm for computing multiplicative inverses in GF(2m) using normal bases
Information and Computation
The State of Elliptic Curve Cryptography
Designs, Codes and Cryptography - Special issue on towards a quarter-century of public key cryptography
Elliptic curves in cryptography
Elliptic curves in cryptography
Bit-Parallel Finite Field Multiplier and Squarer Using Polynomial Basis
IEEE Transactions on Computers
Fast Multiplication on Elliptic Curves over GF(2m) without Precomputation
CHES '99 Proceedings of the First International Workshop on Cryptographic Hardware and Embedded Systems
Efficient Finite Field Serial/Parallel Multiplication
ASAP '96 Proceedings of the IEEE International Conference on Application-Specific Systems, Architectures, and Processors
A Versatile and Scalable Digit-Serial/Parallel Multiplier Architecture for Finite Fields GF(2m)
ITCC '03 Proceedings of the International Conference on Information Technology: Computers and Communications
Software Multiplication Using Gaussian Normal Bases
IEEE Transactions on Computers
Journal of VLSI Signal Processing Systems
Fast elliptic curve cryptography on FPGA
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
FPGA implementation of high performance elliptic curve cryptographic processor over GF(2163)
Journal of Systems Architecture: the EUROMICRO Journal
High-Performance Architecture of Elliptic Curve Scalar Multiplication
IEEE Transactions on Computers
Fast point multiplication on Koblitz curves: Parallelization method and implementations
Microprocessors & Microsystems
Wireless Security and Cryptography: Specifications and Implementations
Wireless Security and Cryptography: Specifications and Implementations
Compact and Flexible Microcoded Elliptic Curve Processor for Reconfigurable Devices
FCCM '09 Proceedings of the 2009 17th IEEE Symposium on Field Programmable Custom Computing Machines
Field inversion and point halving revisited
IEEE Transactions on Computers
| Hi-index | 0.00 |
This work presents efficient hardware architectures for elliptic curves cryptoprocessors using polynomial and gaussian normal basis. The scalar point multiplication is implemented using random curves over GF(2233) and the Lopez-Dahab algorithm. In this case, the GF(2m) multiplication is implemented in hardware using three algorithms for polynomial basis (PB) and three for gaussian normal basis (GNB). The cryptoprocessors based on PB with D=32 and GNB with D=30 use 76 µs and 60 µs for scalar multiplication and 26697 and 18567 ALUTs, respectively. The compilation and synthesis results show that the GNB cryptoprocessor presents a better performance than PB cryptoprocessor. However, the last one is less complex and more scalable from the design point of view.