Results 21 to 30 of about 2,244,879 (350)
Fault attacks have been proved for efficiently breaking hardware‐based elliptic curve cryptosystems. One way for fighting against fault attacks is to design the core multiplier circuit of elliptic curve cryptosystem with concurrent error detection ...
Che Wun Chiou+6 more
doaj +1 more source
The positive integral points on the elliptic curve 𝒚𝟐=𝟕𝒑𝒙(𝒙𝟐+𝟖) [PDF]
The integral point of elliptic curve is a very important problem in both elementary number theory and analytic number theory. In recent years, scholars have paid great attention to solving the problem of positive integer points on elliptic curve 𝑦2 = 𝑘 ...
Xiancun Du, Zhao Jianhong, Yang Lixing
doaj +1 more source
Application of mathematical optimization in elliptic curve arithmetic
Currently, a lot of standardized elliptic curve cryptographic algorithms are widely used. Due to the constantly increasing execution speed demands, implementation optimization problem become actual.
Alexander Igorevich Skripko+1 more
doaj +1 more source
Compact elliptic curve representations
Let y2 = x3 + ax + b be an elliptic curve over 𝔽p, p being a prime number greater than 3, and consider a, b ∈ [1, p]. In this paper, we study elliptic curve isomorphisms, with a view towards reduction in the size of elliptic curves coefficients. We first
Ciet Mathieu+2 more
doaj +1 more source
An Image Encryption Method Based on Elliptic Curve Elgamal Encryption and Chaotic Systems
Due to the potential security problem about key management and distribution for the symmetric image encryption schemes, a novel asymmetric image encryption method is proposed in this paper, which is based on the elliptic curve ElGamal (EC-ElGamal ...
Yuling Luo+3 more
semanticscholar +1 more source
Torsion points with multiplicatively dependent coordinates on elliptic curves
In this paper, we study the finiteness problem of torsion points on an elliptic curve whose coordinates satisfy some multiplicative dependence relations.
Barroero, Fabrizio, Sha, Min
core +1 more source
Efficient Unified Arithmetic for Hardware Cryptography [PDF]
The basic arithmetic operations (i.e. addition, multiplication, and inversion) in finite fields, GF(q), where q = pk and p is a prime integer, have several applications in cryptography, such as RSA algorithm, Diffie-Hellman key exchange algorithm [1 ...
Koc, Cetin Kaya+3 more
core +2 more sources
Fast and simple constant-time hashing to the BLS12-381 elliptic curve
Pairing-friendly elliptic curves in the Barreto-Lynn-Scott family are seeing a resurgence in popularity because of the recent result of Kim and Barbulescu that improves attacks against other pairing-friendly curve families.
R. Wahby, D. Boneh
semanticscholar +1 more source
On the de Rham and p-adic realizations of the Elliptic Polylogarithm for CM elliptic curves [PDF]
In this paper, we give an explicit description of the de Rham and p-adic polylogarithms for elliptic curves using the Kronecker theta function. We prove in particular that when the elliptic curve has complex multiplication and good reduction at p, then ...
Bannai, Kenichi+2 more
core +2 more sources
Nonlinearities in Elliptic Curve Authentication
In order to construct the border solutions for nonsupersingular elliptic curve equations, some common used models need to be adapted from linear treated cases for use in particular nonlinear cases.
Ramzi Alsaedi+2 more
doaj +1 more source