Results 21 to 30 of about 134,362 (311)
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
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
On tea, donuts and non-commutative geometry [PDF]
As many will agree, it feels good to complement a cup of tea by a donut or two. This sweet relationship is also a guiding principle of non-commutative geometry known as Serre Theorem.
Igor V. Nikolaev
doaj
Multi-Functional Resource-Constrained Elliptic Curve Cryptographic Processor
With the rising data evolution, the demand for secured communications over networks is rising immensely. Elliptic Curve Cryptography (ECC) provides an attractive solution to fulfill the requirements of modern network applications.
Binh Kieu Do-Nguyen+4 more
doaj +1 more source
A Novel Scheme of Image Encryption Based on Elliptic Curves Isomorphism and Substitution Boxes
In this manuscript, we propose an image encryption technique by using isomorphic elliptic curves which are proved to be effective against side-channel attacks and have efficient key size as compared to other public-key structures.
Ijaz Khalid+4 more
doaj +1 more source
On the Discrete Logarithm Problem for elliptic curves over local fields [PDF]
The Discrete Logarithm Problem (DLP) for elliptic curves has been extensively studied since, for instance, it is the core of the security of cryptosystems like Elliptic Curve Cryptography (ECC). In this paper, we present an attack to the DLP for elliptic curves based on its connection to the problem of lifting, by using the exponential map for elliptic
arxiv
Maps from K-trivial varieties and connectedness problems [PDF]
In this paper we study varieties covered by rational or elliptic curves. First, we show that images of Calabi-Yau or irreducible symplectic varieties under rational maps are almost always rationally connected. Second, we investigate elliptically connected and elliptically chain connected varieties, and varieties swept out by a family of elliptic curves.
arxiv +1 more source
Elliptic Curve Cryptosystems [PDF]
We discuss analogs based on elliptic curves over finite fields of public key cryptosystems which use the multiplicative group of a finite field. These elliptic curve cryptosystems may be more secure, because the analog of the discrete logarithm problem on elliptic curves is likely to be harder than the classical discrete logarithm problem, especially ...
openaire +2 more sources
Methods for using elliptic curves in cryptography [PDF]
Elliptic Curve Cryptography (ECC), a significant modern cryptography, is more secure and robust than most others due to its construction using an elliptic curve and the application of mathematical operations for encryption and key generation. Furthermore,
Obukhov Vadim+4 more
doaj +1 more source