Related-Key Boomerang Attack on Block Cipher SQUARE
- Authors
- Koo, Bonwook; Yeom, Yongjin; Song, Junghwan
- Issue Date
- Jan-2011
- Publisher
- IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG
- Keywords
- block cipher; cryptanalysis; related-key boomerang attack; SQUARE
- Citation
- IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, v.E94A, no.1, pp.3 - 9
- Indexed
- SCIE
SCOPUS
- Journal Title
- IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES
- Volume
- E94A
- Number
- 1
- Start Page
- 3
- End Page
- 9
- URI
- https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/169294
- DOI
- 10.1587/transfun.E94.A.3
- ISSN
- 0916-8508
- Abstract
- SQUARE is an 8-round SPN structure block cipher and its round function and key schedule have been slightly modified to design building blocks of Rijndael. Key schedule of SQUARE is simple and efficient but fully affine, so we apply a related-key attack on it. We find a 3-round related-key differential trail with probability 2(-28), which has zero differences both on its input and output states, which is called local collision in [6]. By extending of this related-key differential, we construct a successful attack on full rounds of SQUARE. In this paper, we present a key recovery attack on full rounds of SQUARE using a related-key boomerang distinguisher. We construct a 7-round related-key boomerang distinguisher with probability 2-(119) by finding local collision, and calculate its probability using ladder switch and multiple path estimation techniques. As a result, one round on top of the distinguisher is added to construct an attack on full rounds of SQUARE which recovers 16-bit key information with 2(123) encryptions and 2(121) data.
- Files in This Item
-
Go to Link
- Appears in
Collections - 서울 자연과학대학 > 서울 수학과 > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/169294)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.