Quantum computation of discrete logarithms in semigroups

@article{Childs2014QuantumCO,
  title={Quantum computation of discrete logarithms in semigroups},
  author={Andrew M. Childs and G. Ivanyos},
  journal={Journal of Mathematical Cryptology},
  year={2014},
  volume={8},
  pages={405 - 416}
}
  • Andrew M. Childs, G. Ivanyos
  • Published 2014
  • Computer Science, Mathematics, Physics
  • Journal of Mathematical Cryptology
  • Abstract We describe an efficient quantum algorithm for computing discrete logarithms in semigroups using Shor's algorithms for period finding and the discrete logarithm problem as subroutines. Thus proposed cryptosystems based on the presumed hardness of discrete logarithms in semigroups are insecure against quantum attacks. In contrast, we show that some generalizations of the discrete logarithm problem are hard in semigroups despite being easy in groups. We relate a shifted version of the… CONTINUE READING
    16 Citations

    Figures and Topics from this paper.

    Monoidal Encryption over (\mathbb F_2, \cdot ) ( F 2 , · )
    A reduction of Semigroup DLP to classic DLP
    • 7
    • PDF
    Cryptanalysis of Ring Homomorphic Encryption Schemes
    Normalizer Circuits and Quantum Computation
    • 2
    • PDF
    Survey on SAP and its application in public-key cryptography
    The Hidden Subgroup Problem and Post-quantum Group-based Cryptography
    • Kelsey Horan, Delaram Kahrobaei
    • Computer Science, Mathematics
    • ICMS
    • 2018
    • 3
    • PDF
    The Need for Quantum-Resistant Cryptography in Classical Computers
    • M. Farik, S. Ali
    • Computer Science
    • 2016 3rd Asia-Pacific World Congress on Computer Science and Engineering (APWC on CSE)
    • 2016
    • 1

    References

    SHOWING 1-10 OF 29 REFERENCES
    A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
    • 236
    • PDF
    Quantum algorithm for discrete logarithm problem for matrices over finite group rings
    • 13
    • PDF
    Public key cryptography based on semigroup actions
    • 60
    • Highly Influential
    • PDF
    Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
    • P. Shor
    • Mathematics, Computer Science
    • SIAM Rev.
    • 1999
    • 6,395
    • Highly Influential
    • PDF
    Hidden Translation and Translating Coset in Quantum Computing
    • 15
    • PDF
    The Hidden Subgroup Problem and Eigenvalue Estimation on a Quantum Computer
    • 168
    • PDF
    On Quantum Algorithms for Noncommutative Hidden Subgroups
    • 83
    Quantum lower bounds by quantum arguments
    • 372
    • PDF
    A reduction of Semigroup DLP to classic DLP
    • 7
    • PDF