On the higher-bit version of approximate inhomogeneous short integer solution problem

DOI10.1007/978-3-030-92548-2_14zbMath1504.94166OpenAlexW4205513089MaRDI QIDQ2149828

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

Publication date: 29 June 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-92548-2_14

zbMATH Keywords

random oracle modelAjtai's one-way functionhash-and-sign signature

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (1)

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

Uses Software

• NTRU
• Falcon

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generating shorter bases for hard random lattices
• Bonsai trees, or how to delegate a lattice basis
• Approximate trapdoors for lattices and smaller hash-and-sign signatures
• The lattice-based digital signature scheme qTESLA
• Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
• Lattice Signatures without Trapdoors
• Better Key Sizes (and Attacks) for LWE-Based Encryption
• Trapdoors for hard lattices and new cryptographic constructions
• On Ideal Lattices and Learning with Errors over Rings
• Efficient Lattice (H)IBE in the Standard Model
• An Efficient and Parallel Gaussian Sampler for Lattices
• Fully homomorphic encryption using ideal lattices
• Asymptotically Efficient Lattice-Based Digital Signatures
• Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
• Classical hardness of learning with errors
• On lattices, learning with errors, random linear codes, and cryptography

This page was built for publication: On the higher-bit version of approximate inhomogeneous short integer solution problem