Use of elliptic curves in cryptography
Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
Low-Energy Digit-Serial/Parallel Finite Field Multipliers
Journal of VLSI Signal Processing Systems - Special issue on application specific systems, architectures and processors
Elliptic curves in cryptography
Elliptic curves in cryptography
A New Addition Formula for Elliptic Curves over GF(2^n)
IEEE Transactions on Computers
Improved Algorithms for Elliptic Curve Arithmetic in GF(2n)
SAC '98 Proceedings of the Selected Areas in Cryptography
Fast Multiplication on Elliptic Curves over GF(2m) without Precomputation
CHES '99 Proceedings of the First International Workshop on Cryptographic Hardware and Embedded Systems
A Low-Power Design for an Elliptic Curve Digital Signature Chip
CHES '02 Revised Papers from the 4th International Workshop on Cryptographic Hardware and Embedded Systems
From Euclid's GCD to Montgomery Multiplication to the Great Divide
From Euclid's GCD to Montgomery Multiplication to the Great Divide
Power Aware Design of an Elliptic Curve Coprocessor for 8 bit Platforms
PERCOMW '06 Proceedings of the 4th annual IEEE international conference on Pervasive Computing and Communications Workshops
Elliptic Curve Cryptography on FPGA for Low-Power Applications
ACM Transactions on Reconfigurable Technology and Systems (TRETS)
Energy Efficient Elliptic Curve Processor
Integrated Circuit and System Design. Power and Timing Modeling, Optimization and Simulation
| Hi-index | 0.00 |
The designer of an elliptic curve processor is faced with many design choices that include the algorithm and coordinate system to be used. The power consumption of elliptic curve processors is becoming increasingly important as such processors find new uses in power constrained environments. This paper studies the effect that algorithm and coordinate choices have on the power consumption and energy per point multiplication of an FPGA based, reconfigurable elliptic curve processor.