A new upper bound on the order of affine sub-families of NFSRs

DOI10.1007/S11424-019-8072-9zbMATH Open1456.94037OpenAlexW2997460180WikidataQ126460074 ScholiaQ126460074MaRDI QIDQ2179656FDOQ2179656

Authors: Qunxiong Zheng, Junying Liu, Dongdai Lin 

Publication date: 13 May 2020

Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11424-019-8072-9

Recommendations

• On the largest affine sub-families of a family of NFSR sequences
• On affine sub-families of the NFSR in grain
• Some conditions for absence of affine functions in NFSR output stream
• On the nonlinearity of maximum-length NFSR feedbacks
• A new result on irreducible NFSRs with respect to cascade connection

zbMATH Keywords

stream ciphersnonlinear feedback shift registersaffine sub-familiesfamilies of NFSR sequences

Mathematics Subject Classification ID

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

Cites Work

• Trivium
• Quark: a lightweight hash
• Title not available (Why is that?)
• A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
• On the complexities of de-Bruijn sequences
• A surprisingly simple de Bruijn sequence construction
• On affine sub-families of the NFSR in grain
• On the largest affine sub-families of a family of NFSR sequences
• Construction of de Bruijn Sequences From LFSRs With Reducible Characteristic Polynomials
• On the cycle structure of some nonlinear shift register sequences
• On affine sub-families of Grain-like structures
• Title not available (Why is that?)
• Construction of de Bruijn sequences from product of two irreducible polynomials
• Construction for de Bruijn sequences with large stage
• Further Results on the Decomposition of an NFSR Into the Cascade Connection of an NFSR Into an LFSR
• There are no de Bruijn sequences of span \(n\) with complexity \(2^{n- 1}+n+1\)
• On the Density of Irreducible NFSRs
• On the decomposition of an NFSR into the cascade connection of an NFSR into an LFSR
• Stretching de Bruijn sequences
• Title not available (Why is that?)

Cited In (1)

• On the largest affine sub-families of a family of NFSR sequences

Uses Software

• Quark
• Grain

This page was built for publication: A new upper bound on the order of affine sub-families of NFSRs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2179656)