A New Distinguisher on Grain v1 for 106 rounds

Santanu Sarkar

Paper 2015/340

A New Distinguisher on Grain v1 for 106 rounds

Santanu Sarkar

Abstract

In Asiacrypt 2010, Knellwolf, Meier and Naya-Plasencia proposed distinguishing attacks on Grain v1 when (i) Key Scheduling process is reduced to 97 rounds using $2^{27}$ chosen IVs and (ii) Key Scheduling process is reduced to 104 rounds using $2^{35}$ 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\%.

Metadata

Available format(s): PDF
Category: Secret-key cryptography
Publication info: Preprint. MINOR revision.
Contact author(s): sarkar santanu bir @ gmail com
History: 2015-04-20: received
Short URL: https://ia.cr/2015/340
License: CC BY

BibTeX

@misc{cryptoeprint:2015/340,
      author = {Santanu Sarkar},
      title = {A New Distinguisher on Grain v1 for 106 rounds},
      howpublished = {Cryptology {ePrint} Archive, Paper 2015/340},
      year = {2015},
      url = {https://eprint.iacr.org/2015/340}
}