Cryptanalysis of round-reduced fantomas, robin and iscream
| Autor: | Rajani Singh, Shalini Dhar, Gautam Srivastava, Ashutosh Dhar Dwivedi |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2019 |
| Předmět: |
Computer Networks and Communications
Computer science linear cryptanalysis 0102 computer and information sciences 02 engineering and technology Data_CODINGANDINFORMATIONTHEORY tweakable block cipher 01 natural sciences lcsh:Technology law.invention LS-design cipher law Ciphertext iSCREAM 0202 electrical engineering electronic engineering information engineering Arithmetic Linear cryptanalysis Block cipher lcsh:T Applied Mathematics block cipher 020206 networking & telecommunications Plaintext Computer Science Applications Fantomas and Robin Computational Theory and Mathematics Cipher 010201 computation theory & mathematics Bitslice cipher related-key cryptanalysis Path (graph theory) Key (cryptography) Tweakable block cipher Cryptanalysis Software bitslice cipher related-key cryptanalysis ISCREAM |
| Zdroj: | Dwivedi, A D, Dhar, S, Srivastava, G & Singh, R 2019, ' Cryptanalysis of round-reduced fantomas, robin and iscream ', Cryptography, vol. 3, no. 1, 4, pp. 1-11 . https://doi.org/10.3390/cryptography3010004 Cryptography, Vol 3, Iss 1, p 4 (2019) Cryptography Volume 3 Issue 1 |
| DOI: | 10.3390/cryptography3010004 |
| Popis: | In this work, we focus on LS-design ciphers Fantomas, Robin, and iSCREAM. LS-designs are a family of bitslice ciphers aimed at efficient masked implementations against side-channel analysis. We have analyzed Fantomas and Robin with a technique that previously has not been applied to both algorithms or linear cryptanalysis. The idea behind linear cryptanalysis is to build a linear characteristic that describes the relation between plaintext and ciphertext bits. Such a relationship should hold with probability 0.5 (bias is zero) for a secure cipher. Therefore, we try to find a linear characteristic between plaintext and ciphertext where bias is not equal to zero. This non-random behavior of cipher could be converted to some key-recovery attack. For Fantomas and Robin, we find 5 and 7-round linear characteristics. Using these characteristics, we attack both the ciphers with reduced rounds and recover the key for the same number of rounds. We also apply linear cryptanalysis to the famous CAESAR candidate iSCREAM and the closely related LS-design Robin. For iScream, we apply linear cryptanalysis to the round-reduced cipher and find a 7-round best linear characteristics. Based on those linear characteristics we extend the path in the related-key scenario for a higher number of rounds. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|