How to meet ternary LWE keys
From MaRDI portal
Publication:2128581
Recommendations
- Quantum key search for ternary LWE
- How to find ternary LWE keys using locality sensitive hashing
- A Hybrid Lattice-Reduction and Meet-in-the-Middle Attack Against NTRU
- On the hardness of LWE with binary error: revisiting the hybrid lattice-reduction and meet-in-the-middle attack
- Revisiting Lattice Attacks on Overstretched NTRU Parameters
Cites work
- scientific article; zbMATH DE number 1186948 (Why is no real title available?)
- scientific article; zbMATH DE number 1852140 (Why is no real title available?)
- (One) failure is not an option: bootstrapping the search for failures in lattice-based encryption schemes
- A Hybrid Lattice-Reduction and Meet-in-the-Middle Attack Against NTRU
- A Subfield Lattice Attack on Overstretched NTRU Assumptions
- A detailed analysis of the hybrid lattice-reduction and meet-in-the-middle attack
- Advances in Cryptology - CRYPTO 2003
- An improved BKW algorithm for LWE with applications to cryptography and lattices
- Attacks on the AJPS Mersenne based cryptosystem
- Classical hardness of learning with errors
- Coded-BKW: solving LWE using lattice codes
- Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
- Faster Gaussian lattice sampling using lazy floating-point arithmetic
- Fully homomorphic encryption using ideal lattices
- Hardness of SIS and LWE with small parameters
- Improved Generic Algorithms for Hard Knapsacks
- Improved classical and quantum algorithms for subset-sum
- Lattice decoding attacks on binary LWE
- Lattice signatures and bimodal Gaussians
- Lattice signatures without trapdoors
- Making NTRU as secure as worst-case problems over ideal lattices
- NTRU prime: reducing attack surface at low cost
- New directions in nearest neighbor searching with applications to lattice sieving
- New generic algorithms for hard knapsacks
- New lattice based cryptographic constructions
- On Lovász' lattice reduction and the nearest lattice point problem
- On computing nearest neighbors with applications to decoding of binary linear codes
- On ideal lattices and learning with errors over rings
- On the concrete hardness of learning with errors
- On the hardness of LWE with binary error: revisiting the hybrid lattice-reduction and meet-in-the-middle attack
- Parallel collision search with cryptanalytic applications
- Practical Lattice-Based Cryptography: A Signature Scheme for Embedded Systems
- Probability and computing. Randomization and probabilistic techniques in algorithms and data analysis
- Reduced memory meet-in-the-middle attack against the NTRU private key
- Sieve algorithms for the shortest vector problem are practical
- Sieving for Shortest Vectors in Lattices Using Angular Locality-Sensitive Hashing
- Speed-ups and time-memory trade-offs for tuple lattice sieving
- Trapdoors for hard lattices and new cryptographic constructions
Cited in
(14)- \textsf{SMAUG}: pushing lattice-based key encapsulation mechanisms to the limits
- Quantum key search for ternary LWE
- NTWE: A Natural Combination of NTRU and LWE
- How to enumerate LWE keys as narrow as in \textsc{Kyber}/\textsc{Dilithium}
- Memory-efficient attacks on small LWE keys
- Low memory attacks on small key CSIDH
- Memory-efficient attacks on small LWE keys
- Profiling side-channel attacks on Dilithium. A small bit-fiddling leak breaks it all
- New time-memory trade-offs for subset sum -- improving ISD in theory and practice
- Partial key exposure attacks on BIKE, Rainbow and NTRU
- Parallel isogeny path finding with limited memory
- Hybrid dual and meet-LWE attack
- Cryptanalysis of the \textsc{Peregrine} lattice-based signature scheme
- How to find ternary LWE keys using locality sensitive hashing
This page was built for publication: How to meet ternary LWE keys
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2128581)
