Abstract:We obtain a series of estimates on the number of small integers and small order Farey fractions which belong to a given coset of a subgroup of order t of the group of units of the residue ring modulo a prime p, in the case when t is small compared to p. We give two applications of these results: to the simultaneous distribution of two high degree monomials x k1 and x k2 modulo p and to a question of J. Holden and P. Moree on fixed points of the discrete logarithm.
“…So our goal is to find a "small" set Y ⊆ F * q such that its shifts cannot be inside of any coset of G e (we note that the value of r is unknown). Questions about the distribution of cosets of multiplicative groups have been considered in a number of works and have numerous applications, see [33] and also [6,8,12,9,11,39,41,42] for several more recent results and applications to cryptographic and computational number theory problems.…”
We consider the problem of recovering a hidden element s of a finite field F q of q elements from queries to an oracle that for a given x ∈ F q returns (x + s) e for a given divisor e | q − 1. We use some techniques from additive combinatorics and analytic number theory that lead to more efficient algorithms than the naive interpolation algorithm, for example, they use substantially fewer queries to the oracle.
“…So our goal is to find a "small" set Y ⊆ F * q such that its shifts cannot be inside of any coset of G e (we note that the value of r is unknown). Questions about the distribution of cosets of multiplicative groups have been considered in a number of works and have numerous applications, see [33] and also [6,8,12,9,11,39,41,42] for several more recent results and applications to cryptographic and computational number theory problems.…”
We consider the problem of recovering a hidden element s of a finite field F q of q elements from queries to an oracle that for a given x ∈ F q returns (x + s) e for a given divisor e | q − 1. We use some techniques from additive combinatorics and analytic number theory that lead to more efficient algorithms than the naive interpolation algorithm, for example, they use substantially fewer queries to the oracle.
“…The quantity N p,g (k) for k = 1, 2, 3 has recently been studied in [5,6,12,18,21,22,23,27,31]. Fixed points with various restrictions on u have been considered as well.…”
We investigate the periodic structure of the exponential pseudorandom number generator obtained from the map x → g x (mod p) that acts on the set {1, . . . , p − 1}.2010 Mathematics Subject Classification. 11K45, 11T71, 94A60.
“…A related conjecture by Holden and Moree [236] states that one should have F (p) = (1 + o (1))p. Bourgain et al [44] showed that F (p) = p + O(p 4/5+ǫ ) for a set of primes p of relative density 1 and in a later paper, [45],…”
Abstract. One of the first concepts one meets in elementary number theory is that of the multiplicative order. We give a survey of the literature on this topic emphasizing the Artin primitive root conjecture (1927). The first part of the survey is intended for a rather general audience and rather colloquial, whereas the second part is intended for number theorists and ends with several open problems. The contributions in the survey on 'elliptic Artin' are due to Alina Cojocaru. Wojciec Gajda wrote a section on 'Artin for K-theory of number fields', and Hester Graves (together with me) on 'Artin's conjecture and Euclidean domains'.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.