Efficient, perfect polynomial random number generators
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 4182680
- On the statistical independence of nonlinear congruential pseudorandom numbers
- Statistical independence of nonlinear congruential pseudorandom numbers
- Remarks on nonlinear congruential pseudorandom numbers
- On the adequacy of pseudy-random number generators (or: How big a period do we need?)
Cites work
- scientific article; zbMATH DE number 3960854 (Why is no real title available?)
- scientific article; zbMATH DE number 3750146 (Why is no real title available?)
- scientific article; zbMATH DE number 4182680 (Why is no real title available?)
- A Fast Monte-Carlo Test for Primality
- A Simple Unpredictable Pseudo-Random Number Generator
- How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
- RSA and Rabin Functions: Certain Parts are as Hard as the Whole
- Statistical independence of nonlinear congruential pseudorandom numbers
Cited in
(9)- Using irreducible polynomials for random number generation
- A note on local randomness in polynomial random number and random function generators
- scientific article; zbMATH DE number 4182680 (Why is no real title available?)
- An optimal random number generator on \({\mathbb{Z}}_ p\)
- Local Randomness in Polynomial Random Number and Random Function Generators
- scientific article; zbMATH DE number 4084824 (Why is no real title available?)
- scientific article; zbMATH DE number 1257071 (Why is no real title available?)
- On the possibility of a backdoor in the Micali-Schnorr generator
- On \(p\)-adic functions preserving Haar measure
This page was built for publication: Efficient, perfect polynomial random number generators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q809536)
