Simulation of Shor algorithm for discrete logarithm problems with comprehensive pairs of modulo p and order q

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…