Multiplicative character sums of Fermat quotients and pseudorandom sequences
From MaRDI portal
Publication:452834
DOI10.1007/s10998-012-3747-1zbMath1263.11110OpenAlexW2132474171MaRDI QIDQ452834
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
finite fieldscharacter sumslinear complexitydiscrete logarithmcorrelation measurepseudorandom sequencesFermat quotients
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Other character sums and Gauss sums (11T24) Well-distributed sequences and other variations (11K36) Pseudo-random numbers; Monte Carlo methods (11K45)
Related Items
Trace representation and linear complexity of binary sequences derived from Fermat quotients, On \(k\)-error linear complexity of pseudorandom binary sequences derived from Euler quotients, On the k-error linear complexity of binary sequences derived from polynomial quotients, On the correlation of families of pseudorandom sequences of $k$ symbols, An extension of binary threshold sequences from Fermat quotients, Trace representation of pseudorandom binary sequences derived from Euler quotients, On the correlation measures of orders \(3\) and \(4\) of binary sequence of period \(p^2\) derived from Fermat quotients, On the pseudorandom properties of \(k\)-ary Sidel'nikov sequences, On the linear complexity of binary threshold sequences derived from Fermat quotients, More constructions of pseudorandom sequences of \(k\) symbols, Linear complexity of binary sequences derived from Euler quotients with prime-power modulus, Linear complexity of pseudorandom sequences generated by Fermat quotients and their generalizations, Unnamed Item, On error linear complexity of new generalized cyclotomic binary sequences of period \(p^2\), On the value set of Fermat 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, Polynomial quotients: Interpolation, value sets and Waring's problem, Linear Complexity of Binary Threshold Sequences Derived from Generalized Polynomial Quotient with Prime-Power Modulus, Additive character sums of polynomial quotients, More constructions of pseudorandom lattices of \(k\) symbols
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear complexity profile of \(m\)-ary pseudorandom sequences with small correlation measure
- Boolean functions derived from Fermat quotients
- Cryptographic applications of analytic number theory. Complexity lower bounds and pseudo\-randomness
- On finite pseudorandom sequences of \(k\) symbols.
- 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
- On finite pseudorandom binary sequences I: Measure of pseudorandomness, the Legendre symbol
- Progress in Cryptology - INDOCRYPT 2003
