Elliptic curve cryptography
D Hankerson, A Menezes - Encyclopedia of Cryptography, Security and …, 2021 - Springer
Background Elliptic curve cryptographic schemes were proposed independently in 1985 by
Neal Koblitz (Koblitz 1987) and Victor Miller (Miller 1986). They are the elliptic curve …
Neal Koblitz (Koblitz 1987) and Victor Miller (Miller 1986). They are the elliptic curve …
Public-key cryptography for RFID-tags
L Batina, J Guajardo, T Kerins… - Fifth Annual IEEE …, 2007 - ieeexplore.ieee.org
RFID-tags are a new generation of bar-codes with added functionality. An emerging
application is the use of RFID-tags for anti-counterfeiting by embedding them into a product …
application is the use of RFID-tags for anti-counterfeiting by embedding them into a product …
Fast elliptic curve cryptography on FPGA
WN Chelton, M Benaissa - … on very large scale integration (VLSI …, 2008 - ieeexplore.ieee.org
This paper details the design of a new high-speed pipelined application-specific instruction
set processor (ASIP) for elliptic curve cryptography (ECC) using field-programmable gate …
set processor (ASIP) for elliptic curve cryptography (ECC) using field-programmable gate …
A High-Performance Reconfigurable Elliptic Curve Processor for GF(2m)
G Orlando, C Paar - … on Cryptographic Hardware and Embedded Systems, 2000 - Springer
This work proposes a processor architecture for elliptic curves cryptosystems over fields GF
(2 m). This is a scalable architecture in terms of area and speed that exploits the abilities of …
(2 m). This is a scalable architecture in terms of area and speed that exploits the abilities of …
[HTML][HTML] A survey of some recent bit-parallel GF (2n) multipliers
H Fan, MA Hasan - Finite Fields and Their Applications, 2015 - Elsevier
This paper surveys bit-parallel multipliers for finite field GF (2 n) according to i) quadratic and
subquadratic arithmetic complexities of the underlying algorithms, ii) various bases used for …
subquadratic arithmetic complexities of the underlying algorithms, ii) various bases used for …
[BOOK][B] Wireless security and cryptography: specifications and implementations
As the use of wireless devices becomes widespread, so does the need for strong and
secure transport protocols. Even with this intensified need for securing systems, using …
secure transport protocols. Even with this intensified need for securing systems, using …
High-speed hardware implementations of elliptic curve cryptography: A survey
GM De Dormale, JJ Quisquater - Journal of systems architecture, 2007 - Elsevier
For the last decade, Elliptic Curve Cryptography (ECC) has gained increasing acceptance in
the industry and the academic community and has been the subject of several standards …
the industry and the academic community and has been the subject of several standards …
An end-to-end systems approach to elliptic curve cryptography
Since its proposal by Victor Miller [17] and Neal Koblitz [15] in the mid 1980s, Elliptic Curve
Cryptography (ECC) has evolved into a mature public-key cryptosystem. Offering the …
Cryptography (ECC) has evolved into a mature public-key cryptosystem. Offering the …
Efficient algorithms and architectures for field multiplication using Gaussian normal bases
A Reyhani-Masoleh - IEEE Transactions on Computers, 2005 - ieeexplore.ieee.org
Recently, implementations of normal basis multiplication over the extended binary field GF
(2/sup m/) have received considerable attention. A class of low complexity normal bases …
(2/sup m/) have received considerable attention. A class of low complexity normal bases …
Optimum digit serial GF (2^ m) multipliers for curve-based cryptography
Digit serial multipliers are used extensively in hardware implementations of elliptic and
hyperelliptic curve cryptography. This contribution shows different architectural …
hyperelliptic curve cryptography. This contribution shows different architectural …