[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 …
[LIVRE][B] Security in RFID and sensor networks
P Kitsos - 2016 - taylorfrancis.com
In the past several years, there has been an increasing trend in the use of Radio Frequency
Identification (RFID) and Wireless Sensor Networks (WSNs) as well as in the integration of …
Identification (RFID) and Wireless Sensor Networks (WSNs) as well as in the integration of …
Efficient and Scalable FPGA Design of GF() Inversion for Post-Quantum Cryptosystems
Post-quantum cryptosystems based on QC-MDPC codes are designed to mitigate the
security threat posed by quantum computers to traditional public-key cryptography. The …
security threat posed by quantum computers to traditional public-key cryptography. The …
High-speed hardware architecture of scalar multiplication for binary elliptic curve cryptosystems
In this paper a hardware architecture of scalar multiplication based on Montgomery ladder
algorithm for binary elliptic curve cryptography is presented. In the proposed architecture …
algorithm for binary elliptic curve cryptography is presented. In the proposed architecture …
High performance HITA based Binary Edward Curve Crypto processor for FPGA platforms
In an embedded and resource-constrained environment, Elliptic Curve Cryptography (ECC)
has been noted as an efficient and suitable methodology for achieving information security …
has been noted as an efficient and suitable methodology for achieving information security …
Fast and Generic Inversion Architectures Over Using Modified Itoh–Tsujii Algorithms
J Hu, W Guo, J Wei… - IEEE Transactions on …, 2015 - ieeexplore.ieee.org
Finite field inversion is the most computationally intensive field operation in public-key
cryptographic algorithms such as elliptic curve cryptography. In this brief, we propose two …
cryptographic algorithms such as elliptic curve cryptography. In this brief, we propose two …
High speed compact elliptic curve cryptoprocessor for FPGA platforms
This paper proposes an efficient high speed implementation of an elliptic curve crypto
processor (ECCP) for an FPGA platform. The main optimization goal for the ECCP is efficient …
processor (ECCP) for an FPGA platform. The main optimization goal for the ECCP is efficient …
Revisiting the Itoh-Tsujii inversion algorithm for FPGA platforms
The Itoh-Tsujii multiplicative inverse algorithm (ITA) forms an integral component of several
cryptographic implementations such as elliptic curve cryptography. For binary fields …
cryptographic implementations such as elliptic curve cryptography. For binary fields …
Fast Inversion in ${\schmi {GF (2^ m)}} $ with Normal Basis Using Hybrid-Double Multipliers
Fast inversion in finite fields is crucial for high-performance cryptography and codes. We
present techniques to exploit the recently proposed hybrid-double multipliers for fast …
present techniques to exploit the recently proposed hybrid-double multipliers for fast …
High‐performance and high‐speed implementation of polynomial basis Itoh–Tsujii inversion algorithm over GF(2m)
In this study high‐performance and high‐speed field‐programmable gate array (FPGA)
implementations of polynomial basis Itoh–Tsujii inversion algorithm (ITA) over GF (2m) …
implementations of polynomial basis Itoh–Tsujii inversion algorithm (ITA) over GF (2m) …