Generation of full cycles by a composition of NLFSRs
From MaRDI portal
Publication:398953
DOI10.1007/s10623-014-9947-3zbMath1335.94023MaRDI QIDQ398953
Publication date: 18 August 2014
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-014-9947-3
94A55: Shift register sequences and sequences over finite alphabets in information and communication theory
94A60: Cryptography
68P25: Data encryption (aspects in computer science)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A class of nonlinear de Bruijn cycles
- A Scalable Method for Constructing Galois NLFSRs With Period $2^n-1$ Using Cross-Join Pairs
- Algorithms for the generation of full-length shift- register sequences
- Shift Register Sequences – A Retrospective Account
- A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
- The number of cross-join pairs in maximum length linear sequences
- An efficient implementation of the D-homomorphism for generation of de Bruijn sequences
- A Computational Scheme Based on Random Boolean Networks
- Shift-register synthesis and BCH decoding