Review of the lineal complexity calculation through binomial decomposition-based algorithms

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

*Tämän työn vastaava kirjoittaja

Tutkimustuotos: LehtiartikkeliArticleScientificvertaisarvioitu

86 Lataukset (Pure)

Abstrakti

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.

AlkuperäiskieliEnglanti
Artikkeli478
Sivut1-22
Sivumäärä22
JulkaisuMathematics
Vuosikerta9
Numero5
DOI - pysyväislinkit
TilaJulkaistu - 1 maalisk. 2021
OKM-julkaisutyyppiA1 Alkuperäisartikkeli tieteellisessä aikakauslehdessä

Sormenjälki

Sukella tutkimusaiheisiin 'Review of the lineal complexity calculation through binomial decomposition-based algorithms'. Ne muodostavat yhdessä ainutlaatuisen sormenjäljen.

Siteeraa tätä