|
|||||
|
|
Testing for randomness in stream ciphers using the binary derivative |
|
| Authors: | Neville Davies Ed Dawson Helen Gustafson A. N. Pettitt |
| Affiliation: | (1) Department of Mathematics, Statistics and Operational Research, The Nottingham Trent University, NG1 4BU Nottingham, UK;(2) Information Security Research Centre, Queensland University of Technology, GPO Box 2434, 4001 Brisbane, Queensland, Australia;(3) School of Mathematics, Queensland University of Technology, GPO Box 2434, 4001 Brisbane, Queensland, Australia |
| Abstract: | The binary derivative has been used to measure the randomness of a binary string formed by a pseudorandom number generator for use in cipher systems. In this paper we develop statistical properties of the binary derivative and show that certain types of randomness testing in binary derivatives are equivalent to well-established tests for randomness in the original string. A uniform method of testing randomness in binary strings is described based on using the binary derivative. We show that the new tests are faster and more powerful than several of the well-established tests for randomness. |
| Keywords: | Bernoulli trials binary derivative cryptography pseudorandom sequence stream cipher |
| 本文献已被 SpringerLink 等数据库收录！ | |