Word-oriented transformation shift registers and their linear complexity
DOI10.1007/978-3-642-30615-0_18zbMATH Open1304.94026OpenAlexW43061790MaRDI QIDQ2907290FDOQ2907290
Authors: Sartaj Ul Hasan, Daniel Panario, Qiang Wang 
Publication date: 7 September 2012
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-30615-0_18
Recommendations
- Linear transformation shift registers
- Primitive transformation shift registers over finite fields
- Efficient linear feedback shift registers with maximal period
- On the number of irreducible linear transformation shift registers
- Primitive polynomials, Singer cycles and word-oriented linear feedback shift registers
linear complexitylinear feedback shift registerSinger cycletransformation shift registerLangford arrangementnonlinearly filtered primitive transformation shift register
Cited In (17)
- A note on the multiple-recursive matrix method for generating pseudorandom vectors
- Methods of construction of skew linear recurrent sequences with maximal period based on the Galois polynomials factorization in the ring of matrix polynomials
- Enumeration of linear transformation shift registers
- An Equivalence-Preserving Transformation of Shift Registers
- Investigating results and performance of search and construction algorithms for word-based LFSRs, \(\sigma\)-LFSRs
- Representations of skew linear recurrent sequences of maximal period over finite field;Представления скрученных линейных рекуррентных последовательностей максимального периода над конечным полем
- New representaions of elements of skew linear recurrent sequences via trace function based on the noncommutative Hamilton-Cayley theorem
- Linear transformation shift registers
- Skew \(\sigma\)-splittable linear recurrent sequences with maximal period
- Primitive transformation shift registers over finite fields
- Nonlinear vectorial primitive recursive sequences
- On the frequency of symbols in sequences generated by nonlinear feedforward generators
- An asymptotic formula for the number of irreducible transformation shift registers
- Primitive polynomials, Singer cycles and word-oriented linear feedback shift registers
- Linear complexity of second order PN_sequences addition with single order PN_sequence in nonlinear filter generator
- Regular Transformations of Data Words Through Origin Information
- On the number of irreducible linear transformation shift registers
This page was built for publication: Word-oriented transformation shift registers and their linear complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2907290)
