Lattice basis reduction: Improved practical algorithms and solving subset sum problems

@article{Schnorr1994LatticeBR,
  title={Lattice basis reduction: Improved practical algorithms and solving subset sum problems},
  author={C. Schnorr and M. Euchner},
  journal={Mathematical Programming},
  year={1994},
  volume={66},
  pages={181-199}
}
We report on improved practical algorithms for lattice basis reduction. We propose a practical floating point version of theL3-algorithm of Lenstra, Lenstra, Lovász (1982). We present a variant of theL3-algorithm with “deep insertions” and a practical algorithm for block Korkin—Zolotarev reduction, a concept introduced by Schnorr (1987). Empirical tests show that the strongest of these algorithms solves almost all subset sum problems with up to 66 random weights of arbitrary bit length within… Expand
Rankin Lattice Reduction for Programmers
Lattice basis reduction is a powerful mathematical tool with many applications. In this paper I am going to review the most classical algorithm for lattice basis reduction, the one of Lenstra,Expand
An Experimental Comparison of Some LLL-Type Lattice Basis Reduction Algorithms
In this paper we experimentally compare the performance of the $$L^2$$L2 lattice basis reduction algorithm, whose importance recently became evident, with our own Gram-based lattice basis reductionExpand
On Solving the Shortest Basis Problem Based on Sequential Reduction
  • Shanxiang Lyu, Zheng Wang, Ling Liu
  • Computer Science
  • IEEE Communications Letters
  • 2021
TLDR
This work proposes to employ successive interference cancellation (SIC) as a subroutine inside SR, and the whole algorithm is referred to as SR-SIC, and it is proved that the upper bound on the basis length of SR- SIC is better than those of major Lenstra, Lenstra- and Lovász (LLL) based variants when the dimension of the lattice basis is no larger than 4. Expand
Optimizing preprocessing method of recursive-BKZ lattice reduction algorithm
  • Md Mokammel Haque, J. Pieprzyk
  • Mathematics
  • 2015 2nd International Conference on Electrical Information and Communication Technologies (EICT)
  • 2015
Lattice problems are considered as the key elements in many areas of computer science as well as in cryptography; the most important of which is the shortest vector problem (called SVP in short) andExpand
Lattice Reduction Algorithms
TLDR
This tutorial gives an overview of lattice reduction algorithms, and considers both polynomial-time algorithms that find relatively short bases, such as the LLL algorithm, and more expensive algorithms thatfind shorter bases,such as the BKZ algorithm. Expand
At tacking the C hor-Rivest Cryptosystem by Improved Lattice Reduction
We introduce algorithms for lattice basis reduction that are improvements of the famous L3-algorithm. If a random L3-reduced lat- tice basis bl,. . . ,b, is given such that the vector of reducedExpand
Full Lattice Basis Reduction on Graphics Cards
TLDR
It is shown that GPUs are, as well, suited to apply lattice basis reduction algorithms that were merely of theoretical interest so far due to their enormous computational effort. Expand
Attacking the Chor-Rivest Cryptosystem by Improved Lattice Reduction
TLDR
Algorithms for lattice basis reduction that are improvements of the famous L3-algorithm are introduced that solve random subset sum problems of arbitrary density with 74 and 82 many weights and by breaking Damgard's hash function. Expand
Lattice Enumeration Using Extreme Pruning
TLDR
This work revisits lattice enumeration algorithms and shows that surprising exponential speedups can be achieved both in theory and in practice by using a new technique, which is called extreme pruning. Expand
Practical algorithms for constructing HKZ and Minkowski reduced bases
In this paper, three practical lattice basis reduction algorithms are presented. The first algorithm constructs a Hermite, Korkine and Zolotareff (HKZ) reduced lattice basis, in which a unimodularExpand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 67 REFERENCES
Lattice Basis Reduction: Improved Practical Algorithms and Solving Subset Sum Problems
TLDR
Empirical tests show that the strongest of these algorithms solves almost all subset sum problems with up to 58 random weights of arbitrary bit length within at most a few hours on a UNISYS 6000/70 or within a couple of minutes on a SPARC 2 computer. Expand
Basis Reduction Algorithms and Subset Sum Problems
This thesis investigates a new approach to lattice basis reduction suggested by M. Seysen. Seysen''s algorithm attempts to globally reduce a lattice basis, whereas the Lenstra, Lenstra, Lovasz (LLL)Expand
A More Efficient Algorithm for Lattice Basis Reduction
  • C. Schnorr
  • Mathematics, Computer Science
  • J. Algorithms
  • 1988
TLDR
A new algorithm simulates the Lovasz algorithm through approximate arithmetic, which uses at most O ( n 4 log B ) arithmetic operations on O-bit integers to transform a given integer lattice basis into a reduced basis. Expand
A Hierarchy of Polynomial Time Lattice Basis Reduction Algorithms
  • C. Schnorr
  • Computer Science, Mathematics
  • Theor. Comput. Sci.
  • 1987
TLDR
An algorithm which for k?N finds a nonzero lattice vector b so that |b|2?(6k2)nk?(L)2, and successively applies Korkine?Zolotareff reduction to blocks of length k of the lattice basis. Expand
An Improved Low-Denisty Subset Sum Algorithm
TLDR
A simple modification of the Lagarias-Odlyzko algorithm would solve almost all problems of density < 0.9408... if it could find shortest non-zero vectors in lattices if it was combined with known lattice basis reduction algorithms. Expand
Solving low density subset sum problems
  • J. Lagarias, A. Odlyzko
  • Computer Science, Mathematics
  • 24th Annual Symposium on Foundations of Computer Science (sfcs 1983)
  • 1983
TLDR
This method gives a polynomial time attack on knapsack public key cryptosystems that can be expected to break them if they transmit information at rates below dc (n), as n → ∞. Expand
Polynomial Time Algorithms for Finding Integer Relations Among Real Numbers
We present algorithms, which when given a real vector x∈ℝn and a parameter k∈ℕ as input either find an integer relation m∈ℤn, m≠0 with xTm=0 or prove there is no such integer relation with ‖m‖≦2k.Expand
The Generalized Basis Reduction Algorithm
TLDR
An algorithm for integer programming which executes in polynomial time for fixed n, but which avoids the ellipsoidal approximations required by Lenstra's algorithm is described. Expand
Algorithmic theory of numbers, graphs and convexity
  • L. Lovász
  • Mathematics, Computer Science
  • CBMS-NSF regional conference series in applied mathematics
  • 1986
TLDR
How to Round Numbers Preliminaries and some Applications in Combinatorics Cuts and Joins Chromatic Number, Cliques and Perfect Graphs Minimizing a Submodular Function. Expand
Simultaneous reduction of a lattice basis and its reciprocal basis
  • M. Seysen
  • Mathematics, Computer Science
  • Comb.
  • 1993
TLDR
A new algorithm is obtained that obtains an algorithm to compute the shortest vector and a Korkine-Zolotarev reduced basis of a lattice that is efficient in practice for dimension up to 30. Expand
...
1
2
3
4
5
...