Implementation of ElGamal Elliptic Curve Cryptography over prime field using C

2014 ◽  
Author(s):  
Debabrat Boruah ◽  
Monjul Saikia
Keyword(s):  
Elliptic Curve ◽  
Elliptic Curve Cryptography ◽  
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.

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.

scholarly journals Analysis of the Fault Attack ECDLP over Prime Field

2011 ◽  
Vol 2011 ◽  
pp. 1-11 ◽  
Author(s):  
Mingqiang Wang ◽  
Tao Zhan
Keyword(s):  
Elliptic Curve ◽  
Elliptic Curve Cryptography ◽  
Discrete Logarithm ◽  
Base Point ◽  
Prime Field ◽  
Smooth Numbers ◽  
Fault Attack ◽  
Subexponential Time

In 2000, Biehl et al. proposed a fault-based attack on elliptic curve cryptography. In this paper, we refined the fault attack method. An elliptic curveEis defined over prime field𝔽pwith base pointP∈E(𝔽p). Applying the fault attack on these curves, the discrete logarithm on the curve can be computed in subexponential time ofLp(1/2,1+o(1)). The runtime bound relies on heuristics conjecture about smooth numbers similar to the ones used by Lenstra, 1987.

scholarly journals Twisted Edwards Elliptic Curves for Zero-Knowledge Circuits

Mathematics ◽  
2021 ◽  
Vol 9 (23) ◽  
pp. 3022
Author(s):  
Marta Bellés-Muñoz ◽  
Barry Whitehat ◽  
Jordi Baylina ◽  
Vanesa Daza ◽  
Jose Luis Muñoz-Tapia
Keyword(s):  
Elliptic Curve ◽  
Elliptic Curves ◽  
Elliptic Curve Cryptography ◽  
Public Key Cryptography ◽  
Deterministic Algorithm ◽  
Public Key ◽  
Security Attacks ◽  
Zero Knowledge ◽  
Prime Field ◽  
Encryption Schemes

Circuit-based zero-knowledge proofs have arose as a solution to the implementation of privacy in blockchain applications, and to current scalability problems that blockchains suffer from. The most efficient circuit-based zero-knowledge proofs use a pairing-friendly elliptic curve to generate and validate proofs. In particular, the circuits are built connecting wires that carry elements from a large prime field, whose order is determined by the number of elements of the pairing-friendly elliptic curve. In this context, it is important to generate an inner curve using this field, because it allows to create circuits that can verify public-key cryptography primitives, such as digital signatures and encryption schemes. To this purpose, in this article, we present a deterministic algorithm for generating twisted Edwards elliptic curves defined over a given prime field. We also provide an algorithm for checking the resilience of this type of curve against most common security attacks. Additionally, we use our algorithms to generate Baby Jubjub, a curve that can be used to implement elliptic-curve cryptography in circuits that can be validated in the Ethereum blockchain.

Sign in / Sign up

Export Citation Format

Share Document