Ever Better Cryptanalytic Results Against SHA-1
schneier.com
schneier.com
That means (iirc) someone can create two messages that have the same hash - but not create a message that has a particular hash.
Still not ideal - but not terrible. It still wouldn't be feasible, for example, to bruteforce a password from its hash.
http://www.phreedom.org/research/rogue-ca/
The potential for intentional collisions makes it critical that an attacker cannot control or predict all of the inputs to your signing operation.
collision attack is enough to break git.
EDIT: Thinking about it, you could have a commented area somewhere where you put in garbage characters to try to generate a collision, not unlike producing two word documents that read slightly different (different clauses in a contract for example) but have a ton of random metadata that causes the collision. But this isn't an attack on SHA1 just on hashes in general.
Why would anyone do that? Perhaps they open the document and see its all good stuff, but don't spot all the hidden comments (like HTML's <!--) which are there to make the collision work.
It would be a good practise anyway, that if you routinely sign files other people produce, to add your own blob of randomness as an extra hidden comment to the document you sign.
That is not possible using this attack. This is just a collision atttack, not a preimage attack.
It would be a good practise anyway, that if you routinely sign files other people produce, to add your own blob of randomness as an extra hidden comment to the document you sign.
I don't think people will trust you anymore if you start adding your own data to the documents you sign.
So why would that prevent the attack billpg described?
To forge a document, you need to find another document having the same hash. So it is a preimage attack.
Using a collision attack you can find collisions in the hash space, but that is not useful directly.