Quantum computational number theory

DOI10.1007/978-3-319-25823-2MaRDI QIDQ2835407zbMATH OpenOpenAlexFDO

Authors Song Yuan Yan

Publication date 2 December 2016

Full work available at URL https://doi.org/10.1007/978-3-319-25823-2

zbMATH Keywords

Church-Turing thesiscomplexity classesCook-Karp thesiscryptographic systemsdecidabilitydiscrete logarithmelliptic curve discrete logarithminteger factorizationkey-exchange-protocolPell equationquantum computingRiemann hypothesisTuring machine

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to number theory (11-02) Computational number theory (11Yxx) Quantum computation (81P68) Cryptography (94A60)

Recommendations

• Computational Number Theory and Modern Cryptography
• Computational number theory
• scientific article; zbMATH DE number 1846035
• Primality testing and integer factorization in public-key cryptography
• Topics in computational number theory inspired by Peter L. Montgomery

Cited in

(10)

• Quantum computation in algebraic number theory: Hallgren's efficient quantum algorithm for solving Pell's equation.
• Photonic scheme of quantum phase estimation for quantum algorithms via quantum dots
• Quantum Gauss-Jordan elimination and simulation of accounting principles on quantum computers
• Discrete quantum computation and Lagrange's four-square theorem
• Commutative encryption method based on hidden logarithm problem
• Numerical Recipes in Quantum Information Theory and Quantum Computing
• scientific article; zbMATH DE number 7259160 (Why is no real title available?)
• scientific article; zbMATH DE number 5049912 (Why is no real title available?)
• Large-Scale Scientific Computing
• Complete solutions of inverse quantum orthogonal equivalence classes

This page was built for publication: Quantum computational number theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2835407)