On the largest affine sub-families of a family of NFSR sequences
From MaRDI portal
Publication:2439751
DOI10.1007/S10623-012-9723-1zbMATH Open1323.94096OpenAlexW2090600233MaRDI QIDQ2439751FDOQ2439751
Publication date: 17 March 2014
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-012-9723-1
Recommendations
- A new upper bound on the order of affine sub-families of NFSRs
- On affine sub-families of the NFSR in grain
- Some conditions for absence of affine functions in NFSR output stream
- On affine sub-families of Grain-like structures
- A note on determine the greatest common subfamily of two NFSRs by Gröbner basis
Cryptography (94A60) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
- New stream cipher designs. The eSTREAM finalists
- On the cycle structure of some nonlinear shift register sequences
- On the decomposition of an NFSR into the cascade connection of an NFSR into an LFSR
Cited In (8)
- Further results on the equivalence between Galois NFSRs and Fibonacci NFSRs
- On affine sub-families of the NFSR in grain
- A new linearization method for nonlinear feedback shift registers
- On a class of isomorphic NFSRs
- A new upper bound on the order of affine sub-families of NFSRs
- On affine sub-families of Grain-like structures
- The adjacency graphs of some feedback shift registers
- Further results on affine sub-families of NFSR sequences
Uses Software
This page was built for publication: On the largest affine sub-families of a family of NFSR sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2439751)
