Linear complexity of pseudorandom sequences generated by Fermat quotients and their generalizations
From MaRDI portal
Publication:437681
DOI10.1016/j.ipl.2011.11.017zbMath1242.94023MaRDI QIDQ437681
Publication date: 18 July 2012
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2011.11.017
finite fields; cryptography; linear complexity; pseudorandom sequences; Fermat quotients; polynomial quotients
11T71: Algebraic coding theory; cryptography (number-theoretic aspects)
94A60: Cryptography
11K45: Pseudo-random numbers; Monte Carlo methods
Related Items
Polynomial quotients: Interpolation, value sets and Waring's problem, Computing discrete logarithms using \(\mathcal{O}((\log q)^2)\) operations from \(\{+,-,\times,\div,\&\}\), An extension of binary threshold sequences from Fermat quotients, Linear complexity of binary sequences derived from Euler quotients with prime-power modulus, Trace representation of pseudorandom binary sequences derived from Euler quotients, Trace representation and linear complexity of binary sequences derived from Fermat quotients, On error linear complexity of new generalized cyclotomic binary sequences of period \(p^2\), On the linear complexity of binary threshold sequences derived from Fermat quotients, Additive character sums of polynomial quotients
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Multiplicative character sums of Fermat quotients and pseudorandom sequences
- A remark on Artin's conjecture
- On primes in arithmetic progression having a prescribed primitive root
- Theory of transformation groups of polynomials over \(\mathrm{GF}(2)\) with applications to linear shift register sequences
- Additive character sums of polynomial 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
- ARTIN'S CONJECTURE FOR PRIMITIVE ROOTS
- On the π-divisibility of Fermat quotients
- Solutions of the congruence π^{π-1}β‘1 (mod π^{π})
- On the value set of Fermat quotients