11 citations · 14 across the 2 of their papers we have counts for
2 papers
cs.CR2021★ 11 cited
The Present and Future of Discrete Logarithm Problems on Noisy Quantum Computers
Yoshinori Aono, Sitong Liu, Tomoki Tanaka +4
The discrete logarithm problem (DLP) is the basis for several cryptographic primitives. Since Shor's work, it has been known that the DLP can be solved by combining a polynomial-si…
cs.CR2014★ 3 cited
A faster method for computing Gama-Nguyen-Regev's extreme pruning coefficients
Yoshinori Aono
This paper considers Gama-Nguyen-Regev's strategy [GNR10] for optimizing pruning coefficients for lattice vector enumeration. We give a table of optimized coefficients and proposes…