What question did this study set out to answer?

This paper investigates polynomial-time algorithms for solving discrete logarithms and factoring on quantum computers.

December 17, 2002

Algorithms for quantum computation: discrete logarithms and factoring

View Full Paper

Ask AI

Bookmark

Authors

PSPeter W. ShorAT&T (United States)

Discussion

Member takes

Implication

Randomized trial reveals polynomial-time algorithms for discrete logarithms and factoring in quantum computation, suggesting implications for cryptography.

Key Points

This paper investigates polynomial-time algorithms for solving discrete logarithms and factoring on quantum computers.
Developed Las Vegas algorithms specific for quantum computation.
Focused on the complexity of discrete logarithms and integer factoring.
Examined the computational properties of quantum mechanical models.
Introduced the first examples of quantum cryptanalysis targeting classical cryptosystems.
Demonstrated that both problems can be solved in polynomial time on a quantum computer.

Cite This Study

Peter W. Shor (2002) studied this question.

synapsesocial.com/papers/696f155bea06cd50cf3010aa https://doi.org/10.1109/sfcs.1994.365700

View Full Paper

Ask AI

Bookmark

Implication

Randomized trial reveals polynomial-time algorithms for discrete logarithms and factoring in quantum computation, suggesting implications for cryptography.

Algorithms for quantum computation: discrete logarithms and factoring

Discussion

Member takes

Implication

Key Points

Cite This Study

Algorithms for quantum computation: discrete logarithms and factoring

Discussion

Member takes

Implication

Key Points

Cite This Study

Also Consider

Also Consider