Discrete Gaussian sampling for BKZ-reduced basis
From MaRDI portal
Cites work
- A complete analysis of the BKZ lattice reduction algorithm
- A hierarchy of polynomial time lattice basis reduction algorithms
- A toolkit for ring-LWE cryptography
- Analyzing blockwise lattice algorithms using dynamical systems
- Classical hardness of learning with errors
- Finding short integer solutions when the modulus is small
- scientific article; zbMATH DE number 1962809 (Why is no real title available?)
- scientific article; zbMATH DE number 1775383 (Why is no real title available?)
- scientific article; zbMATH DE number 1445397 (Why is no real title available?)
- Lattice attacks on NTRU and LWE: a history of refinements
- Lattice coding for signals and networks. A structured coding approach to quantization, modulation, and multiuser information theory. With contributions by Bobak Nazer and Yuval Kochman
- Lattice Gaussian Sampling by Markov Chain Monte Carlo: Bounded Distance Decoding and Trapdoor Sampling
- Lattice-based Cryptography
- Lattices Which Are Good for (Almost) Everything
- Making NTRU as secure as worst-case problems over ideal lattices
- 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
- On lattices, learning with errors, random linear codes, and cryptography
- On the smoothing parameter and last minimum of random orthogonal lattices
- Provable dual attacks on learning with errors
- Semantically Secure Lattice Codes for the Gaussian Wiretap Channel
- Solving the shortest vector problem in 2ⁿ time using discrete Gaussian sampling (extended abstract)
- The general sieve kernel and new records in lattice reduction
- Trapdoors for hard lattices and new cryptographic constructions
This page was built for publication: Discrete Gaussian sampling for BKZ-reduced basis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6969302)
