Results 21 to 30 of about 3,524 (301)
On Search Complexity of Discrete Logarithm
CoRR, 2021 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 ...
Pavel Hubácek, Jan Václavek
openaire +4 more sources
Algorithms For Discrete Logarithms [PDF]
, 2022 Due to the intractability of the Discrete Logarithm Problem (DLP), it has been widely used in the field of cryptography and the security of several cryptosystems is based on the hardness of computation of DLP.
Barua, Saumik
core
How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits [PDF]
Quantum, 2021 We significantly reduce the cost of factoring integers and computing discrete logarithms in finite fields on a quantum computer by combining techniques from Shor 1994, Griffiths-Niu 1996, Zalka 2006, Fowler 2012, Ekerå-Håstad 2017, Ekerå 2017, Ekerå 2018,
Craig Gidney, Martin Ekerå
doaj +1 more source
Discrete logarithmic energy on the sphere [PDF]
Pacific Journal of Mathematics, 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dragnev, P. D. +2 more
openaire +2 more sources
Committing to quantum resistance: a slow defence for Bitcoin against a fast quantum computing attack [PDF]
Royal Society Open Science, 2018 Quantum computers are expected to have a dramatic impact on numerous fields due to their anticipated ability to solve classes of mathematical problems much more efficiently than their classical counterparts. This particularly applies to domains involving
I. Stewart +5 more
doaj +1 more source
Finding discrete logarithm in $F_p^* $
CoRR, 2021 Additional python code file in pdf ...
openaire +2 more sources
Journal of Mathematical Cryptology, 2020 Many public-key cryptosystems and, more generally, cryptographic protocols, use group exponentiations as important primitive operations. To expand the applicability of these solutions to computationally weaker devices, it has been advocated that a ...
Crescenzo Giovanni Di +3 more
doaj +1 more source
Individual discrete logarithm with sublattice reduction
Designs, Codes and Cryptography, 2023 Designs, Codes and Cryptography ...
Al Aswad, Haetham, Pierrot, Cécile
openaire +5 more sources
Discrete Logarithm Based Protocols [PDF]
, 2007 The Exponential Security System (TESS) developed at the European Institute for System Security is the result of an attempt to increase the security in heterogenous computer networks. In this paper we present the cryptographic protocols in the kernel of TESS.
Horster, Patrick, Knobloch, Hans-Joachim
openaire +1 more source
On the k-error linear complexity of cyclotomic sequences
Journal of Mathematical Cryptology, 2007 Exact values and bounds on the k-error linear complexity of p-periodic sequences which are constant on the cyclotomic classes are determined. This family of sequences includes sequences of discrete logarithms, Legendre sequences and Hall's sextic residue
Aly Hassan +2 more
doaj +1 more source