Hawk: Module LIP makes Lattice Signatures Fast, Compact and Simple

No abstract is available for this paper.

• Publication year

  2022

• Venue

  IACR Cryptology ePrint Archive

• Publication date

  Unknown publication date

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1007/978-3-031-22972-5_3
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• A Complete Analysis of the BKZ Lattice Reduction Algorithm

  2024cited by this paper
• Shorter Hash-and-Sign Lattice-Based Signatures

  2022cited by this paper
• Round-Optimal Lattice-Based Threshold Signatures, Revisited

  2022cited by this paper
• Practical, Round-Optimal Lattice-Based Blind Signatures

  2022cited by this paper
• Lattice Attacks on NTRU and LWE: A History of Refinements

  2021cited by this paper
• On the Lattice Isomorphism Problem, Quadratic Forms, Remarkable Lattices, and Cryptography

  2021influential reference
• Mitaka: a simpler, parallelizable, maskable variant of Falcon

  2021influential reference
• Just how hard are rotations of Z n ? Algorithms and cryptography with the simplest lattice

  2021cited by this paper
• On the Success Probability of Solving Unique SVP via BKZ

  2020cited by this paper
• LWE with Side Information: Attacks and Concrete Security Estimation

  2020influential reference
• The General Sieve Kernel and New Records in Lattice Reduction

  2019cited by this paper
• More Efficient Algorithms for the NTRU Key Generation using the Field Norm

  2019influential reference
• Faster Gaussian Sampling for Trapdoor Lattices with Arbitrary Modulus

  2018cited by this paper
• Measuring, simulating and exploiting the head concavity phenomenon in BKZ

  2018cited by this paper
• Shortest Vector from Lattice Sieving: a Few Dimensions for Free

  2018cited by this paper
• A Subfield Lattice Attack on Overstretched NTRU Assumptions - Cryptanalysis of Some FHE and Graded Encoding Schemes

  2016cited by this paper
• Fast Fourier Orthogonalization

  2016cited by this paper
• Practical, Predictable Lattice Basis Reduction

  2016cited by this paper
• Post-quantum Key Exchange - A New Hope

  2016cited by this paper
• Algorithms on Ideal over Complex Multiplication order

  2016cited by this paper
• Gaussian Sampling in Lattice-Based Cryptography

  2015cited by this paper
• The use of asymmetric numeral systems as an accurate replacement for Huffman coding

  2015cited by this paper
• Lattices with Symmetry

  2014cited by this paper
• ON THE MERTENS–CESÀRO THEOREM FOR NUMBER FIELDS

  2014cited by this paper
• Classical hardness of learning with errors

  2013cited by this paper
• Lattice Signatures and Bimodal Gaussians

  2013cited by this paper
• Learning a Zonotope and More: Cryptanalysis of NTRUSign Countermeasures

  2012cited by this paper
• Faster Gaussian Lattice Sampling Using Lazy Floating-Point Arithmetic

  2012cited by this paper
• BKZ 2.0: Better Lattice Security Estimates

  2011cited by this paper
• An Efficient and Parallel Gaussian Sampler for Lattices

  2010cited by this paper
• On Ideal Lattices and Learning with Errors over Rings

  2010cited by this paper
• Trapdoors for hard lattices and new cryptographic constructions

  2008influential reference
• Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures

  2006cited by this paper
• AN INTRODUCTION TO ALGEBRAIC K-THEORY

  2005cited by this paper
• Worst-case to average-case reductions based on Gaussian measures

  2004cited by this paper
• Hypercubic Lattice Reduction and Analysis of GGH and NTRU Signatures

  2003cited by this paper
• NTRUSIGN: Digital Signatures Using the NTRU Lattice

  2003cited by this paper
• Cryptanalysis of the Revised NTRU Signature Scheme

  2002cited by this paper
• ADAPTIVE ESTIMATION OF A QUADRATIC FUNCTIONAL BY MODEL SELECTION

  2001cited by this paper
• Concentration of Measure for the Analysis of Randomized Algorithms

  1998cited by this paper
• Inequalities for convex bodies and polar reciprocal lattices inRn

  1995cited by this paper
• New bounds in some transference theorems in the geometry of numbers

  1993cited by this paper
• On Lovász’ lattice reduction and the nearest lattice point problem

  1986cited by this paper
• Modular multiplication without trial division

  1985cited by this paper
• Introduction to Algebraic K-Theory. (AM-72), Volume 72

  1972cited by this paper
• Run-length encodings (Corresp.)

  1966cited by this paper

• Asymptotic Improvements to Provable Algorithms for the Code Equivalence Problem

  2026cites this paper
• New bounds of the smoothing parameter for lattices

  2025cites this paper
• Diagonally dominant matrices for cryptography

  2025cites this paper
• poqeth: Efficient, post-quantum signature verification on Ethereum

  2025cites this paper
• Post-Quantum Online/Offline Signatures

  2025cites this paper
• Asymptotic Improvements to Provable Algorithms for the Code Equivalence Problem

  2025cites this paper
• Cryptanalysis of rank-2 module-LIP: a single real embedding is all it takes

  2025cites this paper
• Re-Randomize and Extract: A Novel Commitment Construction Framework Based on Group Actions

  2025cites this paper
• Commitment Schemes Based on Module-LIP

  2025influential citation
• Don't Use It Twice: Reloaded! On the Lattice Isomorphism Group Action

  2025cites this paper
• Enabling Quantum-Resistant EDHOC: Design and Performance Evaluation

  2025cites this paper
• Area Efficient Polynomial Arithmetic Accelerator for Post-quantum Digital Signatures and KEMs

  2025cites this paper
• Ideally HAWKward: How Not to Break Module-LIP

  2025cites this paper
• An algebraic key-exposure attack on the digital signature HAWK

  2025influential citation
• HAWK: Having Automorphisms Weakens Key

  2025cites this paper
• Special Genera of Hermitian Lattices and Applications to HAWK

  2025cites this paper
• Fully-Homomorphic Encryption from Lattice Isomorphism

  2025cites this paper
• Predicting Module-Lattice Reduction

  2025influential citation
• Diffie-Hellman Key Exchange from Commutativity to Group Laws

  2025cites this paper
• To Extend or Not to Extend: Agile Masking Instructions for PQC

  2025cites this paper
• On Lattice Isomorphism Problems for Lattices from LCD Codes over Finite Rings

  2025cites this paper
• High-Radix/Mixed-Radix NTT Multiplication Algorithm/Architecture Co-Design Over Fermat Modulus

  2025cites this paper
• Avengers assemble! Supervised learning meets lattice reduction A single power trace attack against CRYSTALS-Kyber Key Generation

  2025cites this paper
• NTRU with Hints: Recovering NTRU Secret Keys from Partial Leakage

  2025cites this paper
• Beyond LWE: a Lattice Framework for Homomorphic Encryption

  2025cites this paper
• A search to distinguish reduction for the isomorphism problem on direct sum lattices

  2025cites this paper
• Improved (Again) Key Pair Generation for Falcon, BAT and Hawk

  2025cites this paper
• Exploiting the Symmetry of Zn\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbb {Z}^n$$\end{document}: Randomizat

  2025influential citation
• Cryptanalysis of a Post-Quantum Signature Scheme Based on Number-Theoretic Assumptions

  2025cites this paper
• GPV Preimage Sampling with Weak Smoothness and Its Applications to Lattice Signatures

  2025cites this paper
• Dense and smooth lattices in any genus

  2024influential citation
• Monomial isomorphism for tensors and applications to code equivalence problems

  2024cites this paper
• A Concrete LIP-Based KEM With Simple Lattices

  2024cites this paper
• Properties of Lattice Isomorphism as a Cryptographic Group Action

  2024cites this paper
• FuLeakage: Breaking FuLeeca by Learning Attacks

  2024cites this paper
• Algorithms for Matrix Code and Alternating Trilinear Form Equivalences via New Isomorphism Invariants

  2024cites this paper
• Cryptanalysis of rank-2 module-LIP in Totally Real Number Fields

  2024influential citation
• Hash Your Keys Before Signing - BUFF Security of the Additional NIST PQC Signatures

  2024cites this paper
• Improved Provable Reduction of NTRU and Hypercubic Lattices

  2024influential citation
• DVA: Dangerous Variations of ALTEQ

  2024cites this paper
• Relating code equivalence to other isomorphism problems

  2024influential citation
• Physical-Layer Public Key Encryption Through Massive MIMO

  2024cites this paper
• A reduction from Hawk to the principal ideal problem in a quaternion algebra

  2024cites this paper
• Cryptanalysis of Rank-2 Module-LIP with Symplectic Automorphisms

  2024influential citation
• An Improved Algorithm for Code Equivalence

  2024cites this paper
• A Not So Discrete Sampler: Power Analysis Attacks on HAWK signature scheme

  2024cites this paper
• On the Spinor Genus and the Distinguishing Lattice Isomorphism Problem

  2024influential citation
• Fast Falcon Signature Generation and Verification Using ARMv8 NEON Instructions

  2023cites this paper
• On the Quantum Security of HAWK

  2023cites this paper
• Kavach: Lightweight masking techniques for polynomial arithmetic in lattice-based cryptography

  2023cites this paper
• Provable lattice reduction of Zn\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbb {Z}^n$$\end{document} with blo

  2023influential citation
• Improved Key Pair Generation for Falcon, BAT and Hawk

  2023cites this paper
• Hull Attacks on the Lattice Isomorphism Problem

  2023influential citation
• On Gaussian sampling, smoothing parameter and application to signatures

  2023cites this paper
• HAWK Specification Document

  2023cites this paper
• Generic Accelerators for Costly-to-Mask PQC Components

  2023cites this paper
• Finding short integer solutions when the modulus is small

  2023cites this paper
• Lattice Isomorphism as a Group Action and Hard Problems on Quadratic Forms

  2023cites this paper
• Just how hard are rotations of Z n ? Algorithms and cryptography with the simplest lattice

  2021cites this paper
• Rank-2 module-LIP with special matrices

  year unknowncites this paper
• Finding isomorphisms between trilinear forms, slightly faster.

  year unknowncites this paper
• Dimension-Reducing Algorithms for Quaternion Ideal-SVP

  year unknowncites this paper
• Public-Key Encryption from the Lattice Isomorphism Problem

  year unknowncites this paper