Linear Complexity of Periodic Sequences: A General Theory

DOI10.1007/3-540-68697-5_27zbMath1329.94047OpenAlexW1601090496MaRDI QIDQ3452366

Shirlei Serconek, James L. Massey

Publication date: 11 November 2015

Published in: Advances in Cryptology — CRYPTO ’96 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-68697-5_27

zbMATH Keywords

Hadamard productstream ciphersdiscrete Fourier transformlinear complexityDFThyperderivativeGames-Chan algorithmHasse derivative

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60) Numerical methods for discrete and fast Fourier transforms (65T50)

Related Items (9)

The expected value of the joint linear complexity of periodic multisequences ⋮ On the structure of repeated-root polycyclic codes over local rings ⋮ The linear complexity of binary sequences of length \(2p\) with optimal three-level autocorrelation ⋮ Two-dimensional generalized discrete Fourier transform and related quasi-cyclic Reed--Solomon codes ⋮ A family of keystream generators with large linear complexity ⋮ On the algebraic structure of quasi-cyclic codes. IV: Repeated roots ⋮ 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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Analysis and design of stream ciphers
• On evaluating the linear complexity of a sequence of least period \(2^ n\)
• A fast algorithm for determining the complexity of a binary sequence with period<tex>2^n</tex>(Corresp.)
• An analysis of the structure and complexity of nonlinear binary sequence generators
• A generalisation of the discrete Fourier transform: determining the minimal polynomial of a periodic sequence
• On repeated-root cyclic codes
• Theorie der höheren Differentiale in einem algebraischen Funktionenkörper mit vollkommenem Konstantenkörper bei beliebiger Charakteristik.
• Differentialrechnung bei Charakteristik p.

This page was built for publication: Linear Complexity of Periodic Sequences: A General Theory