A fusion algorithm for solving the hidden shift problem in finite abelian groups
type: Item
instance of: scholarly article
title: A fusion algorithm for solving the hidden shift problem in finite abelian groups
zbMATH Open document ID: 1487.81064
DOI: 10.1007/978-3-030-81293-5_8
author: Wouter Castryck
author: Ann Dooms
author: Carlo Emerencia
author: Alexander Lemmens
publication date: 2022-03-22T00:00:00Z
Mathematics Subject Classification ID: 81P94
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 81R05
Mathematics Subject Classification ID: 62M05
zbMATH DE Number: 7495911
zbMATH Keywords: hidden shift
zbMATH Keywords: collimation sieve
zbMATH Keywords: hard homogeneous space
describes a project that uses: Lilliput
MaRDI profile type: Publication
full work available at URL: 978-3-030-81293-5 8
OpenAlex ID: W3146373281
cites work: Extended Generalized Feistel Networks Using Matrix Representation to Propose a New Lightweight Block Cipher: Lilliput
cites work: Hidden shift quantum cryptanalysis and implications
cites work: Quantum security analysis of CSIDH
cites work: CSIDH: an efficient post-quantum commutative group action
cites work: Breaking the decisional Diffie-Hellman problem for class group actions using genus theory
cites work: Constructing elliptic curve isogenies in quantum subexponential time
cites work: Q3222942
cites work: The 4-class ranks of quadratic fields
cites work: Quantum Algorithms for Some Hidden Shift Problems
cites work: Hidden Translation and Translating Coset in Quantum Computing
cites work: A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
cites work: Another Subexponential-time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
cites work: The Diffie-Hellman protocol
cites work: He gives C-sieves on the CSIDH
cites work: An improved algorithm for computing logarithms over&lt;tex&gt;GF(p)&lt;/tex&gt;and its cryptographic significance (Corresp.)
cites work: Quantum Computation and Lattice Problems
cites work: Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
cites work: On the Power of Quantum Computation
cites work: Pre- and post-quantum Diffie-Hellman from groups, actions, and isogenies
cites work: Constructing public-key cryptographic schemes based on class group action on a set of isogenous elliptic curves
description: scientific article; zbMATH DE number 7495911