Review of the lineal complexity calculation through binomial decomposition-based algorithms

Jose Luis Martin-Navarro*, Amparo Fúster-Sabater

*Corresponding author for this work

Research output: Contribution to journalArticleScientificpeer-review

11 Downloads (Pure)

Abstract

The ubiquity of smart devices and IoT are the main forces behind the development of cryptographic primitives that preserve the security of this devices, with the resources 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.

Original languageEnglish
Article number478
Pages (from-to)1-22
Number of pages22
JournalMathematics
Volume9
Issue number5
DOIs
Publication statusPublished - 1 Mar 2021
MoE publication typeA1 Journal article-refereed

Keywords

  • Binomial sequences
  • Complexity
  • IoT
  • PRNG
  • Stream ciphers

Fingerprint Dive into the research topics of 'Review of the lineal complexity calculation through binomial decomposition-based algorithms'. Together they form a unique fingerprint.

Cite this