Structure of Pseudorandom Numbers Derived from Fermat Quotients

DOI10.1007/978-3-642-13797-6_6zbMATH Open1230.11092OpenAlexW1567281213MaRDI QIDQ3578466FDOQ3578466

Authors:

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

Recommendations

Pseudorandomness and dynamics of Fermat quotients
Pseudo-random subsets constructed by using Fermat quotients
On the distribution of pseudorandom numbers and vectors derived from Euler-Fermat quotients
Multiplicative character sums of Fermat quotients and pseudorandom sequences
Linear complexity of pseudorandom sequences generated by Fermat quotients and their generalizations
On the lattice structure of pseudorandom numbers generated over arbitrary finite fields
scientific article; zbMATH DE number 426145
The lattice structure of nonlinear congruential pseudorandom numbers
On the discrepancy of quadratic congruential pseudorandom numbers

Random number generation in numerical analysis (65C10) Cryptography (94A60) Congruences; primitive roots; residue systems (11A07) Pseudo-random numbers; Monte Carlo methods (11K45) Exponential sums (11T23)

Cited In (25)

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
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
Pseudo-random subsets constructed by using 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
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
The arithmetic of Carmichael quotients
On the value set of Fermat quotients
Linear complexity of binary sequences derived from Euler quotients with prime-power modulus
Multiplicative character sums of Fermat quotients and pseudorandom sequences
Uniform Distribution of Fractional Parts Related to Pseudoprimes
Correlation measure, linear complexity and maximum order complexity for families of binary sequences
Additive character sums of polynomial quotients
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
Bounds of multiplicative character sums with Fermat quotients of primes
Pseudorandomness and dynamics of Fermat quotients
On the linear complexity of binary threshold sequences derived from Fermat quotients

This page was built for publication: Structure of Pseudorandom Numbers Derived from Fermat Quotients

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3578466)