Systolic finite field multiplier over GF (2 m), because of its superior features such as high
throughput and regularity, is highly desirable for many demanding cryptosystems. On the …

In this paper, a novel high-speed elliptic curve cryptography (ECC) processor
implementation for point multiplication (PM) on field-programmable gate array (FPGA) is …

High throughput while maintaining low resource is a key issue for elliptic curve cryptography
(ECC) hardware implementations in many applications. In this brief, an ECC processor …

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 …

A new and highly efficient architecture for elliptic curve scalar point multiplication is
presented. To achieve the maximum architectural and timing improvements, we reorganize …

Efficient implementation of point multiplication is crucial for elliptic curve cryptographic
systems. This paper presents the implementation results of an elliptic curve crypto-processor …

This paper proposes an efficient pipelined architecture of elliptic curve scalar multiplication
(ECSM) over GF (2 m). The architecture uses a bit-parallel finite field (FF) multiplier …

High-performance Elliptic Curve Cryptography (ECC) implementation in encryption
authentication severs has become a challenge due to the explosive growth of e-commerce's …

Recently, considerable research has been performed in cryptography and security to
optimize the area, power, timing, and energy needed for the point multiplication operations …

For cryptographic algorithms, such as elliptic curve digital signature algorithm (ECDSA) and
pairing algorithm, the crypto-processors are required to perform large number of additions …