Cryptanalysis of Round-reduced Fantomas, Robin and iSCREAM

Ashutosh Dhar Dwivedi*, Shalini Dhar, Gautam Srivastava, Rajani Singh

*Corresponding author for this work

Research output: Contribution to journalJournal articleResearchpeer-review

2 Downloads (Pure)


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.
Original languageEnglish
Article number4
Issue number1
Number of pages11
Publication statusPublished - Mar 2019
Externally publishedYes


  • Linear cryptanalysis
  • LS-design cipher
  • Fantomas and Robin
  • Block cipher
  • Bitslice cipher; related-key cryptanalysis
  • Tweakable block cipher

Cite this