A new approach to subquadratic space complexity parallel multipliers for extended binary fields
H Fan, MA Hasan - IEEE Transactions on Computers, 2007 - ieeexplore.ieee.org
Based on Toeplitz matrix-vector products and coordinate transformation techniques, we
present a new scheme for subquadratic space complexity parallel multiplication in GF (2 n) …
present a new scheme for subquadratic space complexity parallel multiplication in GF (2 n) …
Overlap-free Karatsuba–Ofman polynomial multiplication algorithms
H Fan, J Sun, M Gu, KY Lam - IET Information security, 2010 - IET
The authors describe how a simple way to split input operands allows for fast VLSI
implementations of subquadratic GF (2)[x] Karatsuba–Ofman multipliers. The theoretical …
implementations of subquadratic GF (2)[x] Karatsuba–Ofman multipliers. The theoretical …
A survey on hardware implementations of elliptic curve cryptosystems
B Rashidi - arxiv preprint arxiv:1710.08336, 2017 - arxiv.org
In the past two decades, Elliptic Curve Cryptography (ECC) have become increasingly
advanced. ECC, with much smaller key sizes, offers equivalent security when compared to …
advanced. ECC, with much smaller key sizes, offers equivalent security when compared to …
Block recombination approach for subquadratic space complexity binary field multiplication based on Toeplitz matrix-vector product
In this paper, we present a new method for parallel binary finite field multiplication which
results in subquadratic space complexity. The method is based on decomposing the …
results in subquadratic space complexity. The method is based on decomposing the …
Fast Reconfigurable Elliptic Curve Cryptography Acceleration for GF(2 m ) on 32 bit Processors
This paper focuses on the design and implementation of a fast reconfigurable method for
elliptic curve cryptography acceleration in GF (2 m). The main contribution of this paper is …
elliptic curve cryptography acceleration in GF (2 m). The main contribution of this paper is …
[BOOK][B] Architectures for cryptography accelerators
AE Cohen - 2007 - search.proquest.com
Elliptic curve cryptography invented in the 1980's and the Advanced Encryption Standard
(AES) standardized in 2002 have become important research topics in security because the …
(AES) standardized in 2002 have become important research topics in security because the …
Hybrid Analysis of TMVP for Modular Polynomial Multiplication in Cryptography
G Efe - 2022 - open.metu.edu.tr
Polynomial multiplication on the quotient ring Z [x]/< x^ n+-1> is one of the most
fundamental, general-purpose operations frequently used in cryptographic algorithms …
fundamental, general-purpose operations frequently used in cryptographic algorithms …
Scan vulnerability in elliptic curve cryptosystems
R Nara, N Togawa, M Yanagisawa… - IPSJ Transactions on …, 2011 - jstage.jst.go.jp
A scan-path test is one of the most important testing techniques, but it can be used as a side-
channel attack against a cryptography circuit. Scan-based attacks are techniques to …
channel attack against a cryptography circuit. Scan-based attacks are techniques to …
Design of low complexity GF(2m) multiplier based on Karatsuba algorithm
Z Ge, G Shou, Y Hu, Z Guo - 2011 IEEE 13th International …, 2011 - ieeexplore.ieee.org
The multiplication is the basic arithmetic operation of others over the finite field GF (2 m)
which have widespread applications. In this paper, we analyze the complexity of the classic …
which have widespread applications. In this paper, we analyze the complexity of the classic …
High speed modular divider based on GCD algorithm
AA Zadeh - … Security: 9th International Conference, ICICS 2007 …, 2007 - Springer
GCD algorithm is a well known algorithm for computing modular division and inversion
which is widely used in Elliptic Curve Cryptography (ECC). Also division is the most time …
which is widely used in Elliptic Curve Cryptography (ECC). Also division is the most time …