- type: iterative hash function
- compression function: 512-bit message block, 160-bit chaining variable
- max. message length: < 264 bits
- Specification: FIPS 180-2 Secure Hash Standard
We can try to give the basic infrmation: so block size general construction of compression functions etc. NO DETAILS. Just reference to the paper proposing the hash function. Then we list the attacks or preliminary analyses. We give the abstract and our opinion about this attack. For instance 2nd-preimages in much less than 2n. Opinion could be: very nice observation, generic, but still not practical since extreme message lengths are required.
I think we should go this way. Esecially we should clearly say what is