Article
Open Access
𝑘-error linear complexity over 𝔽p of subsequences of Sidelnikov sequences of period (pr – 1)/3
-
Nina Brandstätter
Published/Copyright:
January 20, 2010
Received: 2008-12-30
Revised: 2009-09-07
Published Online: 2010-01-20
Published in Print: 2009-September
© de Gruyter 2009
Articles in the same Issue
- Foreword. Second Workshop on Mathematical Cryptology
- Hybrid approach for solving multivariate systems over finite fields
- Cryptanalysing the critical group: efficiently solving Biggs's discrete logarithm problem
- Algebraic attack on NTRU using Witt vectors and Gröbner bases
- 𝑘-error linear complexity over 𝔽p of subsequences of Sidelnikov sequences of period (pr – 1)/3
- Some remarks on FCSRs and implications for stream ciphers
- On solving norm equations in global function fields
- Numerical solvers and cryptanalysis
- On the density of some special primes
Keywords for this article
Sidelnikov sequences;
linear complexity;
binomial coefficients modulo p;
character sums
Creative Commons
BY-NC-ND 3.0
Articles in the same Issue
- Foreword. Second Workshop on Mathematical Cryptology
- Hybrid approach for solving multivariate systems over finite fields
- Cryptanalysing the critical group: efficiently solving Biggs's discrete logarithm problem
- Algebraic attack on NTRU using Witt vectors and Gröbner bases
- 𝑘-error linear complexity over 𝔽p of subsequences of Sidelnikov sequences of period (pr – 1)/3
- Some remarks on FCSRs and implications for stream ciphers
- On solving norm equations in global function fields
- Numerical solvers and cryptanalysis
- On the density of some special primes
