Generalized related-key rectangle attacks on block ciphers with linear key schedule: applications to SKINNY and GIFT
| Autor: | Gaoli Wang, Willi Meier, Keting Jia, Xiaoyang Dong, Boxin Zhao |
|---|---|
| Rok vydání: | 2020 |
| Předmět: |
business.industry
Applied Mathematics 020206 networking & telecommunications Cryptography 0102 computer and information sciences 02 engineering and technology 01 natural sciences Computer Science Applications 010201 computation theory & mathematics Proof-of-work system 0202 electrical engineering electronic engineering information engineering Key (cryptography) NIST Rectangle Arithmetic business Key schedule Time complexity Mathematics Block cipher |
| Zdroj: | Designs, Codes and Cryptography. 88:1103-1126 |
| ISSN: | 1573-7586 0925-1022 |
| DOI: | 10.1007/s10623-020-00730-1 |
| Popis: | This paper gives a new generalized key-recovery model of related-key rectangle attacks on block ciphers with linear key schedules. The model is quite optimized and applicable to various block ciphers with linear key schedule. As a proof of work, we apply the new model to two very important block ciphers, i.e. SKINNY and GIFT, which are basic modules of many candidates of the Lightweight Cryptography (LWC) standardization project by NIST. For SKINNY, we reduce the complexity of the best previous 27-round related-tweakey rectangle attack on SKINNY-128-384 from $$2^{331}$$ to $$2^{294}$$. In addition, the first 28-round related-tweakey rectangle attack on SKINNY-128-384 is given, which gains one more round than before. For the candidate LWC SKINNY AEAD M1, we conduct a 24-round related-tweakey rectangle attack with a time complexity of $$2^{123}$$ and a data complexity of $$2^{123}$$ chosen plaintexts. For the case of GIFT-64, we give the first 24-round related-key rectangle attack with a time complexity $$2^{91.58}$$, while the best previous attack on GIFT-64 only reaches 23 rounds at most. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink