Title :
Sequences With High Nonlinear Complexity
Author :
Niederreiter, Harald ; Chaoping Xing
Author_Institution :
Johann Radon Inst. for Comput. & Appl. Math., Linz, Austria
Abstract :
We improve lower bounds on the k th-order nonlinear complexity of pseudorandom sequences over finite fields, including explicit inversive sequences and sequences obtained from Hermitian function fields, and we establish a probabilistic result on the behavior of the k th-order nonlinear complexity of random sequences over finite fields.
Keywords :
cryptography; probability; random sequences; Hermitian function fields; explicit inversive sequences; finite fields; maximum order complexity; nonlinear complexity; pseudorandom sequences; Complexity theory; Cryptography; Educational institutions; Generators; Polynomials; Probabilistic logic; Random sequences; Linear complexity; maximum-order complexity; nonlinear complexity; pseudorandom sequence;
Journal_Title :
Information Theory, IEEE Transactions on
DOI :
10.1109/TIT.2014.2343225
