Multiplicative character sums of Fermat quotients and pseudorandom sequences
DOI10.1007/S10998-012-3747-1zbMATH Open1263.11110OpenAlexW2132474171MaRDI QIDQ452834FDOQ452834
Authors: Domingo Gomez, Arne Winterhof 
Publication date: 17 September 2012
Published in: Periodica Mathematica Hungarica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10998-012-3747-1
Recommendations
discrete logarithmfinite fieldslinear complexitycharacter sumscorrelation measurepseudorandom sequencesFermat quotients
Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Well-distributed sequences and other variations (11K36) Pseudo-random numbers; Monte Carlo methods (11K45) Other character sums and Gauss sums (11T24)
Cites Work
- On finite pseudorandom binary sequences I: Measure of pseudorandomness, the Legendre symbol
- Title not available (Why is that?)
- Title not available (Why is that?)
- Linear complexity and related complexity measures
- Progress in Cryptology - INDOCRYPT 2003
- Linear complexity profile of binary sequences with small correlation measure
- On the distribution of pseudorandom numbers and vectors derived from Euler-Fermat quotients
- Pseudorandomness and dynamics of Fermat quotients
- Character sums with Fermat quotients
- Structure of Pseudorandom Numbers Derived from Fermat Quotients
- On the 𝑝-divisibility of Fermat quotients
- Linear complexity profile of \(m\)-ary pseudorandom sequences with small correlation measure
- Cryptographic applications of analytic number theory. Complexity lower bounds and pseudo\-randomness
- On finite pseudorandom sequences of \(k\) symbols.
- Boolean functions derived from Fermat quotients
Cited In (28)
- On error linear complexity of new generalized cyclotomic binary sequences of period \(p^2\)
- Linear complexity of binary threshold sequences derived from generalized polynomial quotient with prime-power modulus
- Polynomial quotients: Interpolation, value sets and Waring's problem
- On the correlation of families of pseudorandom sequences of \(k\) symbols
- Trace representation of pseudorandom binary sequences derived from Euler quotients
- Large families of pseudorandom binary sequences constructed by using Fermat quotients
- On the distribution of pseudorandom numbers and vectors derived from Euler-Fermat quotients
- On the pseudorandom properties of \(k\)-ary Sidel'nikov sequences
- Structure of Pseudorandom Numbers Derived from Fermat Quotients
- On the k-error linear complexity of binary sequences derived from polynomial quotients
- Boolean functions derived from Fermat quotients
- Hamming correlation of higher order
- Trace representation of the binary \(pq^2\)-periodic sequences derived from Euler quotients
- On \(k\)-error linear complexity of pseudorandom binary sequences derived from Euler quotients
- Linear complexity of pseudorandom sequences generated by Fermat quotients and their generalizations
- An extension of binary threshold sequences from Fermat quotients
- On the value set of Fermat quotients
- Linear complexity of binary sequences derived from Euler quotients with prime-power modulus
- Uniform Distribution of Fractional Parts Related to Pseudoprimes
- Additive character sums of polynomial quotients
- More constructions of pseudorandom lattices of \(k\) symbols
- On the correlation measures of orders \(3\) and \(4\) of binary sequence of period \(p^2\) derived from Fermat quotients
- Trace representation and linear complexity of binary sequences derived from Fermat quotients
- More constructions of pseudorandom sequences of \(k\) symbols
- Bounds of multiplicative character sums with Fermat quotients of primes
- Pseudorandomness and dynamics of Fermat quotients
- Character sums with Fermat quotients
- On the linear complexity of binary threshold sequences derived from Fermat quotients
This page was built for publication: Multiplicative character sums of Fermat quotients and pseudorandom sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q452834)
