An exhaustive analysis of multiplicative congruential random number generators with modulus 231-1
SIAM Journal on Scientific and Statistical Computing
Efficient and portable combined random number generators
Communications of the ACM
Random number generators: good ones are hard to find
Communications of the ACM
A design principle for hash functions
CRYPTO '89 Proceedings on Advances in cryptology
One way hash functions and DES
CRYPTO '89 Proceedings on Advances in cryptology
Maximally equidistributed combined Tausworthe generators
Mathematics of Computation
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Handbook of Applied Cryptography
Handbook of Applied Cryptography
Shift Register Sequences
A Construction of a Cioher From a Single Pseudorandom Permutation
ASIACRYPT '91 Proceedings of the International Conference on the Theory and Applications of Cryptology: Advances in Cryptology
A New Class of Invertible Mappings
CHES '02 Revised Papers from the 4th International Workshop on Cryptographic Hardware and Embedded Systems
Random number generators in secure disk drives
EURASIP Journal on Embedded Systems
SBAP: software-based attestation for peripherals
TRUST'10 Proceedings of the 3rd international conference on Trust and trustworthy computing
| Hi-index | 0.00 |
Many new small and fast pseudorandom number generators are presented, which pass the most common randomness tests. They perform only a few, nonmultiplicative operations for each generated number, use very little memory, therefore, they are ideal for embedded applications. We present general methods to ensure very long cycles and show, how to create super fast, very small ciphers and hash functions from them.