Pages that link to "Item:Q437681"
From MaRDI portal
The following pages link to Linear complexity of pseudorandom sequences generated by Fermat quotients and their generalizations (Q437681):
Displayed 9 items.
- Computing discrete logarithms using \(\mathcal{O}((\log q)^2)\) operations from \(\{+,-,\times,\div,\&\}\) (Q338831) (← links)
- An extension of binary threshold sequences from Fermat quotients (Q340165) (← links)
- Linear complexity of binary sequences derived from Euler quotients with prime-power modulus (Q436622) (← links)
- Trace representation of pseudorandom binary sequences derived from Euler quotients (Q893348) (← links)
- Trace representation and linear complexity of binary sequences derived from Fermat quotients (Q1616173) (← links)
- On error linear complexity of new generalized cyclotomic binary sequences of period \(p^2\) (Q1721930) (← links)
- On the linear complexity of binary threshold sequences derived from Fermat quotients (Q1949234) (← links)
- Additive character sums of polynomial quotients (Q2869127) (← links)
- Polynomial quotients: Interpolation, value sets and Waring's problem (Q5500820) (← links)