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):
Displaying 17 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)
- On the \(\mathbb{F}_2\)-linear relations of Mersenne Twister pseudorandom number generators (Q2229848) (← links)
- Additive character sums of polynomial quotients (Q2869127) (← links)
- Linear complexity of pseudorandom sequences based on summation of polynomial quotients (Q2927306) (← links)
- Structure of Pseudorandom Numbers Derived from Fermat Quotients (Q3578466) (← links)
- (Q4453520) (← links)
- On the k-error linear complexity of binary sequences derived from polynomial quotients (Q5046474) (← links)
- Polynomial quotients: Interpolation, value sets and Waring's problem (Q5500820) (← links)
- Linear Complexity of Binary Threshold Sequences Derived from Generalized Polynomial Quotient with Prime-Power Modulus (Q5859634) (← links)
- On the correlation measures of orders \(3\) and \(4\) of binary sequence of period \(p^2\) derived from Fermat quotients (Q6112254) (← links)
- (Q6118308) (← links)
