Results 1 to 10 of about 12,362 (163)
The review on elliptic curves as cryptographic pairing groups [PDF]
Elliptic curve is a set of two variable points on polynomials of degree 3 over a field acted by an addition operation that forms a group structure. The motivation of this study is the mathematics behind that elliptic curve to the applicability within a ...
E Khamseh
doaj +1 more source
A new method for solving the elliptic curve discrete logarithm problem [PDF]
The elliptic curve discrete logarithm problem is considered a secure cryptographic primitive. The purpose of this paper is to propose a paradigm shift in attacking the elliptic curve discrete logarithm problem.
Ansari Abdullah +2 more
doaj +1 more source
MODIFICATION OF POLLARD RHO ALGORITHM USING NEGATION MAPPING
El Gamal encryption was introduced in 1985 and is still commonly used today. Its hardness is based on a discrete logarithm problem defined over the finite abelian cyclic group group chosen in the original paper was but later it was proven that using the
Sa'aadah Sajjana Carita, Herman Kabetta
doaj +1 more source
Hardware acceleration of number theoretic transform for zk‐SNARK
An FPGA‐based hardware accelerator with a multi‐level pipeline is designed to support the large‐bitwidth and large‐scale NTT tasks in zk‐SNARK. It can be flexibly scaled to different scales of FPGAs and has been equipped in the heterogeneous acceleration system with the help of HLS and OpenCL.
Haixu Zhao +6 more
wiley +1 more source
Comparative Study of Digital Signature Standards Based on Discrete Logarithm [PDF]
As Chinese state encryption administration is seeking the next generation of Digital Signature Standard(DSS),this paper analyzes and compares seven DSS listed in ISO/IEC 14888-3 and SM2 which are based on Discrete Logarithm Problem(DLP) or Elliptic Curve
FENG Zeyu,GONG Boru,ZHAO Yunlei
doaj +1 more source
Evaluation of Computational Approaches of Short Weierstrass Elliptic Curves for Cryptography
The survey presents the evolution of Short Weierstrass elliptic curves after their introduction in cryptography. Subsequently, this evolution resulted in the establishment of present elliptic curve computational standards.
Abhishek Kunal +1 more
doaj +1 more source
Computation of Trusted Short Weierstrass Elliptic Curves for Cryptography
Short Weierstrass elliptic curves with underlying hard Elliptic Curve Discrete Logarithm Problem (ECDLP) are widely used in cryptographic applications. A notion of security called Elliptic Curve Cryptography (ECC) security is also suggested in literature
Abhishek Kunal +1 more
doaj +1 more source
Quasi-subfield Polynomials and the Elliptic Curve Discrete Logarithm Problem
We initiate the study of a new class of polynomials which we call quasi-subfield polynomials. First, we show that this class of polynomials could lead to more efficient attacks for the elliptic curve discrete logarithm problem via the index calculus ...
Huang Ming-Deh +4 more
doaj +1 more source
Radio Frequency Identification Mutual Authentication Protocol Based on Elliptic Curve Cryptography [PDF]
Aiming at wireless communication security problem of Radio Frequency Identification(RFID) the based on Elliptic Curve Cryptography(ECC) algorithm,this paper proposes a RFID mutual authentication protocol.It describes in detail the process of the new ...
LIU Boya,LIU Nianyi,YANG Yatao,LI Zichen
doaj +1 more source
The remote authentication scheme is a cryptographic protocol incorporated by user–server applications to prevent unauthorized access and security attacks.
Fairuz Shohaimay, Eddie Shahril Ismail
doaj +1 more source

