Title :
Searching cubes for testing Boolean functions and its application to Trivium
Author :
Meicheng Liu;Dongdai Lin;Wenhao Wang
Author_Institution :
State Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of Sciences, Beijing 100093, China
fDate :
6/1/2015 12:00:00 AM
Abstract :
In this paper, we describe a sub-maximal degree monomial test and propose a heuristic algorithm for searching favourable cubes, for testing Boolean functions formed by stream ciphers. We apply them to Trivium, and mount a distinguisher on Trivium reduced to 839 rounds with 237 complexity, which is so far the best distinguisher on reduced Trivium.
Keywords :
"Ciphers","Boolean functions","Testing","Transforms","Complexity theory","Indexes"
Conference_Titel :
Information Theory (ISIT), 2015 IEEE International Symposium on
Electronic_ISBN :
2157-8117
DOI :
10.1109/ISIT.2015.7282504
