作者: Kazumaro Aoki , Yu Sasaki
DOI: 10.1007/978-3-642-03356-8_5
关键词: Preimage attack 、 Cryptographic hash function 、 Hash function 、 Collision resistance 、 SHA-2 、 Message authentication code 、 Computer science 、 Theoretical computer science 、 Hash-based message authentication code 、 Collision attack
摘要: Preimage resistance of several hash functions has already been broken by the meet-in-the-middle attacks and they utilize a property that their message schedules consist of only permutations of message words. It is unclear whether this type of attacks is applicable to a hash function whose message schedule does not consist of permutations of message words. This paper proposes new attacks against reduced SHA-0 and SHA-1 hash functions by analyzing a message schedule that does not consist of permutations but linear …