Provable dual attacks on learning with errors
From MaRDI portal
Publication:6637724
DOI10.1007/978-3-031-58754-2_10MaRDI QIDQ6637724
Publication date: 13 November 2024
Learning and adaptive systems in artificial intelligence (68T05) Cryptography (94A60) Quantum algorithms and complexity in the theory of computing (68Q12)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the concrete hardness of learning with errors
- A hierarchy of polynomial time lattice basis reduction algorithms
- New bounds in some transference theorems in the geometry of numbers
- On a dual/hybrid approach to small secret LWE. A dual/enumeration technique for learning with errors and application to security estimates of FHE schemes
- A mean value theorem in geometry of numbers
- Mean values over the space of lattices
- Estimating quantum speedups for lattice sieves
- Solving the Shortest Vector Problem in 2 n Time Using Discrete Gaussian Sampling
- Lattice Coding for Signals and Networks
- Sieve algorithms for the shortest vector problem are practical
- Lattice problems in NP ∩ coNP
- Lattices Which Are Good for (Almost) Everything
- Trapdoors for hard lattices and new cryptographic constructions
- Lattice-based Cryptography
- Averaging bounds for lattices and linear codes
- New directions in nearest neighbor searching with applications to lattice sieving
- Lattice Attacks on NTRU and LWE: A History of Refinements
- Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
- Lattice Gaussian Sampling by Markov Chain Monte Carlo: Bounded Distance Decoding and Trapdoor Sampling
- Quantum speedup of Monte Carlo methods
- Classical hardness of learning with errors
- A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
- On Dual Lattice Attacks Against Small-Secret LWE and Parameter Choices in HElib and SEAL
- On lattices, learning with errors, random linear codes, and cryptography
- Faster Dual Lattice Attacks for Solving LWE with Applications to CRYSTALS
- Rigorous foundations for dual attacks in coding theory
Related Items (1)
This page was built for publication: Provable dual attacks on learning with errors
