Quantum algorithms for typical hard problems: a perspective of cryptanalysis
From MaRDI portal
Publication:2677252
Recommendations
Cites work
- A method for obtaining digital signatures and public-key cryptosystems
- A quantum adiabatic evolution algorithm applied to random instances of an NP-complete problem
- A quantum circuit for Shor's factoring algorithm using 2n+2 qubits
- A reduction of semigroup DLP to classic DLP
- A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
- An \(O(m^2)\)-depth quantum algorithm for the elliptic curve discrete logarithm problem over \(\mathrm{GF}(2^m)^\alpha\)
- Another Subexponential-time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
- Decomposing finite Abelian groups
- scientific article; zbMATH DE number 5320229 (Why is no real title available?)
- scientific article; zbMATH DE number 5320241 (Why is no real title available?)
- scientific article; zbMATH DE number 3948147 (Why is no real title available?)
- scientific article; zbMATH DE number 1256737 (Why is no real title available?)
- scientific article; zbMATH DE number 1030974 (Why is no real title available?)
- scientific article; zbMATH DE number 2079375 (Why is no real title available?)
- scientific article; zbMATH DE number 1406124 (Why is no real title available?)
- scientific article; zbMATH DE number 6297720 (Why is no real title available?)
- Learning with errors and extrapolated dihedral cosets
- On lattices, learning with errors, random linear codes, and cryptography
- On lattices, learning with errors, random linear codes, and cryptography
- On quantum algorithms for noncommutative hidden subgroups
- On the Power of Quantum Computation
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Post-quantum signature algorithms based on the hidden discrete logarithm problem
- Quantum algorithm for discrete logarithm problem for matrices over finite group rings
- Quantum Algorithm for the Boolean Hidden Shift Problem
- Quantum algorithms and the Fourier transform
- Quantum Algorithms for Abelian Difference Sets and Applications to Dihedral Hidden Subgroups
- Quantum algorithms for algebraic problems
- Quantum Algorithms for Some Hidden Shift Problems
- Quantum algorithms for weighing matrices and quadratic residues
- Quantum Computation and Lattice Problems
- Quantum computation of discrete logarithms in semigroups
- Quantum Fourier transform in computational basis
- The joy of factoring
- Thompson’s Group and Public Key Cryptography
- Trapdoors for hard lattices and new cryptographic constructions
Cited in
(5)
This page was built for publication: Quantum algorithms for typical hard problems: a perspective of cryptanalysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2677252)