Hull Attacks on the Lattice Isomorphism Problem

• On the construction of Barnes–Wall lattices and their application in cryptography

  2026 Journal of Computer Virology and Hacking Techniques article Computer Science Cryptography and Data Security

  1

  citations
• On Gaussian Sampling for Barnes-Wall Lattices and its Application in Signatures

  2026 International Conference on Computer and Communication Systems (ICCCS) conference-paper Computer Science Cryptography and Data Security

  0

  citations
• Dimension-Reducing Algorithms for Quaternion Ideal-SVP

  2026 Lecture notes in computer science conference-paper Computer Science Cryptography and Data Security

  0

  citations
• Commitment Schemes Based on Module-LIP

  2026 Lecture notes in computer science conference-paper Computer Science Cryptography and Data Security

  0

  citations
• Advanced Cryptography from Lattice Isomorphism—New Constructions of IBE and FHE

  2026 Lecture notes in computer science conference-paper Computer Science Cryptography and Data Security

  0

  citations
• A Survey on Code Equivalence: The State-of-the-Art and Open Questions

  2026 Lecture notes in computer science conference-paper Computer Science Coding theory and cryptography Open access

  0

  citations
• On Lattice Isomorphism Problems for Lattices from LCD Codes over Finite Rings

  2025 IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences article Computer Science Coding theory and cryptography Open access

  1

  citations
• Reductions Between Code Equivalence Problems

  2025 IEEE International Symposium on Information Theory (ISIT) conference-paper Computer Science Complexity and Algorithms in Graphs

  4

  citations
• On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials V: Over Commutative Rings

  2025 ACM Symposium on Theory of Computing (STOC) conference-paper Computer Science Complexity and Algorithms in Graphs

  1

  citations
• Exploiting the Symmetry of $$\mathbb {Z}^n$$: Randomization and the Automorphism Problem

  2025 Journal of Cryptology article Computer Science Cryptography and Data Security

  1

  citations
• Cryptanalysis of Rank-2 Module-LIP: A Single Real Embedding Is All It Takes

  2025 Lecture notes in computer science conference-paper Computer Science Cryptography and Data Security

  9

  citations
• Hollow LWE: A New Spin

  2025 Lecture notes in computer science conference-paper Computer Science Cryptography and Data Security Open access

  6

  citations
• Re-randomize and Extract: A Novel Commitment Construction Framework Based on Group Actions

  2025 Lecture notes in computer science conference-paper Computer Science Cryptography and Data Security

  6

  citations
• Relating code equivalence to other isomorphism problems

  2024 Designs Codes and Cryptography article Computer Science Coding theory and cryptography

  8

  citations
• Cryptanalysis of Rank-2 Module-LIP with Symplectic Automorphisms

  2024 Lecture notes in computer science conference-paper Computer Science Cryptography and Data Security

  11

  citations
• Dense and Smooth Lattices in Any Genus

  2024 Lecture notes in computer science conference-paper Computer Science Cryptography and Data Security

  6

  citations
• On the Spinor Genus and the Distinguishing Lattice Isomorphism Problem

  2024 Lecture notes in computer science conference-paper Computer Science Cryptography and Data Security

  6

  citations
• Cryptanalysis of Rank-2 Module-LIP in Totally Real Number Fields

  2024 Lecture notes in computer science conference-paper Computer Science Cryptography and Data Security Open access

  17

  citations
• Exploiting the Symmetry of $$\mathbb {Z}^n$$: Randomization and the Automorphism Problem

  2023 Lecture notes in computer science conference-paper Computer Science Cryptography and Data Security Open access

  7

  citations
• Revisiting Security Estimation for LWE with Hints from a Geometric Perspective

  2023 Lecture notes in computer science conference-paper Computer Science Cryptography and Data Security

  15

  citations

20 results

• Sphere Packings, Lattices and Groups

  1999 Grundlehren der mathematischen Wissenschaften book Mathematics Advanced Algebra and Geometry

  2,228

  citations
• Introduction to Quadratic Forms

  1963 Springer eBooks book Computer Science Matrix Theory and Algorithms

  458

  citations
• Graph isomorphism in quasipolynomial time [extended abstract]

  2016 ACM Symposium on Theory of Computing (STOC) conference-paper Computer Science Complexity and Algorithms in Graphs

  421

  citations
• New directions in nearest neighbor searching with applications to lattice sieving

  2015 ACM-SIAM Symposium on Discrete Algorithms (SODA) conference-paper Computer Science Advanced Image and Video Retrieval Techniques Open access

  289

  citations
• Finding the permutation between equivalent linear codes: the support splitting algorithm

  2000 IEEE Transactions on Information Theory article Computer Science Coding theory and cryptography

  272

  citations
• Computing automorphism groups of error-correcting codes

  1982 IEEE Transactions on Information Theory article Computer Science Coding theory and cryptography

  172

  citations
• Computing Isometries of Lattices

  1997 Journal of Symbolic Computation article Mathematics Advanced Algebra and Geometry Open access

  111

  citations
• On the Lattice Isomorphism Problem, Quadratic Forms, Remarkable Lattices, and Cryptography

  2022 Lecture notes in computer science conference-paper Computer Science Cryptography and Data Security Open access

  67

  citations
• Hawk: Module LIP Makes Lattice Signatures Fast, Compact and Simple

  2022 Lecture notes in computer science conference-paper Computer Science Cryptography and Data Security Open access

  61

  citations
• The Hardness of Code Equivalence over $\mathbb{F}_q$ and Its Application to Code-Based Cryptography

  2013 Lecture notes in computer science conference-paper Computer Science Coding theory and cryptography

  49

  citations
• On the Lattice Isomorphism Problem

  2013 ACM-SIAM Symposium on Discrete Algorithms (SODA) conference-paper Computer Science Complexity and Algorithms in Graphs

  36

  citations
• Not Enough LESS: An Improved Algorithm for Solving Code Equivalence Problems over $$\mathbb {F}_q$$

  2021 Lecture notes in computer science conference-paper Computer Science Coding theory and cryptography

  33

  citations
• Permutation Code Equivalence is Not Harder Than Graph Isomorphism When Hulls Are Trivial

  2019 IEEE International Symposium on Information Theory (ISIT) conference-paper Computer Science Coding theory and cryptography Open access

  26

  citations
• Efficient bounded distance decoders for Barnes-Wall lattices

  2008 IEEE International Symposium on Information Theory (ISIT) conference-paper Computer Science Coding theory and cryptography

  20

  citations
• Constructing integral lattices with prescribed minimum. I

  1985 Mathematics of Computation article Mathematics Advanced Combinatorial Mathematics Open access

  19

  citations
• A canonical form for positive definite matrices

  2020 Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands conference-paper Computer Science Polynomial and algebraic computation Open access

  13

  citations
• Computing the $p$-adic Canonical Quadratic Form in Polynomial Time

  2014 arXiv (Cornell University) preprint Mathematics Algebraic Geometry and Number Theory Open access

  2

  citations
• Lattices from Codes

  2017 SpringerBriefs in mathematics book-chapter Computer Science Coding theory and cryptography

  1

  citations
• W2976543308

  details pending

  0

  citations
• W6814398301

  details pending

  0

  citations

20 results