On the smoothing parameter and last minimum of random orthogonal lattices

DOI10.1007/s10623-020-00719-wzbMath1451.11062OpenAlexW3004360373MaRDI QIDQ2182065

Alexandre Wallet, Huyen Nguyen, Elena Kirshanova, Damien Stehlé

Publication date: 21 May 2020

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-020-00719-w

zbMATH Keywords

lattice-based cryptographysmoothing parameterrandom latticeslast minimumlattices and convex bodies

Mathematics Subject Classification ID

Cryptography (94A60) Lattices and convex bodies (number-theoretic aspects) (11H06)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Limits on the hardness of lattice problems in \(\ell_{p}\) norms
• Factoring polynomials with rational coefficients
• New bounds in some transference theorems in the geometry of numbers
• Hardness of \(k\)-LWE and applications in traitor tracing
• New (and old) proof systems for lattice problems
• Fully Secure Functional Encryption for Inner Products, from Standard Assumptions
• Discrete Gaussian Leftover Hash Lemma over Infinite Domains
• A new view on HJLS and PSLQ
• A Note on Discrete Gaussian Combinations of Lattice Vectors
• Trapdoors for hard lattices and new cryptographic constructions
• Fully Homomorphic Encryption over the Integers
• The number of primes in a short interval.
• Extended GCD and Hermite Normal Form Algorithms via Lattice Basis Reduction
• Candidate Multilinear Maps from Ideal Lattices
• Pseudorandomness of ring-LWE for any ring and modulus
• Worst‐Case to Average‐Case Reductions Based on Gaussian Measures