Modular lattice signatures, revisited
From MaRDI portal
Publication:2302153
DOI10.1007/s10623-019-00694-xzbMath1448.94239OpenAlexW2983029985WikidataQ126800224 ScholiaQ126800224MaRDI QIDQ2302153
Jill Pipher, Jeffrey Hoffstein, Zhenfei Zhang, Dipayan Das, William Whyte
Publication date: 25 February 2020
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-019-00694-x
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Learning a parallelepiped: Cryptanalysis of GGH and NTRU signatures
- A hybrid lattice basis reduction and quantum search attack on LWE
- A detailed analysis of the hybrid lattice-reduction and meet-in-the-middle attack
- A Subfield Lattice Attack on Overstretched NTRU Assumptions
- Hardness of SIS and LWE with Small Parameters
- Lattice Signatures and Bimodal Gaussians
- Lattice Signatures without Trapdoors
- Efficient Identity-Based Encryption over NTRU Lattices
- Transcript Secure Signatures Based on Modular Lattices
- Lattice Cryptography for the Internet
- Authenticated Key Exchange from Ideal Lattices
- Tuple lattice sieving
- Choosing Parameters for NTRUEncrypt
- BKZ 2.0: Better Lattice Security Estimates
- Trapdoors for hard lattices and new cryptographic constructions
- Lattice Enumeration Using Extreme Pruning
- A Hybrid Lattice-Reduction and Meet-in-the-Middle Attack Against NTRU
- Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
- Learning a Zonotope and More: Cryptanalysis of NTRUSign Countermeasures
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
- Predicting Lattice Reduction
