New Constructions of Low Correlation Sequences With High Linear Complexity

In this paper, the authors propose a new concept named similar-bent function and they present two general methods to construct balanced sequences with low correlation by using similar-bent functions and orthogonal similar-bent functions. They find that the bent sequence sets are special cases of their construction. They 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, they 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.

Provided by: International Association for Cryptologic Research Topic: Security Date Added: Mar 2012 Format: PDF

Find By Topic