A universal statistical test for random bit generators
Journal of Cryptology
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Inversive and linear congruential pseudorandom number generators in empirical tests
ACM Transactions on Modeling and Computer Simulation (TOMACS)
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator
ACM Transactions on Modeling and Computer Simulation (TOMACS) - Special issue on uniform random number generation
Monkeys, gambling, and return times: assessing pseudorandomness
Proceedings of the 31st conference on Winter simulation: Simulation---a bridge to the future - Volume 1
Beware of linear congruential generators with multipliers of the form a = ±2q ±2r
ACM Transactions on Mathematical Software (TOMS)
Getting rid of correlations among pseudorandom numbers: discarding versus tempering
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Gambling tests for pseudorandom number generators
Mathematics and Computers in Simulation - IMACS sponsored Special issue on the second IMACS seminar on Monte Carlo methods
Handbook of Applied Cryptography
Handbook of Applied Cryptography
The Design of Rijndael
Sparse Serial Tests of Uniformity for Random Number Generators
SIAM Journal on Scientific Computing
An Object-Oriented Random-Number Package with Many Long Streams and Substreams
Operations Research
Entropy estimators and serial tests for ergodic chains
IEEE Transactions on Information Theory
On synopses for distinct-value estimation under multiset operations
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
TestU01: A C library for empirical testing of random number generators
ACM Transactions on Mathematical Software (TOMS)
A Comprehensive Framework for Enhancing Security in InfiniBand Architecture
IEEE Transactions on Parallel and Distributed Systems
On Independence and Sensitivity of Statistical Randomness Tests
SETA '08 Proceedings of the 5th international conference on Sequences and Their Applications
PRNG based on new HCI devices entropy sources: Wii remote study case
Proceedings of the 2009 Euro American Conference on Telematics and Information Systems: New Opportunities to increase Digital Citizenship
A Reliable Architecture for Parallel Implementations of the Advanced Encryption Standard
Journal of Electronic Testing: Theory and Applications
A security framework for e-health service authentication and e-health data transmission
ISCIT'09 Proceedings of the 9th international conference on Communications and information technologies
Self-test techniques for crypto-devices
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Parallel random numbers: as easy as 1, 2, 3
Proceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis
| Hi-index | 0.00 |
AES, the Advanced Encryption Standard, is one of the most important algorithms in modern cryptography. Certain randomness properties of AES are of vital importance for its security. At the same time, these properties make AES an interesting candidate for a fast nonlinear random number generator for stochastic simulation. In this article, we address both of these two aspects of AES. We study the performance of AES in a series of statistical tests that are related to cryptographic notions like confusion and diffusion. At the same time, these tests provide empirical evidence for the suitability of AES in stochastic simulation. A substantial part of this article is devoted to the strategy behind our tests and to their relation to other important test statistics like Maurer's Universal Test.