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.
Subject
General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)
Reference28 articles.
1. Shift Register-Sequences;Golomb,1982
2. Correlation Properties of the Bluetooth Combiner
3. A Pedagogical Implementation of the GSM A5/1 and A5/2 “Voice Privacy” Encryption Algorithms
http://www.scard.org/gsm/a51.html
4. A New Version of the Stream Cipher SNOW
5. Introduction to Finite Fields and Their Applications;Lidl,1986
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Research on encryption algorithms in terahertz communication systems;Eighth International Conference on Electronic Technology and Information Science (ICETIS 2023);2023-06-20
2. Computational Analysis of Interleaving PN-Sequences with Different Polynomials;Cryptography;2022-04-26
3. TWO-VARIABLE FUNCTION TO DESIGN INTERLEAVED SEQUENCES ON;Advances and Applications in Discrete Mathematics;2022-01-10
4. SOME METHODS TO DESIGN INTERLEAVED SEQUENCES OVER;JP Journal of Algebra, Number Theory and Applications;2022-01-01
5. Preliminary Analysis of Interleaving PN-Sequences;Computational Science and Its Applications – ICCSA 2021;2021