MORE ON THE SUM-PRODUCT PHENOMENON IN PRIME FIELDS AND ITS APPLICATIONS

DOI10.1142/S1793042105000108zbMath1173.11310OpenAlexW2158226503MaRDI QIDQ5316931

Publication date: 15 September 2005

Published in: International Journal of Number Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793042105000108

zbMATH Keywords

exponential sums sumsets Kloosterman sums expanders

Mathematics Subject Classification ID

Other combinatorial number theory (11B75) Exponential sums (11T23) Gauss and Kloosterman sums; generalizations (11L05)

Related Items

The constant of point-line incidence constructions ⋮ Estimation of weighted Kloosterman sums with the help of additive shift ⋮ On nonlinear Kloosterman sums ⋮ On the pinned distances problem in positive characteristic ⋮ Bounds on bilinear forms with Kloosterman sums ⋮ Extractors: low entropy requirements colliding with non-malleability ⋮ Generalized Kloosterman sum with primes ⋮ Improved computational extractors and their applications ⋮ Szemer\'{e}di-Trotter type results in arbitrary finite fields ⋮ Deterministic Randomness Extraction from Generalized and Distributed Santha-Vazirani Sources ⋮ Zero-Fixing Extractors for Sub-Logarithmic Entropy ⋮ From Affine to Two-Source Extractors via Approximate Duality ⋮ On the sum product estimates and two variables expanders ⋮ On thin sum-product bases ⋮ Local Correlation Breakers and Applications to Three-Source Extractors and Mergers ⋮ Conditional expanding bounds for two-variable functions over finite valuation rings ⋮ Combinatorial Nullstellensatz approach to polynomial expansion ⋮ An Efficient Reduction from Two-Source to Nonmalleable Extractors: Achieving Near-Logarithmic Min-Entropy ⋮ Extracting Computational Entropy and Learning Noisy Linear Functions ⋮ Some new results on higher energies ⋮ Elementary proof of an estimate for Kloosterman sums with primes ⋮ Kloosterman sums over primes of composite moduli ⋮ Kloosterman sums over smooth numbers ⋮ Interactive non-malleable codes ⋮ New estimate for a Kloosterman sum with primes for a composite modulus ⋮ On the concentration of points of polynomial maps and applications ⋮ 2-source dispersers for $n^{o(1)}$ entropy, and Ramsey graphs beating the Frankl-Wilson construction ⋮ On the growth rate in SL2(Fp)${\rm SL_2}(\mathbb {F}_p)$, the affine group and sum‐product type implications ⋮ Multilinear formulas, maximal-partition discrepancy and mixed-sources extractors ⋮ Some remarks on the asymmetric sum-product phenomenon ⋮ Modular hyperbolas ⋮ Deterministic Randomness Extraction from Generalized and Distributed Santha--Vazirani Sources ⋮ Divisors of a quadratic form with primes ⋮ Rainbow connections of graphs: a survey ⋮ New estimate for Kloosterman sums with primes ⋮ Unnamed Item ⋮ Popular products and continued fractions ⋮ The sum-product estimate for large subsets of prime fields ⋮ Unnamed Item ⋮ New results for the growth of sets of real numbers ⋮ On popular sums and differences for sets with small multiplicative doubling ⋮ Some remarks on multilinear exponential sums with an application ⋮ Weak derandomization of weak algorithms: explicit versions of Yao's lemma ⋮ Bounds of some double exponential sums ⋮ ON ITERATED PRODUCT SETS WITH SHIFTS ⋮ Estimation of Kloosterman sums with primes and its application ⋮ On monochromatic solutions of some nonlinear equations in $\mathbb Z/p\mathbb Z$ ⋮ On congruences with products of variables from short intervals and applications ⋮ On products of primes and almost primes in arithmetic progressions ⋮ Increasing the Output Length of Zero-Error Dispersers ⋮ On a certain sum-product estimate in fields of prime order ⋮ Deterministic extractors for small-space sources ⋮ On asymptotic formulae in some sum–product questions ⋮ Kloosterman sums with primes and solvability of a congruence with inverse residues ⋮ Differences of subgroups in subgroups ⋮ On some applications of GCD sums to arithmetic combinatorics ⋮ Sum-product theorems and incidence geometry ⋮ On the structure of the spectrum of small sets ⋮ Bilinear character sums over elliptic curves ⋮ An Introduction to Randomness Extractors ⋮ Fourier analysis and expanding phenomena in finite fields ⋮ Non-malleable coding against bit-wise and split-state tampering ⋮ Induced Ramsey-type theorems ⋮ Leakage-resilient coin tossing ⋮ Improving the Hadamard extractor ⋮ On Generating Independent Random Strings ⋮ A modular Szemerédi-Trotter theorem for hyperbolas ⋮ Algebraic methods in sum-product phenomena ⋮ Sums and products along sparse graphs ⋮ Rainbow paths ⋮ On the size of the set $A(A + 1)$ ⋮ Post-challenge leakage in public-key encryption ⋮ EXPANSION OF ORBITS OF SOME DYNAMICAL SYSTEMS OVER FINITE FIELDS ⋮ On a variant of sum-product estimates and explicit exponential sum bounds in prime fields ⋮ Concentration of points on two and three dimensional modular hyperbolas and applications ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A note on the size of the set $A^2+A$ ⋮ Short Kloosterman sums with primes ⋮ Bounds of incomplete multiple Kloosterman sums ⋮ Conditional expanding bounds for two-variable functions over prime fields ⋮ Four-variable expanders over the prime fields ⋮ Algebraic trace functions over the primes ⋮ Extractors in Paley graphs: a random model ⋮ Extractors and Lower Bounds for Locally Samplable Sources ⋮ Kloosterman sums with multiplicative coefficients ⋮ Counting rectangles and an improved restriction estimate for the paraboloid in $F_p^3$ ⋮ Any small multiplicative subgroup is not a sumset ⋮ How to extract useful randomness from unreliable sources ⋮ Low error efficient computational extractors in the CRS model ⋮ Unnamed Item ⋮ The mother of all leakages: how to simulate noisy leakages via bounded leakage (almost) for free ⋮ AN EXPLICIT TWO‐SOURCE EXTRACTOR WITH MIN‐ENTROPY RATE NEAR ⋮ ON BILINEAR EXPONENTIAL AND CHARACTER SUMS WITH RECIPROCALS OF POLYNOMIALS ⋮ Bounds on Fixed Input/Output Length Post-processing Functions for Biased Physical Random Number Generators ⋮ Asymmetric estimates and the sum-product problems ⋮ Explicit two-source extractors and resilient functions ⋮ МЕТОДЫ ОЦЕНОК КОРОТКИХ СУММ КЛООСТЕРМАНА ⋮ Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition ⋮ Two-Source Dispersers for Polylogarithmic Entropy and Improved Ramsey Graphs ⋮ EXPONENTIAL SUMS OVER POINTS OF ELLIPTIC CURVES WITH RECIPROCALS OF PRIMES ⋮ Increasing the output length of zero-error dispersers ⋮ Unnamed Item ⋮ From harmonic analysis to arithmetic combinatorics ⋮ Non-malleability against polynomial tampering

Cites Work