A fusion algorithm for solving the hidden shift problem in finite abelian groups

DOI10.1007/978-3-030-81293-5_8MaRDI QIDQ2118532zbMATH OpenOpenAlexFDO

Authors Wouter Castryck, Ann Dooms, Carlo Emerencia, Alexander Lemmens

Publication date 22 March 2022

Full work available at URL https://doi.org/10.1007/978-3-030-81293-5_8

zbMATH Keywords

collimation sievehard homogeneous spacehidden shift

Mathematics Subject Classification ID

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)

Recommendations

• Quantum algorithm for a generalized hidden shift problem
• Another Subexponential-time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
• A hidden shift quantum algorithm
• scientific article
• Quantum algorithms for Simon's problem over nonabelian groups

Cites work

• scientific article; zbMATH DE number 3889661 (Why is no real title available?)
• A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
• An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
• Another Subexponential-time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
• Breaking the decisional Diffie-Hellman problem for class group actions using genus theory
• CSIDH: an efficient post-quantum commutative group action
• Constructing elliptic curve isogenies in quantum subexponential time
• Constructing public-key cryptographic schemes based on class group action on a set of isogenous elliptic curves
• Extended Generalized Feistel Networks Using Matrix Representation to Propose a New Lightweight Block Cipher: <sc>Lilliput</sc>
• He gives C-sieves on the CSIDH
• Hidden shift quantum cryptanalysis and implications
• Hidden translation and translating coset in quantum computing
• On the Power of Quantum Computation
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Pre- and post-quantum Diffie-Hellman from groups, actions, and isogenies
• Quantum Algorithms for Some Hidden Shift Problems
• Quantum Computation and Lattice Problems
• Quantum security analysis of CSIDH
• The 4-class ranks of quadratic fields
• The Diffie-Hellman protocol

Cited in

(4)

• On the decisional Diffie-Hellman problem for class group actions on oriented elliptic curves
• Breaking the decisional Diffie-Hellman problem for class group actions using genus theory: extended version
• CSI-Otter: isogeny-based (partially) blind signatures from the class group action with a twist
• Two remarks on the vectorization problem

Describes a project that uses

Uses Software

• Lilliput

This page was built for publication: A fusion algorithm for solving the hidden shift problem in finite abelian groups

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