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) …

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 …

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 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 …

This paper presents complexity analysis [both in application-specific integrated circuits
(ASICs) and on field-programmable gate arrays (FPGAs)] and efficient FPGA …

This paper addresses efficient and high-throughput implementations of AES-GCM optimized
for FPGAs. Two main components, the AES engine and the modular multiplication over GF …

Security is a critical challenge for the effective expansion of all new emerging applications in
the Internet of Things paradigm. Therefore, it is necessary to define and implement different …

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 …

A fast parallel architecture for the implementation of elliptic curve scalar multiplication over
binary fields is presented. The proposed architecture is implemented on a single-chip FPGA …

Summary form only given. We present a generic parallel architecture for fast elliptic curve
scalar multiplication over binary extension fields. We show how the parallel strategy …