Analysis and design of stream ciphers
Analysis and design of stream ciphers
Interval and recency rank source coding: two on-line adaptive variable-length schemes
IEEE Transactions on Information Theory
A practical secure physical random bit generator
CCS '98 Proceedings of the 5th ACM conference on Computer and communications security
Spreading Codes Generator for Wireless CDMA Networks
Wireless Personal Communications: An International Journal
Cryptographic Randomness from Air Turbulence in Disk Drives
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
A Complexity-Theoretic Approach to the Design of Good Measures of Cryptographic Strength
Computer Aided Systems Theory - EUROCAST 2001-Revised Papers
NESSIE: A European Approach to Evaluate Cryptographic Algorithms
FSE '01 Revised Papers from the 8th International Workshop on Fast Software Encryption
New European Schemes for Signature, Integrity and Encryption (NESSIE): A Status Report
PKC '02 Proceedings of the 5th International Workshop on Practice and Theory in Public Key Cryptosystems: Public Key Cryptography
Statistical properties and implementation of aperiodic pseudorandom number generators
Applied Numerical Mathematics - Special issue: Applied numerical computing: Grid generation and solution methods for advanced simulations
The strict avalanche criterion randomness test
Mathematics and Computers in Simulation
Analysis of pseudo random sequences generated by cellular automata
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
Implementing disposable credit card numbers by mobile phones
Electronic Commerce Research
Hi-index | 0.01 |
A new statistical test for random bit generators is presented that is universal in the sense that any significant deviation of the output statistics from the statistics of a perfect random bit generator is detected with high probability when the defective generator can be modeled as an ergodic stationary source with finite memory. This is in contrast to most presently used statistical tests which can detect only one type of non-randomness, for example, a bias in the distribution of 0's and 1's or a correlation between consecutive bits. Moreover, the new test, whose formulation was motivated by considering the universal data compression algorithms of Elias and of Willems, measures the entropy per output bit of a generator. This is shown to be the correct quality measure for a random bit generator in cryptographic applications. A generator is thus rejected with high probability if and only if the cryptographic significance of a statistical defect is above a specified threshold. The test is easy to implement and very fast and thus well-suited for practical applications.