Advanced search
Start date
Betweenand
Related content
(Reference retrieved automatically from Web of Science through information on FAPESP grant and its corresponding number as mentioned in the publication by the authors.)

Linear complexity of generalized sequences by comparison of PN-sequences

Full text
Author(s):
Fuster-Sabater, Amparo [1] ; Cardell, Sara D. [2]
Total Authors: 2
Affiliation:
[1] CSIC, Inst Tecnol Fis & Informac, Madrid - Spain
[2] Univ Estadual Campinas, Inst Matemat Estat & Comp Cient, Campinas - Brazil
Total Affiliations: 2
Document type: Journal article
Source: REVISTA DE LA REAL ACADEMIA DE CIENCIAS EXACTAS FISICAS Y NATURALES SERIE A-MATEMATICAS; v. 114, n. 2 JAN 25 2020.
Web of Science Citations: 0
Abstract

Linear complexity is a much used metric of the security of any binary sequence with application in communication systems and cryptography. In this work, we propose a method of computing the linear complexity of a popular family of cryptographic sequences, the so-called generalized sequences. Such a family is generated by means of the irregular decimation of a single Pseudo Noise sequence (PN-sequence). The computation method is based on the comparison of the PN-sequence with shifted versions of itself. The concept of linear recurrence relationship and the rows of the Sierpinski triangle play a leading part in this computation. (AU)

FAPESP's process: 13/25977-7 - Security and reliability of Information: theory and practice
Grantee:Marcelo Firer
Support Opportunities: Research Projects - Thematic Grants