A modification of the LLL reduction algorithm

Authors:
M. Pohst
Affiliations:
Mathematisches Institut, Universität Düsseldorf 4000 Düsseldorf FRG
Venue:
Journal of Symbolic Computation
Year:
1987

Citing 1
Cited 7

Cryptanalytic attacks on the multiplicative knapsack cryptosystem and on Shamir's fast signature scheme

IEEE Transactions on Information Theory

Parallel lattice basis reduction

ISSAC '92 Papers from the international symposium on Symbolic and algebraic computation
The identity problem for elementary functions and constants

ISSAC '94 Proceedings of the international symposium on Symbolic and algebraic computation
A simplified method of recognizing zero among elementary constants

ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation
Cited References

Computer algebra handbook
Irreducible constituents of monomial representations

Journal of Symbolic Computation
Integer matrix rank certification

Proceedings of the 2009 international symposium on Symbolic and algebraic computation
A new view on HJLS and PSLQ: sums and projections of lattices

Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

The reduction algorithm of Lenstra et al. (1982) is modified in a way that the input vectors can be linearly dependent. The output consists of a basis of the lattice generated by the input vectors as well as non-trivial linear combinations of O by the input vectors if those are linearly dependent.