2011
DOI: 10.1137/100798466
|View full text |Cite
|
Sign up to set email alerts
|

Pseudorandomness and Dynamics of Fermat Quotients

Abstract: We obtain some theoretic 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, . . . , p − 1}. We also consider pseudorandom properties of Fermat quotients such as joint distribution and linear complexity.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
71
0
3

Year Published

2012
2012
2018
2018

Publication Types

Select...
4
3

Relationship

1
6

Authors

Journals

citations
Cited by 69 publications
(74 citation statements)
references
References 34 publications
0
71
0
3
Order By: Relevance
“…There are several results which involve the distribution and structure of Fermat quotients q p (u) modulo p and it has numerous applications in computational and algebraic number theory, see e.g. [8,10,11,21] and references therein.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…There are several results which involve the distribution and structure of Fermat quotients q p (u) modulo p and it has numerous applications in computational and algebraic number theory, see e.g. [8,10,11,21] and references therein.…”
Section: Introductionmentioning
confidence: 99%
“…If no lags coincide modulo p the same technique as in [21] works. However, there are some interesting twists in the other case.…”
mentioning
confidence: 99%
“…• discrepancy of Fermat quotients from [6], Theorems 18-19, • new bound for the size of the image of q(n), see [11], Theorem 1, • estimates for Ihara sum, [12], • better bounds for the sums…”
Section: Theorem 3 One Hasmentioning
confidence: 99%
“…Then |S(a)| ≪ p Heilbronn's exponential sum is connected (see e.g. [1], [2], [5], [6], [11], [12]) with so-called Fermat quotients defined as q(n) = n p−1 − 1 p , n = 0 (mod p) .…”
Section: Introductionmentioning
confidence: 99%
“…Например, Ленстра предположил, что 3. Оценки на могут иметь приложения в различных тео-ретико-числовых задачах [2], [3].…”
Section: ю н штейниковunclassified