An efficient hardware implementation of the elliptic curve cryptographic processor over prime field,

2020 ◽  
Vol 48 (8) ◽  
pp. 1256-1273 ◽  
Author(s):  
Thirumalesu Kudithi ◽  
Sakthivel R
Keyword(s):  
Elliptic Curve ◽  
Hardware Implementation ◽  
Prime Field

MicroBlaze-Based Multiprocessor Embedded Cryptosystem on FPGA for Elliptic Curve Scalar Multiplication Over Fp

2019 ◽  
Vol 28 (03) ◽  
pp. 1950037 ◽  
Author(s):  
A. Bellemou ◽  
N. Benblidia ◽  
M. Anane ◽  
M. Issad
Keyword(s):  
Elliptic Curve ◽  
Scalar Multiplication ◽  
Security Level ◽  
Prime Field ◽  
Montgomery Modular Multiplication ◽  
Parallel Implementations ◽  
High Radix ◽  
System On Programmable Chip ◽  
Xilinx Fpga ◽  
Elliptic Curve Scalar Multiplication

In this paper, we present Microblaze-based parallel architectures of Elliptic Curve Scalar Multiplication (ECSM) computation for embedded Elliptic Curve Cryptosystem (ECC) on Xilinx FPGA. The proposed implementations support arbitrary Elliptic Curve (EC) forms defined over large prime field ([Formula: see text]) with different security-level sizes. ECSM is performed using Montgomery Power Ladder (MPL) algorithm in Chudnovsky projective coordinates system. At the low abstraction level, Montgomery Modular Multiplication (MMM) is considered as the critical operation. It is implemented within a hardware Accelerator MMM (AccMMM) core based on the modified high radix, [Formula: see text] MMM algorithm. The efficiency of our parallel implementations is achieved by the combination of the mixed SW/HW approach with Multi Processor System on Programmable Chip (MPSoPC) design. The integration of multi MicroBlaze processor in single architecture allows not only the flexibility of the overall system but also the exploitation of the parallelism in ECSM computation with several degrees. The Virtex-5 parallel implementations of 256-bit and 521-bis ECSM computations run at 100[Formula: see text]MHZ frequency and consume between 2,739 and 6,533 slices, 22 and 72 RAMs and between 16 and 48 DSP48E cores. For the considered security-level sizes, the delays to perform single ECSM are between 115[Formula: see text]ms and 14.72[Formula: see text]ms.

scholarly journals A High-Speed Elliptic Curve Cryptography Processor for Teleoperated Systems Security

2021 ◽  
Vol 2021 ◽  
pp. 1-8
Author(s):  
Yong Xiao ◽  
Weibin Lin ◽  
Yun Zhao ◽  
Chao Cui ◽  
Ziwen Cai
Keyword(s):  
Elliptic Curve ◽  
Elliptic Curve Cryptography ◽  
High Speed ◽  
High Performance ◽  
Prime Field ◽  
Practical Applications ◽  
Cell Library ◽  
Cryptographic Algorithm ◽  
Human Operators ◽  
Key Length

Teleoperated robotic systems are those in which human operators control remote robots through a communication network. The deployment and integration of teleoperated robot’s systems in the medical operation have been hampered by many issues, such as safety concerns. Elliptic curve cryptography (ECC), an asymmetric cryptographic algorithm, is widely applied to practical applications because its far significantly reduced key length has the same level of security as RSA. The efficiency of ECC on GF (p) is dictated by two critical factors, namely, modular multiplication (MM) and point multiplication (PM) scheduling. In this paper, the high-performance ECC architecture of SM2 is presented. MM is composed of multiplication and modular reduction (MR) in the prime field. A two-stage modular reduction (TSMR) algorithm in the SCA-256 prime field is introduced to achieve low latency, which avoids more iterative subtraction operations than traditional algorithms. To cut down the run time, a schedule is put forward when exploiting the parallelism of multiplication and MR inside PM. Synthesized with a 0.13 um CMOS standard cell library, the proposed processor consumes 341.98k gate areas, and each PM takes 0.092 ms.

Efficient Hardware Implementation of 256-bit ECC Processor Over Prime Field

2019 ◽  
Author(s):  
Md. Shahinur Rahman ◽  
Md. Selim Hossain ◽  
Enamul Hasan Rahat ◽  
Debopriya Roy Dipta ◽  
Hossain Mansur Resalat Faruque ◽  
...  
Keyword(s):  
Hardware Implementation ◽  
Prime Field

Key generation based on elliptic curve over finite prime field

2012 ◽  
Vol 4 (1) ◽  
pp. 65 ◽  
Author(s):  
S. Maria Celestin Vigila ◽  
K. Muneeswaran
Keyword(s):  
Elliptic Curve ◽  
Key Generation ◽  
Prime Field ◽  
Finite Prime Field

How the Number of Points of An Elliptic Curve Over a Fixed Prime Field Varies

1968 ◽  
Vol s1-43 (1) ◽  
pp. 57-60 ◽  
Author(s):  
B. J. Birch
Keyword(s):  
Elliptic Curve ◽  
Prime Field
Sign in / Sign up

Export Citation Format

Share Document