作者: Marina Pudovkina
DOI: 10.1007/978-3-642-27901-0_8
关键词:
摘要: An important component of an iterated block cipher is the key schedule. In this paper, we consider ciphers with a schedule algorithm described by recurrence relation. We present efficient related-key attack on those ciphers. With regard to similar techniques, such as slide attack, our proposal considerably reduces number necessary plaintexts from O (2n /4) 2r , where r recovered round keys. The complexity is, moreover, almost equal guessing just one key.