Finding short integer solutions when the modulus is small
From MaRDI portal
Publication:6145944
DOI10.1007/978-3-031-38548-3_6OpenAlexW4385654714MaRDI QIDQ6145944
Thomas Espitau, Léo Ducas, Eamonn W. Postlethwaite
Publication date: 2 February 2024
Published in: Advances in Cryptology – CRYPTO 2023 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-38548-3_6
Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Authentication, digital signatures and secret sharing (94A62)
Cites Work
- Unnamed Item
- Unnamed Item
- On Lovász' lattice reduction and the nearest lattice point problem
- Factoring polynomials with rational coefficients
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems
- Shortest vector from lattice sieving: a few dimensions for free
- \textsc{Mitaka}: a simpler, parallelizable, maskable variant of \textsc{Falcon}
- The general sieve kernel and new records in lattice reduction
- Improved Progressive BKZ Algorithms and Their Precise Cost Estimation by Sharp Simulator
- Sieve algorithms for the shortest vector problem are practical
- A Hybrid Lattice-Reduction and Meet-in-the-Middle Attack Against NTRU
- Problems and Solutions
- New directions in nearest neighbor searching with applications to lattice sieving
- Lattice Attacks on NTRU and LWE: A History of Refinements
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
- Random Sampling Revisited: Lattice Enumeration with Discrete Pruning
- NTRU Fatigue: How Stretched is Overstretched?
- Shorter hash-and-sign lattice-based signatures
- On rejection sampling in Lyubashevsky's signature scheme
- \textsc{Hawk}: module LIP makes lattice signatures fast, compact and simple
This page was built for publication: Finding short integer solutions when the modulus is small
