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

DOI10.1007/978-3-031-29371-9_23MaRDI QIDQ6134235zbMATH OpenOpenAlexFDO

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

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

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

Cites work

• Approximate trapdoors for lattices and smaller hash-and-sign signatures
• Better key sizes (and attacks) for LWE-based encryption
• 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
• scientific article; zbMATH DE number 1186948 (Why is no real title available?)
• scientific article; zbMATH DE number 1256724 (Why is no real title available?)
• New bounds in some transference theorems in the geometry of numbers
• On lattices, learning with errors, random linear codes, and cryptography
• On the higher-bit version of approximate inhomogeneous short integer solution problem
• The lattice-based digital signature scheme qTESLA
• Trapdoors for hard lattices and new cryptographic constructions
• Trapdoors for lattices: simpler, tighter, faster, smaller
• Worst‐Case to Average‐Case Reductions Based on Gaussian Measures

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6134235)