Folding-bsd algorithm for binary sequence decomposition

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

*Tämän työn vastaava kirjoittaja

Tutkimustuotos: LehtiartikkeliArticleScientificvertaisarvioitu

3 Sitaatiot (Scopus)
64 Lataukset (Pure)

Abstrakti

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.

AlkuperäiskieliEnglanti
Artikkeli100
Sivut1-17
Sivumäärä17
JulkaisuComputers
Vuosikerta9
Numero4
DOI - pysyväislinkit
TilaJulkaistu - 15 jouluk. 2020
OKM-julkaisutyyppiA1 Alkuperäisartikkeli tieteellisessä aikakauslehdessä

Sormenjälki

Sukella tutkimusaiheisiin 'Folding-bsd algorithm for binary sequence decomposition'. Ne muodostavat yhdessä ainutlaatuisen sormenjäljen.

Siteeraa tätä