On the nonlinearity of maximum-length NFSR feedbacks
From MaRDI portal
Publication:2376660
DOI10.1007/s12095-012-0067-5zbMath1285.94036OpenAlexW2076328323MaRDI QIDQ2376660
Publication date: 24 June 2013
Published in: Cryptography and Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12095-012-0067-5
Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60) Data encryption (aspects in computer science) (68P25)
Related Items (5)
Further results on the nonlinearity of maximum-length NFSR feedbacks ⋮ Nonsingular Polynomials from Feedback Shift Registers ⋮ A new linearization method for nonlinear feedback shift registers ⋮ Constructing de Bruijn Sequences Based on a New Necessary Condition ⋮ Longest subsequences shared by two de Bruijn sequences
Uses Software
Cites Work
- On the distribution of de Bruijn sequences of given complexity
- A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
- The number of cross-join pairs in maximum length linear sequences
- On the (Im)Possibility of Practical and Secure Nonlinear Filters and Combiners
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the nonlinearity of maximum-length NFSR feedbacks