Folding-bsd algorithm for binary sequence decomposition

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

*Corresponding author for this work

Research output: Contribution to journalArticleScientificpeer-review

Abstract

The Internet of Things (IoT) revolution leads to a range of critical services which rely on IoT devices. Nevertheless, they often lack proper security, becoming the gateway to attack the whole system. IoT security protocols often rely on stream ciphers, where pseudo-random number generators (PRNGs) are an essential part of them. In this article, a family of ciphers with strong characteristics that make them difficult to be analyzed by standard methods is described. In addition, we will discuss an innovative technique of sequence decomposition and present a novel algorithm to evaluate the strength of binary sequences, a key part of the IoT security stack. The density of the binomial sequences in the decomposition has been studied experimentally to compare the performance of the presented algorithm with previous works.

Original languageEnglish
Article number100
Pages (from-to)1-17
Number of pages17
JournalComputers
Volume9
Issue number4
DOIs
Publication statusPublished - 15 Dec 2020
MoE publication typeA1 Journal article-refereed

Keywords

  • Binomial sequences
  • IoT
  • LFSR
  • PRNG
  • Stream ciphers

Fingerprint Dive into the research topics of 'Folding-bsd algorithm for binary sequence decomposition'. Together they form a unique fingerprint.

Cite this