Linear complexity of the x^2 p orbits
From MaRDI portal
Publication:294691
Recommendations
- Linear complexity of generalized cyclotomic sequences of period \(2p^m\)
- The linear complexity of generalized cyclotomic sequences with period \(2p^n\)
- Linear complexity of generalized cyclotomic binary sequences of order 2d and length 2p^m
- Linear complexity of generalized cyclotomic binary sequences of length \(2p^{m}\)
- Linear complexity of generalized cyclotomic binary sequences of period \(pq\)
- Linear complexity of generalized cyclotomic sequences with period 2ᵐp^n
- Linear Complexity of New Generalized Cyclotomic Sequences of Order Two of Length<tex>$pq$</tex>
- Linear complexity of generalized cyclotomic sequences with period \(p^nq^m\)
- Linear Complexity of Some Generalized Cyclotomic Sequences
- On the linear complexity of generalized cyclotomic sequences with the period \(p^m\)
Cites work
- A Simple Unpredictable Pseudo-Random Number Generator
- An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial Information
- How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
- scientific article; zbMATH DE number 3882549 (Why is no real title available?)
- scientific article; zbMATH DE number 53679 (Why is no real title available?)
- scientific article; zbMATH DE number 1455086 (Why is no real title available?)
- scientific article; zbMATH DE number 4182680 (Why is no real title available?)
- Linear Complexity and Random Sequences
- Maximum cycles of quadratic functions in \(\text{GF}(2^ n)\)
- Probabilistic encryption
This page was built for publication: Linear complexity of the \(x^{2} \bmod p\) orbits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q294691)
