Hull attacks on the lattice isomorphism problem

DOI10.1007/978-3-031-31368-4_7zbMath1527.94033OpenAlexW4367663748MaRDI QIDQ6091133

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

cryptanalysisgraph isomorphismlattice isomorphismcode equivalencehull

Mathematics Subject Classification ID

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

Related Items (1)

Revisiting security estimation for LWE with hints from a geometric perspective

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Not enough less: an improved algorithm for solving code equivalence problems over \(\mathbb{F}_q\)
• Computing isometries of lattices
• On the lattice isomorphism problem, quadratic forms, remarkable lattices, and cryptography
• Sampling a Uniform Solution of a Quadratic Equation Modulo a Prime Power
• Constructing integral lattices with prescribed minimum. I
• Computing automorphism groups of error-correcting codes
• Finding the permutation between equivalent linear codes: the support splitting algorithm
• New directions in nearest neighbor searching with applications to lattice sieving
• Lattices Applied to Coding for Reliable and Secure Communications
• The Hardness of Code Equivalence over $\mathbb{F}_q$ and Its Application to Code-Based Cryptography
• Graph isomorphism in quasipolynomial time [extended abstract]
• On the Lattice Isomorphism Problem
• A canonical form for positive definite matrices
• \textsc{Hawk}: module LIP makes lattice signatures fast, compact and simple

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