Novel way to research nonlinear feedback shift register

DOI10.1007/S11432-013-5058-4zbMath1425.94044OpenAlexW2068773548WikidataQ57631834 ScholiaQ57631834MaRDI QIDQ2335934

Lixiang Li, Haipeng Peng, Yi-Xian Yang, Da-wei Zhao, Sili Hui

Publication date: 18 November 2019

Published in: Science China. Information Sciences (Search for Journal in Brave)

Full work available at URL: http://engine.scichina.com/doi/10.1007/s11432-013-5058-4

zbMATH Keywords

Boolean networksemi-tensor productbinary sequencenonlinear feedback shift registerfull-length \(n\) NLFSR

Mathematics Subject Classification ID

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

Related Items (9)

A novel method for reconstructing period with single input in NFSR ⋮ Isomorphism and equivalence of Galois nonlinear feedback shift registers ⋮ Linearization of multi-valued nonlinear feedback shift registers ⋮ The transformation between the Galois NLFSRs and the Fibonacci NLFSRs via semi-tensor product of matrices ⋮ Topologies on quotient space of matrices via semi‐tensor product ⋮ STP-LWE: A variant of learning with error for a flexible encryption ⋮ A new linearization method for nonlinear feedback shift registers ⋮ Optimal output tracking of Boolean control networks ⋮ On Galois NFSRs equivalent to Fibonacci ones

Cites Work

• Unnamed Item
• Unnamed Item
• Improved multi-pass fast correlation attacks with applications
• Cryptographic properties and application of a generalized unbalanced Feistel network structure
• Controllability and observability of Boolean control networks
• Realization of Boolean control networks
• Analysis and control of Boolean networks. A semi-tensor product approach.
• Attacks on the RC4 stream cipher
• Semi-tensor product of matrices and its some applications to physics
• An efficient algorithm for the generation of DeBruijn cycles
• Security in Embedded Devices
• Results on the Nonlinear Span of Binary Sequences
• On the Quadratic Span of Binary Sequences
• On the Nonlinear Complexity and Lempel–Ziv Complexity of Finite Length Sequences
• On the linear complexity of functions of periodic GF(q) sequences
• Built-in test for circuits with scan based on reseeding of multiple-polynomial linear feedback shift registers
• Fast arithmetic for public-key algorithms in Galois fields with composite exponents
• A Linear Representation of Dynamics of Boolean Networks
• Disturbance Decoupling of Boolean Control Networks

This page was built for publication: Novel way to research nonlinear feedback shift register