How to meet ternary LWE keys
From MaRDI portal
Publication:2128581
DOI10.1007/978-3-030-84245-1_24zbMath1486.94131OpenAlexW3157398644MaRDI QIDQ2128581
Publication date: 22 April 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-84245-1_24
Quantum computation (81P68) Cryptography (94A60) Quantum cryptography (quantum-theoretic aspects) (81P94)
Related Items (5)
How to find ternary LWE keys using locality sensitive hashing ⋮ New time-memory trade-offs for subset sum -- improving ISD in theory and practice ⋮ Hybrid dual and meet-LWE attack ⋮ Partial key exposure attacks on BIKE, Rainbow and NTRU ⋮ Parallel isogeny path finding with limited memory
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the concrete hardness of learning with errors
- On Lovász' lattice reduction and the nearest lattice point problem
- Parallel collision search with cryptanalytic applications
- Attacks on the AJPS Mersenne based cryptosystem
- NTRU prime: reducing attack surface at low cost
- Speed-ups and time-memory trade-offs for tuple lattice sieving
- (One) failure is not an option: bootstrapping the search for failures in lattice-based encryption schemes
- A detailed analysis of the hybrid lattice-reduction and meet-in-the-middle attack
- Improved classical and quantum algorithms for subset-sum
- On the Hardness of LWE with Binary Error: Revisiting 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
- Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
- Lattice Signatures without Trapdoors
- On Computing Nearest Neighbors with Applications to Decoding of Binary Linear Codes
- Reduced memory meet-in-the-middle attack against the NTRU private key
- Making NTRU as Secure as Worst-Case Problems over Ideal Lattices
- Improved Generic Algorithms for Hard Knapsacks
- Sieving for Shortest Vectors in Lattices Using Angular Locality-Sensitive Hashing
- Coded-BKW: Solving LWE Using Lattice Codes
- An Improved BKW Algorithm for LWE with Applications to Cryptography and Lattices
- Sieve algorithms for the shortest vector problem are practical
- Trapdoors for hard lattices and new cryptographic constructions
- On Ideal Lattices and Learning with Errors over Rings
- New Generic Algorithms for Hard Knapsacks
- New lattice based cryptographic constructions
- A Hybrid Lattice-Reduction and Meet-in-the-Middle Attack Against NTRU
- 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
- Lattice Decoding Attacks on Binary LWE
- Fully homomorphic encryption using ideal lattices
- Advances in Cryptology - CRYPTO 2003
- Classical hardness of learning with errors
This page was built for publication: How to meet ternary LWE keys
