New Constructions of Low Correlation Sequences with High Linear Complexity

Hai Xiong; Chao Li; Qingping Dai; Shaojing Fu

Paper 2012/161

New Constructions of Low Correlation Sequences with High Linear Complexity

Hai Xiong, Chao Li, Qingping Dai, and Shaojing Fu

Abstract

In this paper, we propose a new concept named similar-bent function and we present two general methods to construct balanced sequences with low correlation by using similar-bent functions and orthogonal similar-bent functions. We nd that the bent sequence sets are special cases of our construction. We also investigate the linear complexity of the new constructed sequences. If a suitable similar-bent function is given, the sequences constructed by it can have high linear complexity. As examples, we construct two new low correlation sequence sets. One constructed based on Dobbertin's iterative function is asymptotically optimal with respect to Welch's bound and the other one is constructed based on Kasami function whose sequences have a high linear complexity.

Metadata

Available format(s): PDF
Category: Applications
Publication info: Published elsewhere. Unknown where it was published
Keywords: similar-bent function low correlation binary sequence p-ary sequence
Contact author(s): xiong hai @ 163 com
History: 2012-03-28: received
Short URL: https://ia.cr/2012/161
License: CC BY

BibTeX

@misc{cryptoeprint:2012/161,
      author = {Hai Xiong and Chao Li and Qingping Dai and Shaojing Fu},
      title = {New Constructions of Low Correlation Sequences with High Linear Complexity},
      howpublished = {Cryptology ePrint Archive, Paper 2012/161},
      year = {2012},
      note = {\url{https://eprint.iacr.org/2012/161}},
      url = {https://eprint.iacr.org/2012/161}
}