Searching for nonlinear feedback shift registers with parallel computing

DOI10.1016/j.ipl.2013.12.002zbMath1302.94030OpenAlexW2041725868MaRDI QIDQ2446075

Janusz Szmidt, Tomasz Rachwalik, Przemysław Dąbrowski, Grzegorz Łabuzek

Publication date: 15 April 2014

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2013.12.002

zbMATH Keywords

parallel processingnonlinear feedback shift registersmaximum period

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Parallel algorithms in computer science (68W10)

Related Items (3)

A novel method for reconstructing period with single input in NFSR ⋮ Modified Alternating Step Generators with Non-Linear Scrambler ⋮ A new linearization method for nonlinear feedback shift registers

Cites Work

• A Scalable Method for Constructing Galois NLFSRs With Period $2^n-1$ Using Cross-Join Pairs
• On cross joining de Bruijn sequences
• On the cycle structure of some nonlinear shift register sequences
• Linear spans of modified de Bruijn sequences
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Searching for nonlinear feedback shift registers with parallel computing