On the pseudo-randomness of subsets related to primitive roots
From MaRDI portal
Publication:1945263
DOI10.1007/S00493-010-2534-YzbMATH Open1259.11072OpenAlexW1967114965MaRDI QIDQ1945263FDOQ1945263
Authors: Cécile Dartyge, András Sárközy, Mihály Szalay
Publication date: 5 April 2013
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00493-010-2534-y
Recommendations
- On the pseudorandom properties of subsets constructed by using primitive roots
- On pseudo-random subsets of \({\mathbb{Z}}_n\)
- A note on pseudorandom subsets formed by generalized cyclotomic classes
- Pseudo-random subsets constructed by using Fermat quotients
- On pseudo-random subsets of the set of the integers not exceeding \(N\)
- Pseudorandom subsets with composite moduli
- Pseudorandom subsets formed by power residues with composite moduli
- On the distribution of consecutive primitive roots
- Quasi-random subsets of \(\mathbb{Z}_ n\)
- scientific article; zbMATH DE number 1354930
Congruences; primitive roots; residue systems (11A07) Pseudo-random numbers; Monte Carlo methods (11K45) Estimates on character sums (11L40)
Cites Work
- On finite pseudorandom binary sequences I: Measure of pseudorandomness, the Legendre symbol
- Construction of large families of pseudorandom binary sequences
- Equations over finite fields. An elementary approach
- On a pseudorandom property of binary sequences
- On large families of subsets of the set of the integers not exceeding \(N\)
- On a family of pseudorandom binary sequences
- On Character Sums and Primitive Roots†
- A finite pseudorandom binary sequence
- On pseudo-random subsets of the set of the integers not exceeding \(N\)
- Large families of pseudorandom subsets formed by power residues
- Character sums and primitive roots in finite fields
- Large Families of Pseudorandom Sequences of k Symbols and Their Complexity – Part I
- On the distribution of powers in finite fields.
- On the distribution of primitive roots mod p
- Additive patterns in a multiplicative group in a finite field
- On pseudo-random subsets of \({\mathbb{Z}}_n\)
- On the distribution of the primitive roots of a prime
- A note on the distribution of the primitive roots of a prime
- Title not available (Why is that?)
- Pairs of Consecutive Primitive Roots Modulo a Prime
- Primitive roots modulo a prime as consecutive terms of an arithmetic progression.
Cited In (10)
- On pseudo-random subsets of the set of the integers not exceeding \(N\)
- Pseudo-random subsets constructed by using Fermat quotients
- Balance and pattern distribution of sequences derived from pseudorandom subsets of \(\mathbb{Z}_q\)
- Gowers norms and pseudorandom measures of subsets
- On the symmetry measure of pseudorandom subsets
- On the pseudorandom properties of subsets constructed by using primitive roots
- On the correlation measures of subsets
- On pseudorandom subsets in finite fields. I: Measure of pseudorandomness and support of Boolean functions
- On the complexity of families of pseudo-random subsets
- On multi-dimensional pseudorandom subsets
This page was built for publication: On the pseudo-randomness of subsets related to primitive roots
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1945263)