TY  - INPR
A1  - Schnorr, Claus Peter
A1  - Hörner, Horst Helmut
T1  - Attacking the chor-rivest cryptosystem by improved lattice reduction
N2  - We introduce algorithms for lattice basis reduction that are improvements of the famous L3-algorithm. If a random L3-reduced lattice basis b1,b2,...,bn is given such that the vector of reduced Gram-Schmidt coefficients ({µi,j} 1<= j< i<= n) is uniformly distributed in [0,1)n(n-1)/2, then the pruned enumeration finds with positive probability a shortest lattice vector. We demonstrate the power of these algorithms by solving random subset sum problems of arbitrary density with 74 and 82 many weights, by breaking the Chor-Rivest cryptoscheme in dimensions 103 and 151 and by breaking Damgard's hash function.
Y1  - 2005
UR  - http://publikationen.ub.uni-frankfurt.de/frontdoor/index/index/docId/4251
UR  - https://nbn-resolving.org/urn:nbn:de:hebis:30-12367
UR  - http://www.mi.informatik.uni-frankfurt.de/research/papers.html
N1  - Preprint, später in: Advances in Cryptology - Eurocrypt '95 Lecture Notes in Computer Science, Vol. 921, Springer Verlag, 1995, S. 1-12
ER  -