Folding-BSD Algorithm for Binary Sequence Decomposition

2Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The 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 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, key part of the IoT security stack.

Cite

CITATION STYLE

APA

Martin-Navarro, J. L., & Fúster-Sabater, A. (2020). Folding-BSD Algorithm for Binary Sequence Decomposition. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 12249 LNCS, pp. 345–359). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-030-58799-4_26

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free