Finite field for scientists and engineers
Finite field for scientists and engineers
A fast algorithm for computing multiplicative inverses in GF(2m) using normal bases
Information and Computation
Elliptic curves in cryptography
Elliptic curves 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
RFID Handbook: Fundamentals and Applications in Contactless Smart Cards and Identification
RFID Handbook: Fundamentals and Applications in Contactless Smart Cards and Identification
Elliptic Curves: Number Theory and Cryptography
Elliptic Curves: Number Theory and Cryptography
RFID: Applications, Security, and Privacy
RFID: Applications, Security, and Privacy
Public-Key Cryptography for RFID-Tags
PERCOMW '07 Proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications Workshops
Elliptic-Curve-Based Security Processor for RFID
IEEE Transactions on Computers
Wireless Security and Cryptography: Specifications and Implementations
Wireless Security and Cryptography: Specifications and Implementations
RFID-Tags for anti-counterfeiting
CT-RSA'06 Proceedings of the 2006 The Cryptographers' Track at the RSA conference on Topics in Cryptology
Low-Cost elliptic curve cryptography for wireless sensor networks
ESAS'06 Proceedings of the Third European conference on Security and Privacy in Ad-Hoc and Sensor Networks
Handbook of Elliptic and Hyperelliptic Curve Cryptography, Second Edition
Handbook of Elliptic and Hyperelliptic Curve Cryptography, Second Edition
Low-resource hardware design of an elliptic curve processor for contactless devices
WISA'10 Proceedings of the 11th international conference on Information security applications
| Hi-index | 0.00 |
RFID tags will supplant barcodes for product identification in the supply chain. The capability of a tag to be read without a line of sight is its principal benefit, but compromises the privacy of the tag owner. Public key cryptography can restore this privacy. Because of the extreme economic constraints of the application, die area and power consumption for cryptographic functions must be minimized. Elliptic curve processors efficiently provide the cryptographic capability needed for RFID. This paper proposes efficient architectures for elliptic curve processors in GF(2m). One design requires six m-bit registers and six Galois field multiply operations per key bit. The other design requires five m-bit registers and seven Galois field multiply operations per key bit. These processors require a small number of circuit elements and clock cycles while providing protection from simple side-channel attacks. Synthesis results are presented for power, area, and delay in 250, 130 and 90 nm technologies. Compared with prior designs from the literature, the proposed processors require less area and energy. For the B-163 curve, with bit-serial multiplier, the first proposed design synthesized in an IBM low-power 130 nm technology requires an area of 9613 gate equivalents, 163,355 cycles and 4.14 µJ for an elliptic curve point multiplication. The other proposed design requires 8756 gate equivalents, 190,570 cycles and 4.19 µJ.