Measuring Ciphertext Randmoness Using Die Hard Randomness Index

Abstract

In this paper we present a novel quantitative measure of randomness based on Diehard randomness tests. The proposed method relies on the results of diehard tests in calculating a randomness index; namely Diehard Randomness Index (DRI). The presented index can be helpful in measuring randomness in bit sequences generated from pseudo-random and random number generators to identify which has better randomness properties. The paper also show sample calculations of the proposed index to measure randomness of ciphertext resulting from encryption using block-ciphers.