A Scalable Method for Constructing Galois NLFSRs With Period $2^n-1$ Using Cross-Join Pairs

DOI10.1109/TIT.2012.2214204zbMath1364.94502MaRDI QIDQ2989498

Elena Dubrova

Publication date: 8 June 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Related Items (8)

Cryptanalysis of the class of maximum period Galois NLFSR-based stream ciphers ⋮ Construction for de Bruijn sequences with large stage ⋮ Generation of full cycles by a composition of NLFSRs ⋮ A method for analyzing repetitive pseudorandom sequences by the criterion of Markov chain entropy ⋮ Construction of de Bruijn sequences from product of two irreducible polynomials ⋮ Searching for nonlinear feedback shift registers with parallel computing ⋮ Espresso: a stream cipher for 5G wireless communication systems ⋮ A new linearization method for nonlinear feedback shift registers

This page was built for publication: A Scalable Method for Constructing Galois NLFSRs With Period $2^n-1$ Using Cross-Join Pairs