Results 11 to 20 of about 1,067,462 (345)
A NEW PROPOSED METHOD FOR SOLVING AN ELLIPTIC CURVE DISCRETE LOGARITHM PROBLEM
In this work, we present a new approach for solving Elliptic Curve Discrete Logarithm Problem. This method provides a new access to the field of attacking methods the Elliptic Curve Cryptosystems.
Ammar Ali Neamah
doaj +3 more sources
A Subexponential Quantum Algorithm for the Semidirect Discrete Logarithm Problem [PDF]
Group-based cryptography is a relatively unexplored family in post-quantum cryptography, and the so-called Semidirect Discrete Logarithm Problem (SDLP) is one of its most central problems. However, the complexity of SDLP and its relationship to more well-
Christopher Battarbee+3 more
semanticscholar +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
Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment [PDF]
We report on two new records: the factorization of RSA-240, a 795-bit number, and a discrete logarithm computation over a 795-bit prime field. Previous records were the factorization of RSA-768 in 2009 and a 768-bit discrete logarithm computation in 2016.
Fabrice Boudot+5 more
semanticscholar +1 more source
Discrete logarithm problem in matrix
In this paper the discrete logarithm problem in matrix in finite fields is formulated, possible ways of solution are given.
Povilas Tvarijonas+2 more
doaj +1 more source
On the tropical discrete logarithm problem and security of a protocol based on tropical semidirect product [PDF]
Tropical linear algebra has been recently put forward by Grigoriev and Shpilrain as a promising platform for implementation of protocols of Diffie-Hellman and Stickel type.
Any Muanalifah, S. Sergeev
semanticscholar +1 more source
On Search Complexity of Discrete Logarithm [PDF]
In this work, we study the discrete logarithm problem in the context of TFNP - the complexity class of search problems with a syntactically guaranteed existence of a solution for all instances. Our main results establish that suitable variants of the discrete logarithm problem are complete for the complexity class PPP, respectively PWPP, i.e., the ...
Hubáček, Pavel, Václavek, Jan
openaire +4 more sources
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
Computing discrete logarithm by interval-valued paradigm [PDF]
Interval-valued computing is a relatively new computing paradigm. It uses finitely many interval segments over the unit interval in a computation as data structure.
Benedek Nagy, Sándor Vályi
doaj +1 more source
Discrete logarithms in free groups [PDF]
9 pages, 1 figure, Corrects a mistake in the Introduction and Section ...
Morten S. Risager+2 more
openaire +5 more sources