Jose Luis Martin-Navarro

Jose Luis Martin-Navarro

Teaching Assistant and Master's degree student in Security and Cloud Computing (SECCLO - Erasmus Mundus) at Aalto University.

Publications

Review of the Lineal Complexity Calculation through Binomial Decomposition-Based Algorithms.

Published in Mathematics Cryptography and Information Security Special Issue of the MDPI journal Mathematics, 2021

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.

Recommended citation: Martin-Navarro JL, Fúster-Sabater A. Review of the Lineal Complexity Calculation through Binomial Decomposition-Based Algorithms. Mathematics. 2021; 9(5):478. https://doi.org/10.3390/math9050478 https://doi.org/10.3390/math9050478

Folding-BSD Algorithm for Binary Sequence Decomposition

Published in Computational Science and Its Applications – ICCSA 2020, 2020

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.

Recommended citation: Recommended citation: Martin-Navarro J.L., Fúster-Sabater A. (2020) Folding-BSD Algorithm for Binary Sequence Decomposition. Computational Science and Its Applications – ICCSA 2020. Lecture Notes in Computer Science, vol 12249. Springer. https://doi.org/10.1007/978-3-030-58799-4_26 https://doi.org/10.1007/978-3-030-58799-4_26

An Innovative Linear Complexity Computation for Cryptographic Sequences.

Published in 13th International Conference on Computational Intelligence in Security for Information Systems (CISIS 2020), 2020

A simple algorithm to compute the linear complexity of binary sequences with period a power of 2 has been proposed. The algorithm exploits the fractal structure of the binomial representation in this kind of binary sequences. The application of the general algorithm to a particular family of cryptographic sequences (generalized sequences) improves its performance as decreases the amount of sequence to be processed.

Recommended citation: Martín-Navarro J.L., Fúster-Sabater A., Cardell S.D. (2021) An Innovative Linear Complexity Computation for Cryptographic Sequences. 13th International Conference on Computational Intelligence in Security for Information Systems (CISIS 2020). Advances in Intelligent Systems and Computing, vol 1267. Springer https://doi.org/10.1007/978-3-030-57805-3_32