Hardware Implementation of Text Encryption using Elliptic Curve Cryptography over 192 bit Prime Field

2018 ◽  
Author(s):  
Mohita Jaiswal ◽  
Kusum Lata
Keyword(s):  
Elliptic Curve ◽  
Elliptic Curve Cryptography ◽  
Hardware Implementation ◽  
Prime Field

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.

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

High performance hardware support for elliptic curve cryptography over general prime field

2017 ◽  
Vol 51 ◽  
pp. 331-342 ◽  
Author(s):  
Khalid Javeed ◽  
Xiaojun Wang ◽  
Mike Scott
Keyword(s):  
Elliptic Curve ◽  
Elliptic Curve Cryptography ◽  
High Performance ◽  
Hardware Support ◽  
Prime Field

scholarly journals Area-Time Efficient Hardware Implementation of Modular Multiplication for Elliptic Curve Cryptography

IEEE Access ◽  
2020 ◽  
Vol 8 ◽  
pp. 73898-73906 ◽  
Author(s):  
MD. Mainul Islam ◽  
MD. Selim Hossain ◽  
MD. Shahjalal ◽  
MOH. Khalid Hasan ◽  
Yeong Min Jang
Keyword(s):  
Elliptic Curve ◽  
Elliptic Curve Cryptography ◽  
Hardware Implementation ◽  
Modular Multiplication

scholarly journals A COMPARATIVE ANALYSIS OF ECDSA V/S RSA ALGORITHM

2014 ◽  
pp. 7-9
Author(s):  
AMANPREET KAUR ◽  
VIKAS GOYAL
Keyword(s):  
Elliptic Curve ◽  
Finite Fields ◽  
Elliptic Curve Cryptography ◽  
Public Key Cryptography ◽  
Cryptographic Primitives ◽  
Prime Field ◽  
Rsa Algorithm ◽  
Encryption And Decryption ◽  
Security Problem ◽  
Accurate Observation

Elliptic curve Cryptography with its various protocols implemented in terms of accuracy and fast observation of results for better security solution. ECC applied on two finite fields: prime field and binary field. Because it is public key cryptography so, it also focus on generation of elliptic curve and shows why finite fields are introduced. But for accurate observation we do analysis on category of cryptographic primitives used to solve given security problem. RSA & ECDSA both have basic criteria of production of keys and method of encryption and decryption in basic application as per security and other properties which are authentication, non-repudiation, privacy, integrity.

Sign in / Sign up

Export Citation Format

Share Document