2018/01/26 by Shidong Zhang, Zhang, Shidong, Tongjiang Yan +1
Computer Science · Engineering · #Coding theory and cryptography #Cryptographic Implementations and Security #Cryptography and Security (cs.CR) #FOS: Computer and information sciences #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.1801.08664
openalex publication_date 2018/01/26 · openalex created_date 2018/02/02 · openalex updated_date 2026/07/28
The autocorrelation and the linear complexity of a key stream sequence in a stream cipher are important cryptographic properties. Many sequences with these good properties have interleaved structure, three classes of binary sequences of period 4N with optimal autocorrelation values have been constructed by Tang and Gong based on interleaving certain kinds of sequences of period N. In this paper, we use the interleaving technique to construct a binary sequence with the optimal autocorrelation of period 2N, then we calculate its autocorrelation values and its distribution, and give a lower bound of linear complexity. Results show that these sequences have low autocorrelation and the linear complexity satisfies the requirements of cryptography.