Pages that link to "Item:Q5429114"
From MaRDI portal
The following pages link to Progress in Cryptology - INDOCRYPT 2003 (Q5429114):
Displayed 28 items.
- The minimal polynomial of a sequence obtained from the componentwise linear transformation of a linear recurring sequence (Q410701) (← links)
- The independence of two randomness properties of sequences over finite fields (Q413465) (← links)
- Multiplicative character sums of Fermat quotients and pseudorandom sequences (Q452834) (← links)
- On the pseudorandomness of binary and quaternary sequences linked by the Gray mapping (Q532107) (← links)
- On the joint linear complexity profile of explicit inversive multisequences (Q558009) (← links)
- Improved results on periodic multisequences with large error linear complexity (Q609363) (← links)
- Linear complexity profile of \(m\)-ary pseudorandom sequences with small correlation measure (Q633044) (← links)
- Asymptotic analysis on the normalized \(k\)-error linear complexity of binary sequences (Q664386) (← links)
- On the linear complexity of the Naor-Reingold sequence with elliptic curves (Q708437) (← links)
- On the \(k\)-error linear complexity over \({\mathbb F}_p\) of Legendre and Sidelnikov sequences (Q851764) (← links)
- The asymptotic behavior of the joint linear complexity profile of multisequences (Q877184) (← links)
- Error linear complexity measures for multisequences (Q883329) (← links)
- On the linear complexity of Sidel'nikov sequences over nonprime fields (Q958251) (← links)
- Enumeration results on the joint linear complexity of multisequences (Q998652) (← links)
- Reducing the calculation of the linear complexity of \(u_2^v\)-periodic binary sequences to Games-Chan algorithm (Q1008964) (← links)
- Periodic multisequences with large error linear complexity (Q1009057) (← links)
- Remarks on a cyclotomic sequence (Q1009130) (← links)
- Joint linear complexity of multisequences consisting of linear recurring sequences (Q1032485) (← links)
- The minimal polynomial over \(\mathbb F_q\) of linear recurring sequence over \(\mathbb F_{q^m}\) (Q1046471) (← links)
- Remarks on the \(k\)-error linear complexity of \(p^n\)-periodic sequences (Q2383994) (← links)
- Pseudo-randomness of certain sequences of \(k\) symbols with length \(pq\) (Q2434527) (← links)
- Addendum to Sidel'nikov sequences over nonprime fields (Q2450931) (← links)
- On the counting function of the lattice profile of periodic sequences (Q2465280) (← links)
- Enumeration results on linear complexity profiles and lattice profiles (Q2489145) (← links)
- On the linear complexity profile of nonlinear congruential pseudorandom number generators of higher orders (Q2573796) (← links)
- The expectation and variance of the joint linear complexity of random periodic multisequences (Q2577529) (← links)
- Construction of k-ary pseudorandom elliptic curve sequences (Q2887509) (← links)
- Remarks on the New Attack on the Filter Generator and the Role of High Order Complexity (Q5447517) (← links)