On a secure binary sequence generated by a quadratic polynomial on Z₂^n

MaRDI QIDQ3104094zbMATH OpenFDO

Authors Min Surp Rhee

Publication date 19 December 2011

zbMATH Keywords

\(n\)-bit wordsingle cycle propertyT-function

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Maximum cycles of quadratic functions in \(\text{GF}(2^ n)\)
• scientific article; zbMATH DE number 1455086
• Cryptographic properties of some binary generalized cyclotomic sequences with the length \(p^{2}\)
• On Binary Sequences from Recursions “modulo 2e” Made Non-Linear by the Bit-By-Bit “XOR” Function
• An algorithm for the k-error linear complexity of binary sequences with period 2/sup n/

Cited in

(3)

• An efficient binary sequence generator with cryptographic applications
• scientific article; zbMATH DE number 1990767 (Why is no real title available?)
• scientific article; zbMATH DE number 1455086 (Why is no real title available?)

This page was built for publication: On a secure binary sequence generated by a quadratic polynomial on \(\mathbb{Z}_{2^n}\)

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