Zero-Correlation Attacks on Tweakable Block Ciphers with Linear Tweakey Expansion
| Autor: | Ankele, Ralph, Dobraunig, Christoph, Guo, Jian, Lambooij, Eran, Leander, Gregor, Todo, Yosuke |
|---|---|
| Přispěvatelé: | School of Physical and Mathematical Sciences |
| Rok vydání: | 2019 |
| Předmět: |
lcsh:Computer engineering. Computer hardware
Applied Mathematics Symmetric-key cryptography zero-correlation lcsh:TK7885-7895 0102 computer and information sciences 02 engineering and technology Mantis 01 natural sciences secret-key cryptography / Symmetric-key cryptography tweakable block ciphers zero-correlation integral cryptanalysis Qarma Mantis Skinny Computer Science Applications integral cryptanalysis Computational Mathematics 010201 computation theory & mathematics tweakable block ciphers 0202 electrical engineering electronic engineering information engineering Science::Mathematics [DRNTU] Tweakable Block Ciphers 020201 artificial intelligence & image processing Digital Security Qarma Software Skinny Symmetric-Key Cryptography |
| Zdroj: | IACR Transactions on Symmetric Cryptology, Vol 2019, Iss 1 (2019) IACR Transactions on Symmetric Cryptology, 2019, 1, pp. 192-235 IACR Transactions on Symmetric Cryptology, 2019, 192-235 IACR Transactions on Symmetric Cryptology 1–43 IACR Transactions on Symmetric Cryptology; Volume 2019, Issue 1; 192-235 |
| ISSN: | 2519-173X |
| Popis: | The design and analysis of dedicated tweakable block ciphers is a quite recent and very active research field that provides an ongoing stream of new insights. For instance, results of Kranz, Leander, and Wiemer from FSE 2017 show that the addition of a tweak using a linear tweak schedule does not introduce new linear characteristics. In this paper, we consider – to the best of our knowledge – for the first time the effect of the tweak on zero-correlation linear cryptanalysis for ciphers that have a linear tweak schedule. It turns out that the tweak can often be used to get zero-correlation linear hulls covering more rounds compared to just searching zero-correlation linear hulls on the data-path of a cipher. Moreover, this also implies the existence of integral distinguishers on the same number of rounds. We have applied our technique on round reduced versions of Qarma, Mantis, and Skinny. As a result, we can present – to the best of our knowledge – the best attack (with respect to number of rounds) on a round-reduced variant of Qarma. IACR Transactions on Symmetric Cryptology, Volume 2019, Issue 1 |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|