Tag Archives: diehard

Paper: Testing Randomness in Ciphertext of Block-Ciphers Using DieHard Tests

ABSTRACT One of the important aspects of the security of block ciphers is the randomness of the cipher text. One criterion used to evaluate the Advanced Encryption Standard (AES) candidate algorithms was their demonstrated suitability as random number generators. In this paper, we introduced a new approach to interpret the results of tests of randomness.… Read More »