In 2004, we introduced the related-key boomerang/ rectangle attacks, which allow us to enjoy the benefits of the boomerang attack and the related-key technique, simultaneously. The new attacks were used since then to attack numerous block ciphers. While the claimed applications are significant, most of them have a major drawback. Their validity cannot be verified experimentally due to their high complexity. Together with the lack of rigorous justification of the probabilistic assumptions underlying the technique, this lead Murphy to claim that attacks using the related-key boomerang/rectangle technique are not legitimate. This paper contains two contributions. The first is a rigorous analysis of the related-key boomerang/rectangle attacks, including devising provably optimal distinguishers and computing their success rate, and discussing the underlying independence assumptions. The second contribution is an extensive experimental verification of the related-key boomerang attack against the GSM block cipher, KASUMI. Our experiments reveal that the success probability of the distinguisher, when averaged over different choices of the keys, is close to the theoretical prediction. However, the exact probability depends on the key, such that for some por- tion of the keys, the distinguisher holds with a higher probability than expected, while for the rest of the keys, the distinguisher fails completely.

Article Free Access Share on A proof of the security of quantum key distribution (extended abstract) Authors: Eli Biham Computer Science Department, Technion, Haifa 32000, Israel Computer Science Department, Technion, Haifa 32000, IsraelView Profile , Michel Boyer DIRO, Université de Montréal, Montréal, Canada DIRO, Université de Montréal, Montréal, CanadaView Profile , P. Oscar Boykin Dept. of Electrical Engineering, UCLA, Los Angeles, CA Dept. of Electrical Engineering, UCLA, Los Angeles, CAView Profile , Tal Mor Dept. of Electrical Engineering, UCLA, Los Angeles, CA and Dept. of Electrical Engineering, College of Judea and Samaria, Ariel, Israel Dept. of Electrical Engineering, UCLA, Los Angeles, CA and Dept. of Electrical Engineering, College of Judea and Samaria, Ariel, IsraelView Profile , Vwani Roychowdhury Dept. of Electrical Engineering, College of Judea and Samaria, Ariel, Israel Dept. of Electrical Engineering, College of Judea and Samaria, Ariel, IsraelView Profile Authors Info & Claims STOC '00: Proceedings of the thirty-second annual ACM symposium on Theory of computingMay 2000 Pages 715–724https://doi.org/10.1145/335305.335406Published:01 May 2000Publication History 38citation1,057DownloadsMetricsTotal Citations38Total Downloads1,057Last 12 Months95Last 6 weeks17 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF