Header menu link for other important links
X
A new distinguisher on grain v1 for 106 rounds
Published in Springer Verlag
2015
Volume: 9478
   
Pages: 334 - 344
Abstract
In Asiacrypt 2010, Knellwolf, Meier and Naya-Plasencia pro-posed distinguishing attacks on Grain v1 when (i) Key Scheduling process is reduced to 97 rounds using 227chosen IVs and (ii) Key Scheduling process is reduced to 104 rounds using 235 chosen IVs. Using similar idea, Banik obtained a new distinguisher for 105 rounds. In this paper, we show similar approach can work for 106 rounds. We present a new distinguisher on Grain v1 for 106 rounds with success probability 63%. © Springer International Publishing Switzerland 2015.
About the journal
JournalData powered by TypesetLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherData powered by TypesetSpringer Verlag
ISSN03029743
Open AccessYes
Concepts (7)
  •  related image
    Information systems
  •  related image
    DIFFERENTIAL CRYPTANALYSIS
  •  related image
    DISTINGUISHERS
  •  related image
    DISTINGUISHING ATTACKS
  •  related image
    KEY SCHEDULING
  •  related image
    Stream ciphers
  •  related image
    Scheduling