Interleaving Shifted Versions of a PN-Sequence

Mathematics

SaraDíaz Cardell¹  Verónica Requena²  Amparo Fúster-Sabater³ 

[1] Centro de Matemática, Computação e Cognição, Santo André, SP 09210-580, Brazil;Departamento de Matemáticas, Universidad de Alicante, 03690 Alicante, Spain;Instituto de Tecnologías Físicas y de la Información, C.S.I.C., 28006 Madrid, Spain;

关键词: PN-sequence;    interleaving sequence;    linear complexity;    period;    decimation;   

DOI  :  10.3390/math9060687

来源: DOAJ

【 摘 要 】

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.

【 授权许可】

Unknown