Ambiguity of integer sequences and application
L. Bournon · 2002
We present an algorithm which solves in polynomial time the problem of the ambiguity of integer sequences. This is done by introducing a suitable transformation from F/sub 2//sup n/ to {-1,0,1}/sup n/ and by the search of a short vector in a reduced lattice according to the L/sup 3/ algorithm. The algorithm presented shows that the Damgard (1989) hash function is insecure.>