On the computation of lattice vectors of minimal length, successive minima and reduced bases with applications
From MaRDI portal
Publication:3919780
DOI10.1145/1089242.1089247zbMath0467.10022OpenAlexW1997086908MaRDI QIDQ3919780
Publication date: 1981
Published in: ACM SIGSAM Bulletin (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1089242.1089247
Lattices and convex bodies (number-theoretic aspects) (11H06) Software, source code, etc. for problems pertaining to number theory (11-04)
Related Items (30)
Lattice reduction with approximate enumeration oracles. Practical algorithms and concrete performance ⋮ Partially Known Nonces and Fault Injection Attacks on SM2 Signature Algorithm ⋮ Sieving for Shortest Vectors in Lattices Using Angular Locality-Sensitive Hashing ⋮ Shortest vector from lattice sieving: a few dimensions for free ⋮ Faster Sieving for Shortest Lattice Vectors Using Spherical Locality-Sensitive Hashing ⋮ Finding shortest lattice vectors faster using quantum search ⋮ Lattice Sieving via Quantum Random Walks ⋮ Bounds for solid angles of lattices of rank three ⋮ Solving some cryptanalytic problems for lattice-based cryptosystems with quantum annealing method ⋮ Sieve algorithms for some orthogonal integer lattices ⋮ Efficient computation of multidimensional theta functions ⋮ Structured \((\min ,+)\)-convolution and its applications for the shortest/closest vector and nonlinear knapsack problems ⋮ Lattice-based cryptography: a survey ⋮ Revisiting the hexagonal lattice: on optimal lattice circle packing ⋮ MLAMBDA: a modified LAMBDA method for integer least-squares estimation ⋮ On the geometry of cyclic lattices ⋮ Sieve algorithms for the shortest vector problem are practical ⋮ Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification ⋮ Positive-definite ternary quadratic forms with the same representations over ℤ ⋮ An improved LLL algorithm ⋮ Random Sampling Revisited: Lattice Enumeration with Discrete Pruning ⋮ Hermite’s Constant and Lattice Algorithms ⋮ On integral well-rounded lattices in the plane ⋮ Finding Shortest Lattice Vectors in the Presence of Gaps ⋮ Parallel Cholesky-based reduction for the weighted integer least squares problem ⋮ A Survey of Solving SVP Algorithms and Recent Strategies for Solving the SVP Challenge ⋮ On bounded distance decoding with predicate: breaking the ``lattice barrier for the hidden number problem ⋮ On distribution of well-rounded sublattices of \(\mathbb Z^2\) ⋮ Calculation of Minkowski-reduced lattice bases ⋮ An Efficient Quadratic Programming Relaxation Based Algorithm for Large-Scale MIMO Detection
This page was built for publication: On the computation of lattice vectors of minimal length, successive minima and reduced bases with applications
