In this paper we present a rigorous treatment of the related-key boomerang and the related-key rectangle distinguishers. Following this treatment, we devise optimal distinguishing algorithms using the LLR (Logarithmic Likelihood Ratio) statistics. We then analyze the success probability under reasonable independence assumptions, and verify the computation experimentally by implementing an actual attack on a 6-round variant of KASUMI. The paper ends with a demonstration of the strength of our new proposed techniques with attacks on 10-round AES-192 and the full KASUMI.
Category / Keywords: secret-key cryptography / Related-key Boomerang Attack, Related-Key Rectangle Attack, AES, KASUMI. Publication Info: Submitted to a journal in October 2009 Date: received 12 Jan 2010 Contact author: orr dunkelman at weizmann ac il Available format(s): PDF | BibTeX Citation Version: 20100114:061019 (All versions of this report) Short URL: ia.cr/2010/019 Discussion forum: Show discussion | Start new discussion