Folding-bsd algorithm for binary sequence decomposition

Thumbnail Image

Access rights

openAccess
publishedVersion

URL

Journal Title

Journal ISSN

Volume Title

A1 Alkuperäisartikkeli tieteellisessä aikakauslehdessä
This publication is imported from Aalto University research portal.
View publication in the Research portal (opens in new window)
View/Open full text file from the Research portal (opens in new window)

Authors

Date

2020-12-15

Department

Department of Computer Science

Major/Subject

Mcode

Degree programme

Language

en

Pages

17

Series

Computers, Volume 9, issue 4, pp. 1-17

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.

Description

Keywords

Binomial sequences, IoT, LFSR, PRNG, Stream ciphers

Other note

DOI

10.3390/computers9040100

Citation

Martin-Navarro, J L & Fúster-Sabater, A 2020, 'Folding-bsd algorithm for binary sequence decomposition', Computers, vol. 9, no. 4, 100, pp. 1-17. https://doi.org/10.3390/computers9040100

Permanent link to this item

https://urn.fi/URN:NBN:fi:aalto-202101251581

Collections

[article-cris] Perustieteiden korkeakoulu / SCI