Cryptology ePrint Archive: Report 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\%.

Category / Keywords: secret-key cryptography /

Date: received 15 Apr 2015

Contact author: sarkar santanu bir at gmail com

Available format(s): PDF | BibTeX Citation

Version: 20150420:014228 (All versions of this report)

Short URL: ia.cr/2015/340

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]