In this paper, we analyze the non-linear part of the output function h of Grain-v1 and use a guess and determine strategy to recover 33 state bits from 33 consecutive keystream bits of Grain-v1 by fixing 45 bits and guessing 82 bits. This reduces the conditional sampling resistance of Grain-v1, which is best till now. We apply the Time-Memory-Data Trade-Off (TMDTO) attack on Grain-v1 with this conditional sampling resistance to get a trade-off curve which improves the pre-processing time complexity and online time complexity with improved memory.
CITATION STYLE
Dalai, D. K., & Pal, S. (2019). Recovering Internal States of Grain-v1. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11879 LNCS, pp. 325–337). Springer. https://doi.org/10.1007/978-3-030-34339-2_18
Mendeley helps you to discover research relevant for your work.