1 citations · 1 across the 1 of their papers we have counts for
1 paper
Kaito Kishi, Junpei Yamaguchi, Tetsuya Izu +1
The discrete logarithm problem (DLP) over finite fields, commonly used in classical cryptography, has no known polynomial-time algorithm on classical computers. However, Shor has p…