Linear complexity of generalized sequences by comparison of PN-sequences

Autor(es)

Fuster-Sabater, Amparo ^[1] ; Cardell, Sara D. ^[2]

Afiliação do(s) autor(es)

^[1] CSIC, Inst Tecnol Fis & Informac, Madrid - Spain

^[2] Univ Estadual Campinas, Inst Matemat Estat & Comp Cient, Campinas - Brazil

• Tipo de documento: Artigo Científico
• Fonte: REVISTA DE LA REAL ACADEMIA DE CIENCIAS EXACTAS FISICAS Y NATURALES SERIE A-MATEMATICAS; v. 114, n. 2 JAN 25 2020.
• Citações Web of Science: 0

Resumo

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)

• Processo FAPESP: 13/25977-7 - Segurança e confiabilidade da informação: teoria e prática
• Beneficiário: Marcelo Firer
• Modalidade de apoio: Auxílio à Pesquisa - Temático