EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
On finding primitive roots in finite fields
Theoretical Computer Science - Special issue on complexity theory and the theory of algorithms as developed in the CIS
Permutation polynomials, de Bruijn sequences, and linear complexity
Journal of Combinatorial Theory Series A
On the p-Divisibility of Fermat quotients
Mathematics of Computation
Handbook of Applied Cryptography
Handbook of Applied Cryptography
Modern Computer Algebra
On the linear complexity profile of some new explicit inversive pseudorandom numbers
Journal of Complexity - Special issue on coding and cryptography
Cryptographic Hash Functions from Expander Graphs
Journal of Cryptology
Structure of pseudorandom numbers derived from fermat quotients
WAIFI'10 Proceedings of the Third international conference on Arithmetic of finite fields
Boolean functions derived from Fermat quotients
Cryptography and Communications
Linear complexity of pseudorandom sequences generated by Fermat quotients and their generalizations
Information Processing Letters
Linear complexity of binary sequences derived from Euler quotients with prime-power modulus
Information Processing Letters
Linear complexity of binary sequences derived from polynomial quotients
SETA'12 Proceedings of the 7th international conference on Sequences and Their Applications
On the linear complexity of binary threshold sequences derived from Fermat quotients
Designs, Codes and Cryptography
Hi-index | 0.00 |
We obtain some theoretical and experimental results concerning various properties (the number of fixed points, image distribution, cycle lengths) of the dynamical system naturally associated with Fermat quotients acting on the set $\{0,\dots,p-1\}$. In particular, we improve the lower bound of Vandiver [Bull. Amer. Math. Soc., 22 (1915), pp. 61-67] on the image size of Fermat quotients on the above set (from $p^{1/2}-1$ to $(1+o(1))p(\log p)^{-2}$). We also consider pseudorandom properties of Fermat quotients such as uniform distribution and linear complexity.