Sciweavers

FCT
1991
Springer
15 years 8 months ago
Lattice Basis Reduction: Improved Practical Algorithms and Solving Subset Sum Problems
We report on improved practical algorithms for lattice basis reduction. We propose a practical oating point version of the L3{algorithm of Lenstra, Lenstra, Lovasz (1982). We pres...
Claus-Peter Schnorr, M. Euchner
FCT
1991
Springer
15 years 8 months ago
The Complexity of Computing Maximal Word Functions
Maximal word functions occur in data retrieval applications and have connections with ranking problems, which in turn were rst investigated in relation to data compression 21 . By ...
Danilo Bruschi, Giovanni Pighizzini
FACS
1991
170views Hardware» more  FACS 1991»
15 years 8 months ago
Deriving Measures of Software Reuse in Object Oriented Systems
The analysis and measurement of current levels of software reuse are necessary to monitor improvements. This paper provides a framework for the derivation of measures of software ...
James M. Bieman
EUROCRYPT
1991
Springer
15 years 8 months ago
Boolean Functions Satisfying Higher Order Propagation Criteria
Boolean functions that satisfy higher order propagation criteria are studied. A complete characterization is given of the autocorrelation function and Walsh spectrum of second ord...
Bart Preneel, René Govaerts, Joos Vandewall...
EUROCRYPT
1991
Springer
15 years 8 months ago
Discrete Logarithm Based Protocols
Patrick Horster, Hans-Joachim Knobloch