Preimage sampling in the higher-bit approximate setting with a non-spherical Gaussian sampler

DOI10.1007/978-3-031-29371-9_23OpenAlexW4361857424MaRDI QIDQ6134235

Hiroki Shuzuya, Anaëlle Le Dévéhat, Shingo Hasegawa

Publication date: 21 August 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-29371-9_23

zbMATH Keywords

approximate lattice trapdoorhigher-bit approximationnon-spherical Gaussian sampler

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Computer security (68M25)

Cites Work

• Unnamed Item
• Unnamed Item
• New bounds in some transference theorems in the geometry of numbers
• On the higher-bit version of approximate inhomogeneous short integer solution problem
• Approximate trapdoors for lattices and smaller hash-and-sign signatures
• The lattice-based digital signature scheme qTESLA
• Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
• Better Key Sizes (and Attacks) for LWE-Based Encryption
• Trapdoors for hard lattices and new cryptographic constructions
• Bonsai Trees, or How to Delegate a Lattice Basis
• Efficient Lattice (H)IBE in the Standard Model
• Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
• Fully homomorphic encryption using ideal lattices
• Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
• On lattices, learning with errors, random linear codes, and cryptography

This page was built for publication: Preimage sampling in the higher-bit approximate setting with a non-spherical Gaussian sampler