Use of elliptic curves in cryptography
Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
Implementing elliptic curve cryptography
Implementing elliptic curve cryptography
Exceptional Procedure Attackon Elliptic Curve Cryptosystems
PKC '03 Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography: Public Key Cryptography
Fast elliptic curve cryptography on FPGA
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
An Introduction to Mathematical Cryptography
An Introduction to Mathematical Cryptography
High Speed Compact Elliptic Curve Cryptoprocessor for FPGA Platforms
INDOCRYPT '08 Proceedings of the 9th International Conference on Cryptology in India: Progress in Cryptology
CT-RSA'11 Proceedings of the 11th international conference on Topics in cryptology: CT-RSA 2011
FPGA implementation of binary edwards curve usingternary representation
Proceedings of the 21st edition of the great lakes symposium on Great lakes symposium on VLSI
On the implementation of unified arithmetic on binary huff curves
CHES'13 Proceedings of the 15th international conference on Cryptographic Hardware and Embedded Systems
| Hi-index | 0.00 |
Conventional Elliptic Curve (EC) cryptosystems are subjected to side channel attacks because of their lack of unifiedness. On the other hand, unified cryptosystems based on Edwards curves have been found to be slow. The present paper proposes the first VLSI design of binary Huff curves, which also lead to unified scalar multiplication. Several optimized architectural features have been developed to utilize the FPGA resources better, and yet lead to a faster circuit. Experimental results have been presented on the standard NIST curves, and on state-of-the-art GF(2233) to show that the design is significantly faster than other unified EC cryptosystems.