1. RUA
  2. Investigación
  3. Grupo de Álgebra y Geometría (GAG)
  4. INV - GAG - Artículos de Revistas

Computational Analysis of Interleaving PN-Sequences with Different Polynomials

Por favor, use este identificador para citar o enlazar este ítem: http://hdl.handle.net/10045/123228
EstadísticasEstadísticas
Registro completo de metadatos
Registro completo de metadatos
Campo DCValorIdioma
dc.contributorGrupo de Álgebra y Geometría (GAG)es_ES
dc.contributor.authorCardell, Sara D.-
dc.contributor.authorRequena Arévalo, Verónica-
dc.contributor.authorFúster Sabater, Amparo-
dc.contributor.otherUniversidad de Alicante. Departamento de Matemáticases_ES
dc.date.accessioned2022-05-02T08:15:47Z-
dc.date.available2022-05-02T08:15:47Z-
dc.date.issued2022-04-26-
dc.identifier.citationCardell SD, Requena V, Fúster-Sabater A. Computational Analysis of Interleaving PN-Sequences with Different Polynomials. Cryptography. 2022; 6(2):21. https://doi.org/10.3390/cryptography6020021es_ES
dc.identifier.issn2410-387X-
dc.identifier.urihttp://hdl.handle.net/10045/123228-
dc.description.abstractBinary PN-sequences generated by LFSRs exhibit good statistical properties; however, due to their intrinsic linearity, they are not suitable for cryptographic applications. In order to break such a linearity, several approaches can be implemented. For example, one can interleave several PN-sequences to increase the linear complexity. In this work, we present a deep randomness study of the resultant sequences of interleaving binary PN-sequences coming from different characteristic polynomials with the same degree. We analyze the period and the linear complexity, as well as many other important cryptographic properties of such sequences.es_ES
dc.description.sponsorshipThis work was supported in part by the Spanish State Research Agency (AEI) of the Ministry of Science and Innovation (MICINN), project P2QProMeTe (PID2020-112586RB-I00/AEI/ 10.13039/501100011033). It was also supported by Comunidad de Madrid (Spain) under project CYNAMON (P2018/TCS-4566), co-funded by FSE and European Union FEDER funds. The work of the second author was partially supported by Spanish grant VIGROB-287 of the University of Alicante.es_ES
dc.languageenges_ES
dc.publisherMDPIes_ES
dc.rights© 2022 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).es_ES
dc.subjectPN-sequencees_ES
dc.subjectInterleaved sequencees_ES
dc.subjectLinear complexityes_ES
dc.subjectRandomnesses_ES
dc.subject.otherÁlgebraes_ES
dc.titleComputational Analysis of Interleaving PN-Sequences with Different Polynomialses_ES
dc.typeinfo:eu-repo/semantics/articlees_ES
dc.peerreviewedsies_ES
dc.identifier.doi10.3390/cryptography6020021-
dc.relation.publisherversionhttps://doi.org/10.3390/cryptography6020021es_ES
dc.rights.accessRightsinfo:eu-repo/semantics/openAccesses_ES
dc.relation.projectIDinfo:eu-repo/grantAgreement/AEI/Plan Estatal de Investigación Científica y Técnica y de Innovación 2017-2020/PID2020-112586RB-I00es_ES
Aparece en las colecciones:INV - GAG - Artículos de Revistas

Archivos en este ítem:
Archivos en este ítem:
Archivo Descripción TamañoFormato 
ThumbnailCardell_etal_2022_Cryptography.pdf16,38 MBAdobe PDFAbrir Vista previa
Muestra el registro sencillo


Este ítem está licenciado bajo Licencia Creative Commons Creative Commons