scientific article; zbMATH DE number 1406791

zbMath0939.94562MaRDI QIDQ4940707

Shirlei Serconek, James L. Massey

Publication date: 1 March 2000

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

linear complexityBlahut's theoremnonlinear filterings of PN-sequences

Mathematics Subject Classification ID

Cryptography (94A60) Numerical methods for discrete and fast Fourier transforms (65T50)

Related Items (17)

On the linear complexity of the sequences generated by nonlinear filterings ⋮ Linear Complexity of Periodic Sequences: A General Theory ⋮ Linear complexity of second order PN_sequences addition with single order PN_sequence in nonlinear filter generator ⋮ The expected value of the joint linear complexity of periodic multisequences ⋮ Extended Games-Chan algorithm for the 2-adic complexity of FCSR-sequences. ⋮ On ideal \(t\)-tuple distribution of filtering de Bruijn sequence generators ⋮ Characteristic digit-sum sequences ⋮ Linear Span analysis of a set of periodic sequence generators ⋮ Attacks Against Filter Generators Exploiting Monomial Mappings ⋮ On the counting function of the lattice profile of periodic sequences ⋮ A wide family of nonlinear filter functions with a large linear span ⋮ Expansion and linear complexity of the coordinate sequences over Galois rings ⋮ On Independence and Sensitivity of Statistical Randomness Tests ⋮ Joint linear complexity of multisequences consisting of linear recurring sequences ⋮ Factorization of determinants over finite fields and application in stream ciphers ⋮ The expectation and variance of the joint linear complexity of random periodic multisequences ⋮ Linear complexity, \(k\)-error linear complexity, and the discrete Fourier transform

This page was built for publication: