Fast Slicer for Batch-CVP: Making Lattice Hybrid Attacks Practical

No abstract is available for this paper.

• Publication year

  2025

• Venue

  IACR Cryptology ePrint Archive

• Publication date

  Unknown publication date

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/978-981-95-5099-9_4
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Solve Approximate CVP via Variants of Nearest-Colattice

  2025cited by this paper
• Heuristic Algorithm for Solving Restricted SVP and Its Applications

  2025cited by this paper
• Wagner's Algorithm Provably Runs in Subexponential Time for SIS∞

  2025cited by this paper
• Sieving with Streaming Memory Access

  2025cited by this paper
• Further improvements of the estimation of key enumeration with applications to solving LWE

  2024cited by this paper
• The Complexity of Algebraic Algorithms for LWE

  2024cited by this paper
• Revisiting Security Estimation for LWE with Hints from a Geometric Perspective

  2023cited by this paper
• An Improved BKW Algorithm for Solving LWE with Small Secrets

  2023cited by this paper
• Asymptotics of hybrid primal lattice attacks

  2023influential reference
• Provable Dual Attacks on Learning with Errors

  2023cited by this paper
• Too Many Hints - When LLL Breaks LWE

  2023cited by this paper
• Faster Dual Lattice Attacks by Using Coding Theory

  2022cited by this paper
• Multi-ciphertext security degradation for lattices

  2022cited by this paper
• How to Meet Ternary LWE Keys

  2021cited by this paper
• Boosting the Hybrid Attack on NTRU: Torus LSH, Permuted

  2021cited by this paper
• Advanced Lattice Sieving on GPUs, with Tensor Cores

  2021influential reference
• LWE with Side Information: Attacks and Concrete Security Estimation

  2020cited by this paper
• The randomized slicer for CVPP: sharper, faster, smaller, batchier

  2020influential reference
• Finding Closest Lattice Vectors Using Approximate Voronoi Cells

  2019influential reference
• A detailed analysis of the hybrid lattice-reduction and meet-in-the-middle attack

  2019cited by this paper
• Exploring Trade-offs in Batch Bounded Distance Decoding

  2019cited by this paper
• CRYSTALS-Dilithium: A Lattice-Based Digital Signature Scheme

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

  2018cited by this paper
• CRYSTALS - Kyber: A CCA-Secure Module-Lattice-Based KEM

  2017cited by this paper
• Coded-BKW with Sieving

  2017cited by this paper
• Revisiting the Expected Cost of Solving uSVP and Applications to LWE

  2017cited by this paper
• Lattice-based cryptography

  2017cited by this paper
• Sieving for Closest Lattice Vectors (with Preprocessing)

  2016cited by this paper
• New directions in nearest neighbor searching with applications to lattice sieving

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

  2016cited by this paper
• Improved Reduction from the Bounded Distance Decoding Problem to the Unique Shortest Vector Problem in Lattices

  2016cited by this paper
• Algebraic Algorithms for LWE

  2015cited by this paper
• Faster exponential time algorithms for the shortest vector problem

  2010cited by this paper
• On lattices, learning with errors, random linear codes, and cryptography

  2009influential reference
• Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems

  2009cited by this paper
• Sieve algorithms for the shortest vector problem are practical

  2008cited by this paper
• Finding the Closest Lattice Point by Iterative Slicing

  2007cited by this paper
• Lattice Reduction by Random Sampling and Birthday Methods

  2003cited by this paper
• Similarity estimation techniques from rounding algorithms

  2002cited by this paper
• Dimension Reduction Methods for Convolution Modular Lattices

  2001cited by this paper
• A sieve algorithm for the shortest lattice vector problem

  2001cited by this paper
• Noise-tolerant learning, the parity problem, and the statistical query model

  2000cited by this paper
• NTRU: A Ring-Based Public Key Cryptosystem

  1998cited by this paper
• Lattice Attacks on NTRU

  1997cited by this paper
• Generating hard instances of lattice problems (extended abstract)

  1996cited by this paper
• A Hierarchy of Polynomial Time Lattice Basis Reduction Algorithms

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

  1986influential reference
• Improved algorithms for integer programming and related lattice problems

  1983cited by this paper
• Entropy Suffices for Guessing Most Keys

  year unknowninfluential reference

• Super-Quadratic Quantum Speed-ups and Guessing Many Likely Keys

  2025cites this paper
• Cool + Cruel = Dual, and New Benchmarks for Sparse LWE

  year unknowncites this paper