Interleaving Shifted Versions of a PN-Sequence
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.
2011 ◽
Vol E94-A
(7)
◽
pp. 1603-1607
Keyword(s):
2013 ◽
Vol E96.A
(5)
◽
pp. 997-1000
◽
Keyword(s):
2014 ◽
Vol 35
(1)
◽
pp. 74-79
Keyword(s):