Counting functions and expected values in the stability theory of stream ciphers

MaRDI QIDQ4330638zbMATH OpenFDO

Authors Harald Niederreiter, Heike Paschinger

Publication date 14 May 2002

zbMATH Keywords

linear complexitystability theory of stream ciphers

Mathematics Subject Classification ID

Random number generation in numerical analysis (65C10) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60)

Recommendations

• Counting functions and expected values for the \(k\)-error linear complexity
• The stability theory of stream ciphers
• Periodic sequences with maximal linear complexity and large \(k\)-error linear complexity
• Counting Functions for the k-Error Linear Complexity of 2 n -Periodic Binary Sequences
• Error linear complexity measures for multisequences

Cited in

(7)

• Joint linear complexity of multisequences consisting of linear recurring sequences
• Linear complexity, \(k\)-error linear complexity, and the discrete Fourier transform
• Counting functions and expected values for the \(k\)-error linear complexity
• The expectation and variance of the joint linear complexity of random periodic multisequences
• scientific article; zbMATH DE number 1559051 (Why is no real title available?)
• Asymptotic analysis on the normalized k-error linear complexity of binary sequences
• Error linear complexity measures for multisequences

This page was built for publication: Counting functions and expected values in the stability theory of stream ciphers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4330638)