Linear complexity of binary sequences derived from Euler quotients with prime-power modulus
From MaRDI portal
Publication:436622
DOI10.1016/j.ipl.2012.04.011zbMath1243.94026OpenAlexW2006668161MaRDI QIDQ436622
Publication date: 25 July 2012
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2012.04.011
Bernoulli and Euler numbers and polynomials (11B68) Cryptography (94A60) Pseudo-random numbers; Monte Carlo methods (11K45)
Related Items
Trace representation and linear complexity of binary sequences derived from Fermat quotients, On \(k\)-error linear complexity of pseudorandom binary sequences derived from Euler quotients, On the k-error linear complexity of binary sequences derived from polynomial quotients, An extension of binary threshold sequences from Fermat quotients, Trace representation of pseudorandom binary sequences derived from Euler quotients, On error linear complexity of new generalized cyclotomic binary sequences of period \(p^2\), Polynomial quotients: Interpolation, value sets and Waring's problem, Linear Complexity of Binary Threshold Sequences Derived from Generalized Polynomial Quotient with Prime-Power Modulus, Additive character sums of polynomial quotients
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear complexity of pseudorandom sequences generated by Fermat quotients and their generalizations
- Multiplicative character sums of Fermat quotients and pseudorandom sequences
- Fermat quotients for composite moduli
- ON THE DISTRIBUTION OF PSEUDORANDOM NUMBERS AND VECTORS DERIVED FROM EULER–FERMAT QUOTIENTS
- BOUNDS OF MULTIPLICATIVE CHARACTER SUMS WITH FERMAT QUOTIENTS OF PRIMES
- Pseudorandomness and Dynamics of Fermat Quotients
- CHARACTER SUMS WITH FERMAT QUOTIENTS
- Fermat quotients: exponential sums, value set and primitive roots
- Structure of Pseudorandom Numbers Derived from Fermat Quotients
- On the 𝑝-divisibility of Fermat quotients
- Solutions of the congruence 𝑎^{𝑝-1}≡1 (mod 𝑝^{𝑟})
- On the value set of Fermat quotients
- Shift-register synthesis and BCH decoding
