Mathematical Methods of Cryptography

On weak key-scheduling algorithms relatively the related-key attack

M. A. Pudovkina

Moscow Engineering Physics Institute, Moscow

Abstract: In this paper key-scheduling algorithms having the defined recurrent property are considered. For this class of algorithms we describe related-key attacks. The complexity of the attack is equal to the exhaustive search of one round key. It requires a little number of plaintexts.

UDC: 519.7