scientific article; zbMATH DE number 1455086

MaRDI QIDQ4484881zbMATH OpenFDO

Authors Cunsheng Ding

Publication date 5 June 2000

zbMATH Keywords

linear complexitynumber theoryperiodic sequencesstabilitystream ciphers

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 1196713
• Linear complexity of binary generalized cyclotomic sequences over \(\mathrm{GF}(q)\)
• Linear complexity of binary cyclotomic sequences of order 6
• On a secure binary sequence generated by a quadratic polynomial on \(\mathbb{Z}_{2^n}\)

Cited in

(16)

• Linear complexity of generalized cyclotomic binary sequences of order 2
• New generalized cyclotomy and its applications
• New generalized cyclotomic binary sequences of period \(p^2\)
• Highly nonlinear mappings
• Linear complexity of generalized cyclotomic sequences of period \(2p^m\)
• Sequences related to Legendre/Jacobi sequences
• On cyclotomic generator of order \(r\).
• Linear complexity of the \(x^{2} \bmod p\) orbits
• Generalized cyclotomic numbers of order two and their applications
• On a secure binary sequence generated by a quadratic polynomial on \(\mathbb{Z}_{2^n}\)
• scientific article; zbMATH DE number 1196713 (Why is no real title available?)
• \textsc{TWOPRIME}: a fast stream ciphering algorithm
• The linear complexity problem of a binary Jacobi sequence
• Cyclic codes with generalized cyclotomic cubic classes
• Generating the normal periodic sequences on the base of cyclically minimal numbers
• Linear complexity of Ding generalized cyclotomic sequences

This page was built for publication:

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