Interleaving Shifted Versions of a PN-Sequence

Sara Díaz Cardell, Amparo Fúster-Sabater and Verónica Requena
Additional contact information
Sara Díaz Cardell: Centro de Matemática, Computação e Cognição, Santo André 09210-580, SP, Brazil
Amparo Fúster-Sabater: Instituto de Tecnologías Físicas y de la Información, C.S.I.C., 28006 Madrid, Spain
Verónica Requena: Departamento de Matemáticas, Universidad de Alicante, 03690 Alicante, Spain

Mathematics, 2021, vol. 9, issue 6, 1-23

Abstract: The output sequence of the shrinking generator can be considered as an interleaving of determined shifted versions of a single PN -sequence. In this paper, we present a study of the interleaving of a PN-sequence and shifted versions of itself. We analyze some important cryptographic properties as the period and the linear complexity in terms of the shifts. Furthermore, we determine the total number of the interleaving sequences that achieve each possible value of the linear complexity.

Keywords: PN-sequence; interleaving sequence; linear complexity; period; decimation (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2021
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/9/6/687/pdf (application/pdf)
https://www.mdpi.com/2227-7390/9/6/687/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:9:y:2021:i:6:p:687-:d:522382

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().