A natural lattice basis problem with applications
From MaRDI portal
Publication:4396454
DOI10.1090/S0025-5718-98-00936-3zbMath1044.11594OpenAlexW1967450465MaRDI QIDQ4396454
Publication date: 14 June 1998
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/s0025-5718-98-00936-3
Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Quadratic forms (reduction theory, extreme forms, etc.) (11H55) Computing methodologies for text processing; mathematical typography (68U15)
Cites Work
- Unnamed Item
- Unnamed Item
- On finite-precision representations of geometric objects
- On Lovász' lattice reduction and the nearest lattice point problem
- A modification of the LLL reduction algorithm
- Factoring polynomials with rational coefficients
- Approximating rings of integers in number fields
- Polynomial Time Algorithms for Finding Integer Relations among Real Numbers
- Integer Programming with a Fixed Number of Variables
- Cryptanalytic attacks on the multiplicative knapsack cryptosystem and on Shamir's fast signature scheme
- A polynomial-time algorithm for breaking the basic Merkle - Hellman cryptosystem
- Solving Simultaneous Modular Equations of Low Degree
- Reconstructing Truncated Integer Variables Satisfying Linear Congruences
- Generating automatically tuned bitmaps from outlines
- A monte carlo method for factorization
- Improved Rounding for Spline Coefficients and Knots
This page was built for publication: A natural lattice basis problem with applications