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%.
Author supplied keywords
Cite
CITATION STYLE
Sarkar, S. (2015). A new distinguisher on grain v1 for 106 rounds. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9478, pp. 334–344). Springer Verlag. https://doi.org/10.1007/978-3-319-26961-0_20
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
