Efficient elliptic curve point multiplication using digit-serial binary field operations

GD Sutter, JP Deschamps… - IEEE Transactions on …, 2012 - ieeexplore.ieee.org
This paper details the design of a new high-speed point multiplier for elliptic curve
cryptography using either field-programmable gate array or application-specified integrated …

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 …

Efficient FPGA implementations of point multiplication on binary Edwards and generalized Hessian curves using Gaussian normal basis

R Azarderakhsh… - IEEE Transactions on Very …, 2011 - ieeexplore.ieee.org
Efficient implementation of point multiplication is crucial for elliptic curve cryptographic
systems. This paper presents the implementation results of an elliptic curve crypto-processor …

Novel Architecture for Efficient FPGA Implementation of Elliptic Curve Cryptographic Processor Over

H Mahdizadeh, M Masoumi - IEEE transactions on very large …, 2013 - ieeexplore.ieee.org
A new and highly efficient architecture for elliptic curve scalar point multiplication is
presented. To achieve the maximum architectural and timing improvements, we reorganize …

On parallelization of high-speed processors for elliptic curve cryptography

K Jarvinen, J Skytta - IEEE Transactions on Very Large Scale …, 2008 - ieeexplore.ieee.org
This paper discusses parallelization of elliptic curve cryptography hardware accelerators
using elliptic curves over binary fields F 2m. Elliptic curve point multiplication, which is the …

High-Performance Pipelined Architecture of Elliptic Curve Scalar Multiplication Over GF( )

L Li, S Li - IEEE Transactions on Very Large Scale Integration …, 2015 - ieeexplore.ieee.org
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 …

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 …

High-speed hardware architecture of scalar multiplication for binary elliptic curve cryptosystems

B Rashidi, SM Sayedi, RR Farashahi - Microelectronics journal, 2016 - Elsevier
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 …

Parallel Itoh–Tsujii multiplicative inversion algorithm for a special class of trinomials

F Rodríguez-Henríquez, G Morales-Luna… - Designs, Codes and …, 2007 - Springer
In this contribution, we derive a novel parallel formulation of the standard Itoh–Tsujii
algorithm for multiplicative inverse computation over the field GF (2 m). The main building …

[PDF][PDF] Survey and analysis of hardware cryptographic and steganographic systems on FPGA

S Rajagopalan, R Amirtharajan… - Journal of Applied …, 2012 - researchgate.net
Little brooks make great rivers-says a proverb. Information science involves not only the
efforts made for gathering, acquiring or collecting the data that corresponds to the …