Simulation of Shor Algorithm for Discrete Logarithm Problems With Comprehensive Pairs of Modulo <inline-formula><tex-math notation="LaTeX">$p$</tex-math></inline-formula> and Order <inline-formula><tex-math notation="LaTeX">$q$</tex-math></inline-formula>

Simulation of Shor Algorithm for Discrete Logarithm Problems With Comprehensive Pairs of Modulo <inline-formula><tex-math notation="LaTeX">$p$</tex-math></inline-formula> and Order <inline-formula><tex-math notation="LaTeX">$q$</tex-math></inline-formula>

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 provided its polynomial-time algorithm on quantum computers. Nevertheless, there are only few examples simulating quantum...

Full description

Saved in:
Bibliographic Details
Main Authors: Kaito Kishi, Junpei Yamaguchi, Tetsuya Izu, Noboru Kunihiro
Format: Article
Language:English
Published: IEEE 2025-01-01
Series:IEEE Transactions on Quantum Engineering
Subjects:
Cryptography
digital signatures
public key cryptography
quantum circuit
quantum cryptography
quantum simulation
Online Access:https://ieeexplore.ieee.org/document/11087664/
Tags: Add Tag
No Tags, Be the first to tag this record!

Internet

https://ieeexplore.ieee.org/document/11087664/

Similar Items