Francesco, check
Wikibooks for some information on SHA-1, and
this document on some more general information on hash functions. When we speak of a hash function being broken, we mean that someone has managed to do exactly what we hoped was not feasible: to find two messages that would be assigned the same fingerprint when using the hash function in question. Such a pair of messages is called a collision.