Hull attacks on the lattice isomorphism problem

DOI10.1007/978-3-031-31368-4_7MaRDI QIDQ6091133zbMATH OpenOpenAlexFDO

Authors Léo Ducas, Shane Gibbons

Publication date 24 November 2023

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://ir.cwi.nl/pub/33194

zbMATH Keywords

code equivalencecryptanalysisgraph isomorphismhulllattice isomorphism

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Cryptography (94A60)

Recommendations

• On the lattice isomorphism problem, quadratic forms, remarkable lattices, and cryptography
• On the lattice isomorphism problem
• Provable lattice reduction of $$\mathbb {Z}^n$$ with blocksize n/2
• Cryptanalysis of rank-2 module-LIP in totally real number fields

Cites work

• \textsc{Hawk}: module LIP makes lattice signatures fast, compact and simple
• A canonical form for positive definite matrices
• Computational geometry of positive definite quadratic forms. Polyhedral reduction theories, algorithms, and applications
• Computing automorphism groups of error-correcting codes
• Computing isometries of lattices
• Constructing integral lattices with prescribed minimum. I
• Finding the permutation between equivalent linear codes: the support splitting algorithm
• Graph isomorphism in quasipolynomial time (extended abstract)
• scientific article; zbMATH DE number 3613145 (Why is no real title available?)
• scientific article; zbMATH DE number 2063209 (Why is no real title available?)
• scientific article; zbMATH DE number 3329115 (Why is no real title available?)
• Lattices applied to coding for reliable and secure communications
• New directions in nearest neighbor searching with applications to lattice sieving
• Not enough less: an improved algorithm for solving code equivalence problems over \(\mathbb{F}_q\)
• On the lattice isomorphism problem
• On the lattice isomorphism problem, quadratic forms, remarkable lattices, and cryptography
• Sampling a Uniform Solution of a Quadratic Equation Modulo a Prime Power
• The hardness of code equivalence over F_q and its application to code-based cryptography

Cited in

(12)

• Revisiting security estimation for LWE with hints from a geometric perspective
• Exploiting the symmetry of \(\mathbb{Z}^n\): randomization and the automorphism problem
• Cryptanalysis of rank-2 module-LIP in totally real number fields
• Hollow LWE: a new spin. Unbounded updatable encryption from LWE and PCE
• Cryptanalysis of rank-2 module-LIP: a single real embedding is all it takes
• Re-randomize and extract: a novel commitment construction framework based on group actions
• Rank-2 module-LIP with special matrices
• Dense and smooth lattices in any genus
• Cryptanalysis of rank-2 module-LIP with symplectic automorphisms
• On the spinor genus and the distinguishing lattice isomorphism problem
• Relating code equivalence to other isomorphism problems
• Dimension-reducing algorithms for quaternion ideal-SVP

This page was built for publication: Hull attacks on the lattice isomorphism problem

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