Linear complexity of generalized sequences by comparison of PN-sequences
From MaRDI portal
Publication:2293241
Recommendations
- Linear complexity of generalized cyclotomic sequences with period 2ᵐp^n
- About computation of the linear complexity of generalized cyclotomic sequences with period \(p^{n+1}\)
- On the linear complexity of nonlinearly filtered pn-sequences
- Linear complexity of generalized cyclotomic binary sequences of length \(2p^{m}\)
- An algorithm for the k-error linear complexity of binary sequences with period 2/sup n/
Cites work
- Analysis of the generalized self-shrinking generator
- Binomial representation of cryptographic binary sequences and its relation to cellular automata
- Decimation of Periodic Sequences
- Discrete linear models for the generalized self-shrunken sequences
- Generalized Self-Shrinking Generator
- scientific article; zbMATH DE number 1024042 (Why is no real title available?)
- scientific article; zbMATH DE number 1088915 (Why is no real title available?)
- Modified self-shrinking generator
- New Guess-and-Determine Attack on the Self-Shrinking Generator
- Shift-register synthesis and BCH decoding
- Synthesis of cryptographic interleaved sequences by means of linear cellular automata
- The linear complexity of the self-shrinking generator
- Theory and applications of q-ary interleaved sequences
- Understanding Cryptography
Cited in
(5)- scientific article; zbMATH DE number 1972837 (Why is no real title available?)
- SOME METHODS TO DESIGN INTERLEAVED SEQUENCES OVER
- TWO-VARIABLE FUNCTION TO DESIGN INTERLEAVED SEQUENCES ON
- On binary linear codes and binary pseudo-random sequences
- A computational approach for the study of linear complexity of shrunken sequences
This page was built for publication: Linear complexity of generalized sequences by comparison of PN-sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2293241)
