Introduced a more efficient method for determining collision prefixes for SHA-1
Researchers from the French Institute for Research in Informatics and Automation (INRIA) and Nanyang Technological University (Singapore) have developed an improved method for attacking the SHA-1 algorithm, which greatly simplifies the creation of two different documents with the same SHA-1 hashes. The essence of the method is to reduce the operation of a full collision selection in SHA-1 to a collision attack with a given prefix, in which a collision occurs if there is [β¦]