Investigating results and performance of search and construction algorithms for word-based LFSRs, \(\sigma\)-LFSRs

DOI10.1016/j.dam.2018.01.010zbMath1422.94022OpenAlexW2795156683MaRDI QIDQ1752448

Vashek Matyas, Susil Kumar Bishoi

Publication date: 24 May 2018

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2018.01.010

zbMATH Keywords

primitive polynomialLFSR\(\sigma\)-LFSRxorshift random number generator

Mathematics Subject Classification ID

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

Related Items (2)

Shrinking generators based on \(\sigma \)-LFSRs ⋮ When lagged Fibonacci generators jump

Uses Software

• SOSEMANUK
• SNOW

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Primitive polynomials, Singer cycles and word-oriented linear feedback shift registers
• New stream cipher designs. The eSTREAM finalists
• Factorization of polynomials and some linear-algebra problems over finite fields
• The multiple-recursive matrix method for pseudorandom number generation
• Improved bounds in the multiple-recursive matrix method for pseudorandom number and vector generation
• A note on the multiple-recursive matrix method for generating pseudorandom vectors
• Word-Oriented Transformation Shift Registers and Their Linear Complexity
• Factorizations of 𝑏ⁿ±1, 𝑏=2, 3, 5, 6, 7, 10, 11, 12 Up to High Powers
• Pseudorandom Vector Generation by the Multiple-Recursive Matrix Method

This page was built for publication: Investigating results and performance of search and construction algorithms for word-based LFSRs, \(\sigma\)-LFSRs