scientific article; zbMATH DE number 2196508
From MaRDI portal
Publication:5465355
Recommendations
- scientific article; zbMATH DE number 1256724
- Generating hard satisfiability problems
- scientific article; zbMATH DE number 6168348
- Generating and measuring instances of hard semidefinite programs
- Publication:4938616
- Generating hard instances for robust combinatorial optimization
- Random constraint satisfaction: easy generation of hard (satisfiable) instances
- On the probability of generating a lattice
- scientific article; zbMATH DE number 1643917
Cited in
(33)- Generating shorter bases for hard random lattices
- A note on the minimal volume of almost cubic parallelepipeds
- A new Gaussian sampling for trapdoor lattices with arbitrary modulus
- Learning a parallelepiped: Cryptanalysis of GGH and NTRU signatures
- Generating cryptographically-strong random lattice bases and recognizing rotations of \(\mathbb{Z}^n\)
- The geometry of lattice cryptography
- The remote set problem on lattices
- On the probability of generating a lattice
- scientific article; zbMATH DE number 1405637 (Why is no real title available?)
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
- Generating shorter bases for hard random lattices
- Improved hardness results for unique shortest vector problem
- Trace-based cryptanalysis of cyclotomic \(R_{q, 0} \times R_q\)-PLWE for the non-split case
- Exploiting the symmetry of \(\mathbb{Z}^n\): randomization and the automorphism problem
- On the LWE cryptosystem with more general disturbance
- scientific article; zbMATH DE number 5726469 (Why is no real title available?)
- Asymptotically Efficient Lattice-Based Digital Signatures
- Functional commitments for all functions, with transparent setup and from SIS
- A note on the concrete hardness of the shortest independent vector in lattices
- Generating hard instances for robust combinatorial optimization
- scientific article; zbMATH DE number 15884 (Why is no real title available?)
- Just take the average! An embarrassingly simple \(2^n\)-time algorithm for SVP (and CVP)
- Lower bounds of shortest vector lengths in random NTRU lattices
- Cryptographic functions from worst-case complexity assumptions
- Improved discrete Gaussian and Subgaussian analysis for lattice cryptography
- Almost Perfect Lattices, the Covering Radius Problem, and Applications to Ajtai's Connection Factor
- Bonsai trees, or how to delegate a lattice basis
- Cryptanalysis of lattice-based sequentiality assumptions and proofs of sequential work
- Lattice problems beyond polynomial time
- Counting lattice vectors
- scientific article; zbMATH DE number 1852143 (Why is no real title available?)
- Lattice Point Enumeration on Block Reduced Bases
- Random self-reducibility of ideal-SVP via Arakelov random walks
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5465355)
