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.10022MaRDI 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
11H06: Lattices and convex bodies (number-theoretic aspects)
11-04: Software, source code, etc. for problems pertaining to number theory
Related Items
A Survey of Solving SVP Algorithms and Recent Strategies for Solving the SVP Challenge, An Efficient Quadratic Programming Relaxation Based Algorithm for Large-Scale MIMO Detection, Hermite’s Constant and Lattice Algorithms, Random Sampling Revisited: Lattice Enumeration with Discrete Pruning, On the geometry of cyclic lattices, Bounds for solid angles of lattices of rank three, Revisiting the hexagonal lattice: on optimal lattice circle packing, On integral well-rounded lattices in the plane, Parallel Cholesky-based reduction for the weighted integer least squares problem, Calculation of Minkowski-reduced lattice bases, Finding shortest lattice vectors faster using quantum search, On distribution of well-rounded sublattices of \(\mathbb Z^2\), Shortest vector from lattice sieving: a few dimensions for free, On bounded distance decoding with predicate: breaking the ``lattice barrier for the hidden number problem, Lattice reduction with approximate enumeration oracles. Practical algorithms and concrete performance, Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification, Efficient computation of multidimensional theta functions, MLAMBDA: a modified LAMBDA method for integer least-squares estimation, An improved LLL algorithm, Finding Shortest Lattice Vectors in the Presence of Gaps, Faster Sieving for Shortest Lattice Vectors Using Spherical Locality-Sensitive Hashing, Positive-definite ternary quadratic forms with the same representations over ℤ, Partially Known Nonces and Fault Injection Attacks on SM2 Signature Algorithm, Sieving for Shortest Vectors in Lattices Using Angular Locality-Sensitive Hashing, Sieve algorithms for the shortest vector problem are practical
