A fusion algorithm for solving the hidden shift problem in finite abelian groups
From MaRDI portal
Publication:2118532
DOI10.1007/978-3-030-81293-5_8zbMath1487.81064OpenAlexW3146373281MaRDI QIDQ2118532
Carlo Emerencia, Alexander Lemmens, Ann Dooms, Wouter Castryck
Publication date: 22 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-81293-5_8
Markov processes: estimation; hidden Markov models (62M05) Cryptography (94A60) Finite-dimensional groups and algebras motivated by physics and their representations (81R05) Quantum cryptography (quantum-theoretic aspects) (81P94)
Related Items (3)
Breaking the decisional Diffie-Hellman problem for class group actions using genus theory: extended version ⋮ Two remarks on the vectorization problem ⋮ On the decisional Diffie-Hellman problem for class group actions on oriented elliptic curves
Uses Software
Cites Work
- Unnamed Item
- Constructing public-key cryptographic schemes based on class group action on a set of isogenous elliptic curves
- The 4-class ranks of quadratic fields
- Hidden shift quantum cryptanalysis and implications
- CSIDH: an efficient post-quantum commutative group action
- Pre- and post-quantum Diffie-Hellman from groups, actions, and isogenies
- The Diffie-Hellman protocol
- Breaking the decisional Diffie-Hellman problem for class group actions using genus theory
- He gives C-sieves on the CSIDH
- Quantum security analysis of CSIDH
- Another Subexponential-time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
- Extended Generalized Feistel Networks Using Matrix Representation to Propose a New Lightweight Block Cipher: <sc>Lilliput</sc>
- Quantum Algorithms for Some Hidden Shift Problems
- An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- On the Power of Quantum Computation
- Quantum Computation and Lattice Problems
- Constructing elliptic curve isogenies in quantum subexponential time
- Hidden Translation and Translating Coset in Quantum Computing
- A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
This page was built for publication: A fusion algorithm for solving the hidden shift problem in finite abelian groups