Review of the Lineal Complexity Calculation through Binomial Decomposition-Based Algorithms

Abstract

The ubiquity of smart devices and IoT are the main forces behind the development of cryptographic primitives that preserve the security of these devices, with the resource constraints they face. In this sense, the development of lightweight cryptographic algorithms, where PRNGs are an essential part of them, provides security to all these interconnected devices. In this work, a family of sequence generators with hard characteristics to be analyzed by standard methods is described. Moreover, we introduce an innovative technique for sequence decomposition that allows one to extract useful information on the sequences under study. In addition, diverse algorithms to evaluate the strength of such binary sequences have been introduced and analyzed to show which performs better.