Searching for nonlinear feedback shift registers with parallel computing
The numerical verification of conjecture of Chan et al. (FSE?94) up to order n=29 n = 29 . Enumeration of all one term quadratic m -sequences up to order n=21 n = 21 . Finding new NLFSRs generating modified de Bruijn sequences up to order n=31 n = 31 . Application of parallel computing to the above search problems. Calculations of linear complexities of the found sequences up to order n=26 n = 26 .
nonlinear feedback shift registers maximum period parallel processing