Results 11 to 20 of about 3,908 (312)
Time-Memory Analysis of Parallel Collision Search Algorithms
Transactions on Cryptographic Hardware and Embedded Systems, 2021 Parallel versions of collision search algorithms require a significant amount of memory to store a proportion of the points computed by the pseudo-random walks.
Monika Trimoska +2 more
doaj +1 more source
Variational Quantum Algorithm for Solving Discrete Logarithms [PDF]
Jisuanji kexueThe discrete logarithm problem is a significant challenge in number theory,and due to the difficulty of solving it,classical computers lack efficient algorithms for this task.As a result,the discrete logarithm problem is widely used in public key ...
ZHANG Xinglan, RONG Xiaojun
doaj +1 more source
Finding discrete logarithms with a set orbit distinguisher
Journal of Mathematical Cryptology, 2012 We consider finding discrete logarithms in a group of prime order p when the help of an algorithm D that distinguishes certain subsets of from each other is available.
Gallant Robert P.
doaj +1 more source
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
Quantum computation of discrete logarithms in semigroups
Journal of Mathematical Cryptology, 2014 We describe an efficient quantum algorithm for computing discrete logarithms in semigroups using Shor's algorithms for period finding and the discrete logarithm problem as subroutines.
Childs Andrew M., Ivanyos Gábor
doaj +1 more source
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
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
Research Progress and Prospect of Ring Signatures [PDF]
Jisuanji kexue yu tansuo, 2023 As a special group signature, ring signature has been widely used in anonymous voting, anonymous deposit and anonymous transaction because it can not only complete the signature without the cooperation of ring members, but also ensure the anonymity of ...
XIE Jia, LIU Shizhao, WANG Lu, GAO Juntao, WANG Baocang
doaj +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
Computing Small Discrete Logarithms Faster [PDF]
, 2012 Computations of small discrete logarithms are feasible even in "secure" groups, and are used as subroutines in several cryptographic protocols in the literature. For example, the Boneh–Goh–Nissim degree-2-homomorphic public-key encryption system uses generic square-root discrete-logarithm methods for decryption.
Bernstein, D.J., Lange, T.
openaire +2 more sources