Structure of Pseudorandom Numbers Derived from Fermat Quotients
From MaRDI portal
Publication:3578466
DOI10.1007/978-3-642-13797-6_6zbMath1230.11092OpenAlexW1567281213MaRDI 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
Cryptography (94A60) Exponential sums (11T23) Random number generation in numerical analysis (65C10) Congruences; primitive roots; residue systems (11A07) Pseudo-random numbers; Monte Carlo methods (11K45)
Related Items (21)
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 ⋮ An extension of binary threshold sequences from Fermat quotients ⋮ The arithmetic of Carmichael 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 linear complexity of binary threshold sequences derived from Fermat 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 ⋮ 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 ⋮ BOUNDS OF MULTIPLICATIVE CHARACTER SUMS WITH FERMAT QUOTIENTS OF PRIMES ⋮ Hamming correlation of higher order ⋮ Correlation measure, linear complexity and maximum order complexity for families of binary sequences ⋮ 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
This page was built for publication: Structure of Pseudorandom Numbers Derived from Fermat Quotients