A simple stream cipher with proven properties

DOI10.1007/s12095-011-0059-xzbMath1282.94065OpenAlexW2050978697WikidataQ121114946 ScholiaQ121114946MaRDI QIDQ1947647

Wenpei Si, Cunsheng Ding

Publication date: 23 April 2013

Published in: Cryptography and Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12095-011-0059-x

zbMATH Keywords

sequencescryptographystream cipherlinear span

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items

Binary cyclic codes from explicit polynomials over \(\mathrm{GF}(2^m)\), On algebraic immunity of trace inverse functions on finite fields of characteristic two, Optimal codes from Fibonacci polynomials and secret sharing schemes, Some cyclic codes from some monomials, A note on cyclic codes from APN functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nonlinearities of S-boxes
• An extension of TYT inversion algorithm in polynomial basis
• Analysis and design of stream ciphers
• A fast algorithm for computing multiplicative inverses in \(\text{GF}(2^ m)\) using normal bases
• The stability theory of stream ciphers
• Parallel Itoh-Tsujii multiplicative inversion algorithm for a special class of trinomials
• The weights of the orthogonals of the extended quadratic binary Goppa codes
• Upper Bounds on Algebraic Immunity of Boolean Power Functions
• Complex sequences over GF(p/sup M/) with a two-level autocorrelation function and a large linear span
• Lower bounds on the maximum cross correlation of signals (Corresp.)
• An algorithm for the k-error linear complexity of binary sequences with period 2/sup n/