Analysis of \((k_ 0,k_ 1)\) clock-controlled sequences

DOI10.1007/BF01195334zbMath0836.94015OpenAlexW2003311044MaRDI QIDQ1842605

Guozhen Xiao, Xian Liu

Publication date: 8 May 1996

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01195334

zbMATH Keywords

cryptographymaximal periodlinear shift-register sequencesmaximal linear complexitynets of feedback shift- registers

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)

Cites Work

• Unnamed Item
• FLIP: A method for adaptively zoned, particle-in-cell calculations of fluid flows in two dimensions
• Products of linear recurring sequences with maximum complexity
• Correlation-immunity of nonlinear combining functions for cryptographic applications (Corresp.)
• On the linear complexity of nonuniformity decimated PN-sequences
• Some randomness properties of cascaded sequences (Corresp.)
• Interlacing properties of shift-register sequences with generator polynomials irreducible over<tex>GF(p)</tex>(Corresp.)

This page was built for publication: Analysis of \((k_ 0,k_ 1)\) clock-controlled sequences