On a secure binary sequence generated by a quadratic polynomial on Z₂^n
From MaRDI portal
Publication:3104094
Recommendations
- Maximum cycles of quadratic functions in \(\text{GF}(2^ n)\)
- Binary cyclotomic generators
- Cryptographic properties of some binary generalized cyclotomic sequences with the length \(p^{2}\)
- On binary sequences from recursions ``modulo \(2^e\) 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)
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)