How to find ternary LWE keys using locality sensitive hashing
From MaRDI portal
Publication:2149799
DOI10.1007/978-3-030-92641-0_12zbMath1492.94130OpenAlexW3206406654MaRDI QIDQ2149799
Alexander May, Elena Kirshanova
Publication date: 29 June 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-92641-0_12
Searching and sorting (68P10) Cryptography (94A60) Data encryption (aspects in computer science) (68P25)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- On the concrete hardness of learning with errors
- Exploring trade-offs in batch bounded distance decoding
- On approximate nearest neighbors under \(l_\infty\) norm
- Estimate all the {LWE, NTRU} schemes!
- LWE with side information: attacks and concrete security estimation
- How to meet ternary LWE keys
- Lattice Signatures and Bimodal Gaussians
- Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
- On Computing Nearest Neighbors with Applications to Decoding of Binary Linear Codes
- Improved Generic Algorithms for Hard Knapsacks
- New Generic Algorithms for Hard Knapsacks
- New directions in nearest neighbor searching with applications to lattice sieving
- Practical Lattice-Based Cryptography: A Signature Scheme for Embedded Systems
This page was built for publication: How to find ternary LWE keys using locality sensitive hashing
