scientific article; zbMATH DE number 1955778

zbMath1033.94508MaRDI QIDQ4417388

Shimin Wei, Guozhen Xiao

Publication date: 29 July 2003

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2551/25510012.htm

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

zbMATH Keywords

cryptographyfast algorithmminimal polynomiallinear complexityperiodic sequencek-error linear complexity

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60)

Related Items

Quadratic functions with prescribed spectra ⋮ Reducing the calculation of the linear complexity of \(u_2^v\)-periodic binary sequences to Games-Chan algorithm ⋮ How to determine linear complexity and \(k\)-error linear complexity in some classes of linear recurring sequences