Computational Analysis of Interleaving PN-Sequences with Different Polynomials

Cryptography

Sara D. Cardell¹  Verónica Requena²  Amparo Fúster-Sabater³ 

[1] Centro de Matemática, Computação e Cognição, Universidade Federal do ABC (UFABC), Santo André 09210-580, Brazil;Departament de Matemàtiques, Universitat d’Alacant, 03690 Alacant, Spain;Instituto de Tecnologías Físicas y de la Información (ITEFI), C.S.I.C., 28006 Madrid, Spain;

关键词: PN-sequence;    interleaved sequence;    linear complexity;    randomness;   

DOI  :  10.3390/cryptography6020021

来源: DOAJ

【 摘 要 】

Binary 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.

【 授权许可】

Unknown