论文部分内容阅读
提出了SHA-0-MAC的部分密钥恢复攻击,这是首个对SHA-0-MAC的密钥恢复攻击。SHA-0-MAC是基于SHA-0的MDx-MAC,由Preneel等人于1995年在美密会提出,其包含3个160比特子密钥K0,K1,K2。基于Bi-ham等给出的伪碰撞路线,结合王小云等提出的MD5-MAC部分密钥恢复的思想,对SHA-0-MAC恢复子密钥K1的128比特,推出该路线成立的充分条件.在此基础上利用Contini的部分密钥恢复技术恢复160比特的子密钥K0,总的复杂度约为2125.58次MAC询问。
Proposed partial key recovery attack of SHA-0-MAC, which is the first key recovery attack on SHA-0-MAC. SHA-0-MAC is a SHA-0 based MDx-MAC proposed by Preneel et al. At the American Society in 1995, which contains three 160-bit subkeys K0, K1, K2. Based on the pseudo-collision path given by Bi-Ham et al. And the idea of key recovery of MD5-MAC proposed by Wang Xiaoyun et al., SHA-0-MAC restores the 128 bits of subkey K1 to obtain the sufficient condition for the establishment of this route. On this basis, the 160-bit sub-key K0 is restored by using the partial key recovery technology of Contini. The total complexity is about 2125.58 MAC queries.