Post-quantum -to-1 trapdoor claw-free functions from extrapolated dihedral cosets
From MaRDI portal
Publication:6550807
Recommendations
- Learning with errors and extrapolated dihedral cosets
- Leveraging the hardness of dihedral coset problem for quantum cryptography
- Candidate trapdoor claw-free functions from group actions with applications to quantum protocols
- Post-quantum insecurity from LWE
- Quantum search-to-decision reduction for the LWE problem
Cites work
- A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
- An efficient key recovery attack on SIDH
- Candidate trapdoor claw-free functions from group actions with applications to quantum protocols
- Hidden translation and orbit coset in quantum computing
- Hidden translation and translating coset in quantum computing
- scientific article; zbMATH DE number 7561499 (Why is no real title available?)
- Learning with errors and extrapolated dihedral cosets
- Non-interactive classical verification of quantum computation
- On lattices, learning with errors, random linear codes, and cryptography
- On learning linear functions from subset and its applications in quantum computing
- On quantum algorithms for noncommutative hidden subgroups
- On the Power of Quantum Computation
- Optimal measurements for the dihedral hidden subgroup problem
- Quantum algorithms for algebraic problems
- Quantum algorithms for variants of average-case lattice problems via filtering
- Quantum lightning never strikes the same state twice. Or: quantum money from cryptographic assumptions
- Trapdoors for lattices: simpler, tighter, faster, smaller
Cited in
(1)
This page was built for publication: Post-quantum \(\kappa\)-to-1 trapdoor claw-free functions from extrapolated dihedral cosets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6550807)
