By Topic

Internal state recovery of grain-v1 employing normality order of the filter function

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $33
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
M. J. Mihaljevic ; Mathematical Institute, Serbian Academy of Sciences and Arts, Belgrade, Serbia ; S. Gangopadhyay ; G. Paul ; H. Imai

A novel technique for cryptanalysis of the stream cipher Grain-v1 is given. In a particular setting, the algorithms proposed in this study provide recovery of an internal state of Grain-v1 with the expected time complexity of only 254 table look-up operations employing a memory of dimension ~270, assuming availability of 234 keystream sequences each of length 238 generated for different initial values, and the pre-processing time complexity of ~288. These figures appear as significantly better in comparison with the previously reported ones. The proposed approach for cryptanalysis primarily depends on the order of normality of the employed Boolean function in Grain-v1. Accordingly, in addition to the security evaluation insights of Grain-v1, the results of this study are also an evidence of the cryptographic significance of the normality criteria of Boolean functions.

Published in:

IET Information Security  (Volume:6 ,  Issue: 2 )