Welcome to the resource topic for 2015/340
Title:
A New Distinguisher on Grain v1 for 106 rounds
Authors: 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%.
ePrint: https://eprint.iacr.org/2015/340
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .