Jan 16, 2008 by Javantea
Jan 15, 2008 by Javantea
404K Germany ICE train
588K Germany ICE train
312K Germany ICE train
588K Sweden Local train
540K Sweden Local train
588K Sweden Local train
448K Sweden Local train
588K Sweden Local train
588K Berlin New Years Fireworks
584K Berlin New Years Fireworks
Dec 16, 2007 by Javantea
Aug 17, 2007 by Javantea
by Javantea aka. Joel R. Voss
August 16, 2007
Source Code not yet available.
Collisions in hashes are quite bad news for cryptographers. Finding them is quite difficult. The current best attack against SHA1 requires 2**69 operations.
a is an array of plaintexts.
The likeliness of a collision is a function of len(a).
sha1mod1.py sha1 hashes the plaintexts modulus x.
It counts the collisions.
Plotted here is x vs collisions(x).
