Structure of Pseudorandom Numbers Derived from Fermat Quotients

DOI10.1007/978-3-642-13797-6_6zbMath1230.11092MaRDI QIDQ3578466

No author found.

Publication date: 20 July 2010

Published in: Arithmetic of Finite Fields (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-13797-6_6

Mathematics Subject Classification ID

94A60: Cryptography

11T23: Exponential sums

65C10: Random number generation in numerical analysis

11A07: Congruences; primitive roots; residue systems

11K45: Pseudo-random numbers; Monte Carlo methods

Related Items

On the k-error linear complexity of binary sequences derived from polynomial quotients, On the value set of Fermat 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, Unnamed Item, On the correlation measures of orders \(3\) and \(4\) of binary sequence of period \(p^2\) derived from Fermat quotients, An extension of binary threshold sequences from Fermat quotients, The arithmetic of Carmichael quotients, 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, Multiplicative character sums of Fermat quotients and pseudorandom sequences, Boolean functions derived from Fermat quotients, Trace representation of pseudorandom binary sequences derived from Euler quotients, 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 error linear complexity of new generalized cyclotomic binary sequences of period \(p^2\), Hamming correlation of higher order, On the linear complexity of binary threshold sequences derived from Fermat quotients, Correlation measure, linear complexity and maximum order complexity for families of binary sequences, Additive character sums of polynomial quotients, BOUNDS OF MULTIPLICATIVE CHARACTER SUMS WITH FERMAT QUOTIENTS OF PRIMES