Area-time efficient hardware implementation of modular multiplication for elliptic curve cryptography
In this paper, an area-time efficient hardware implementation of modular multiplication over
five National Institute of Standard and Technology (NIST)-recommended prime fields is …
five National Institute of Standard and Technology (NIST)-recommended prime fields is …
ECSM: efficient FPGA implementation of elliptic curve scalar multiplication over generic prime field GF(p)
Elliptic curve scalar multiplication (ECSM) is the primitive operation that is also the main
computational hurdle in almost all protocols based on elliptic curve cryptography (ECC) …
computational hurdle in almost all protocols based on elliptic curve cryptography (ECC) …
High performance hardware support for elliptic curve cryptography over general prime field
Secure information exchange in resource constrained devices can be accomplished
efficiently through elliptic curve cryptography (ECC). Due to the high computational …
efficiently through elliptic curve cryptography (ECC). Due to the high computational …
FPGA-based optimized design of montgomery modular multiplier
AAH Abd-Elkader, M Rashdan… - … on Circuits and …, 2020 - ieeexplore.ieee.org
This brief introduces FPGA-based optimized implementation of Montgomery Modular
Multiplier (MMM) architecture. The novel architecture of the proposed design enhanced the …
Multiplier (MMM) architecture. The novel architecture of the proposed design enhanced the …
Low latency flexible FPGA implementation of point multiplication on elliptic curves over GF(p)
Elliptic curve cryptography (ECC) is a branch of Public‐Key cryptography that is widely
accepted for secure data exchange in many resource‐limited devices. This paper presents a …
accepted for secure data exchange in many resource‐limited devices. This paper presents a …
A design and implementation of montgomery modular multiplier
R Liu, S Li - 2019 IEEE International Symposium on Circuits …, 2019 - ieeexplore.ieee.org
Large integer multiplication is the critical operation to design a modular multiplier. Karatsuba
algorithm (KO algorithm) to split the operands into two parts is generally used to design a …
algorithm (KO algorithm) to split the operands into two parts is generally used to design a …
Efficient implementation of Montgomery modular multiplier on FPGA
AAH Abd-Elkader, M Rashdan… - Computers & Electrical …, 2022 - Elsevier
Recent developments in embedded devices have enhanced the demand for systems using
compact cryptographic modules. Modular multiplication with large modulus is a central …
compact cryptographic modules. Modular multiplication with large modulus is a central …
High-speed FPGA implementation of full-word Montgomery multiplier for ECC applications
Modular multiplication is the most crucial operation in many public-key crypto-systems,
which can be accomplished by integer multiplication followed by a reduction scheme. The …
which can be accomplished by integer multiplication followed by a reduction scheme. The …
Redundant-signed-digit-based high speed elliptic curve cryptographic processor
In this paper, a high speed elliptic curve cryptographic (ECC) processor for National Institute
of Standards and Technology (NIST) recommended prime P− 2 5 6 is proposed. The …
of Standards and Technology (NIST) recommended prime P− 2 5 6 is proposed. The …
A high‐speed RSD‐based flexible ECC processor for arbitrary curves over general prime field
This workpresents a novel high‐speed redundant‐signed‐digit (RSD)‐based elliptic curve
cryptographic (ECC) processor for arbitrary curves over a general prime field. The proposed …
cryptographic (ECC) processor for arbitrary curves over a general prime field. The proposed …