How to meet ternary LWE keys
From MaRDI portal
Publication:2128581
DOI10.1007/978-3-030-84245-1_24zbMATH Open1486.94131OpenAlexW3157398644MaRDI QIDQ2128581FDOQ2128581
Authors: Alexander May 
Publication date: 22 April 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-84245-1_24
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
Cryptography (94A60) Quantum computation (81P68) Quantum cryptography (quantum-theoretic aspects) (81P94)
Cites Work
- Title not available (Why is that?)
- On ideal lattices and learning with errors over rings
- Fully homomorphic encryption using ideal lattices
- Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
- Trapdoors for hard lattices and new cryptographic constructions
- Classical hardness of learning with errors
- Lattice signatures without trapdoors
- Parallel collision search with cryptanalytic applications
- Lattice signatures and bimodal Gaussians
- Making NTRU as secure as worst-case problems over ideal lattices
- On Lovász' lattice reduction and the nearest lattice point problem
- Improved Generic Algorithms for Hard Knapsacks
- New lattice based cryptographic constructions
- A Hybrid Lattice-Reduction and Meet-in-the-Middle Attack Against NTRU
- Title not available (Why is that?)
- Sieve algorithms for the shortest vector problem are practical
- 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
- Faster Gaussian lattice sampling using lazy floating-point arithmetic
- On the concrete hardness of learning with errors
- (One) failure is not an option: bootstrapping the search for failures in lattice-based encryption schemes
- On computing nearest neighbors with applications to decoding of binary linear codes
- An improved BKW algorithm for LWE with applications to cryptography and lattices
- Advances in Cryptology - CRYPTO 2003
- A Subfield Lattice Attack on Overstretched NTRU Assumptions
- Sieving for Shortest Vectors in Lattices Using Angular Locality-Sensitive Hashing
- Hardness of SIS and LWE with small parameters
- Attacks on the AJPS Mersenne based cryptosystem
- NTRU prime: reducing attack surface at low cost
- Coded-BKW: solving LWE using lattice codes
- Probability and computing. Randomization and probabilistic techniques in algorithms and data analysis
- Reduced memory meet-in-the-middle attack against the NTRU private key
- Lattice decoding attacks on binary LWE
- Speed-ups and time-memory trade-offs for tuple lattice sieving
- On the hardness of LWE with binary error: revisiting the hybrid lattice-reduction and meet-in-the-middle attack
- Improved classical and quantum algorithms for subset-sum
- A detailed analysis of the hybrid lattice-reduction and meet-in-the-middle attack
Cited In (12)
- Quantum key search for ternary LWE
- Parallel isogeny path finding with limited memory
- Hybrid dual and meet-LWE attack
- How to find ternary LWE keys using locality sensitive hashing
- Memory-efficient attacks on small LWE keys
- Profiling side-channel attacks on Dilithium. A small bit-fiddling leak breaks it all
- \textsf{SMAUG}: pushing lattice-based key encapsulation mechanisms to the limits
- Cryptanalysis of the \textsc{Peregrine} lattice-based signature scheme
- Low memory attacks on small key CSIDH
- New time-memory trade-offs for subset sum -- improving ISD in theory and practice
- Partial key exposure attacks on BIKE, Rainbow and NTRU
- Memory-efficient attacks on small LWE keys
Uses Software
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)
