Implementation of binary edwards curves for very-constrained devices
- 1 July 2010
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10636862,p. 185-191
Abstract
Elliptic Curve Cryptography (ECC) is considered as the best candidate for Public-Key Cryptosystems (PKC) for ubiquitous security. Recently, Elliptic Curve Cryptography (ECC) based on Binary Edwards Curves (BEC) has been proposed and it shows several interesting properties, e.g., completeness and security against certain exceptional-points attacks. In this paper, we propose a hardware implementation of the BEC for extremely constrained devices. The w-coordinates and Montgomery powering ladder are used. Next, we also give techniques to reduce the register file size, which is the largest component of the embedded core. Thirdly, we apply gated clocking to reduce the overall power consumption. The implementation has a size of 13,427 Gate Equivalent (GE), and 149.5 ms are required for one point multiplication. To the best of our knowledge, this is the first hardware implementation of binary Edwards curves.Keywords
This publication has 13 references indexed in Scilit:
- ECC Is Ready for RFID – A Proof in Silicon2009
- Elliptic-Curve-Based Security Processor for RFIDIEEE Transactions on Computers, 2008
- Low-cost implementations of NTRU for pervasive security2008
- On Privacy Models for RFID2007
- Use of Elliptic Curves in Cryptography2000
- Fast Multiplication on Elliptic Curves Over GF(2m) without precomputation1999
- Effective recursive algorithm for computing multiplicative inverses in GF (2 m )Electronics Letters, 1988
- Elliptic curve cryptosystemsMathematics of Computation, 1987
- A method for obtaining digital signatures and public-key cryptosystemsCommunications of the ACM, 1978
- New directions in cryptographyIEEE Transactions on Information Theory, 1976