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

DOI10.1007/S11424-019-8072-9MaRDI QIDQ2179656zbMATH OpenOpenAlexWikidataFDO

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

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)

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

Cites work

• scientific article; zbMATH DE number 6900645 (Why is no real title available?)
• scientific article; zbMATH DE number 6900646 (Why is no real title available?)
• scientific article; zbMATH DE number 3422259 (Why is no real title available?)
• A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
• A surprisingly simple de Bruijn sequence construction
• Construction for de Bruijn sequences with large stage
• Construction of de Bruijn Sequences From LFSRs With Reducible Characteristic Polynomials
• Construction of de Bruijn sequences from product of two irreducible polynomials
• Further Results on the Decomposition of an NFSR Into the Cascade Connection of an NFSR Into an LFSR
• On affine sub-families of Grain-like structures
• On affine sub-families of the NFSR in grain
• On the Density of Irreducible NFSRs
• On the complexities of de-Bruijn sequences
• 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
• On the largest affine sub-families of a family of NFSR sequences
• Quark: a lightweight hash
• Stretching de Bruijn sequences
• There are no de Bruijn sequences of span \(n\) with complexity \(2^{n- 1}+n+1\)
• Trivium

Cited in

(5)

• Some conditions for absence of affine functions in NFSR output stream
• On affine sub-families of the NFSR in grain
• On the largest affine sub-families of a family of NFSR sequences
• A note on determine the greatest common subfamily of two NFSRs by Gröbner basis
• Further results on affine sub-families of NFSR sequences

Describes a project that uses

Uses Software

• Grain
• Quark

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)