Information Technology Reference
In-Depth Information
case of testing longer sequences by level-2 version of these tests, correlations still
exist whenever the input block size is small.
We also defined the concept of sensitivity, where we analyze the effect of
simple transformations on test results. If a transformation significantly changes
the output
p
-values, then the composition of the transformation and the test
may be included in the suite to increase the coverage. Ideally, we would like to
have each test applied to a transformed sequence
σ
(
S
) to be independent of all
different tests applied to the original sequence. Clearly, as the set of allowable
transformations grows, this becomes harder to achieve. By choosing a good set
of allowable transformations, one can use a given set of tests in a more powerful
fashion. For example, one should not introduce unnatural transformations of the
data, but stick to a set of transformations which are generated by a small set of
basic transformations, such as the ones given here as examples. It is of interest
to investigate this problem further in future work.
References
1. Rukhin, A., Soto, J., Nechvatal, J., Smid, M., Barker, E., Leigh, S., Levenson, M.,
Vangel, M., Banks, D., Heckert, A., Dray, J., Vo, S.: A Statistical Test Suite for
Random and Pseudorandom Number Generators for Cryptographic Applications
(2001),
http://www.nist.gov
2. Marsaglia, G.: The Marsaglia Random Number CDROM including the DIEHARD
Battery of Tests of Randomness (1996)
3. Caelli, W., Dawson, E., Nielsen, L., Gustafson, H.: CRYPT-X Statistical Package
Manual, Measuring the Strength of Stream and Block ciphers (1992)
4. Knuth, D.E.: Seminumerical Algorithms. The Art of Computer Programming,
vol. 2. Addison-Wesley, Reading (1981)
5. L'Ecuyer, P., Simard, R.: TestU01: A C library for Empirical Testing of Random
Number Generators. ACM Transactions on Mathematical Software (to appear,
2006)
6. Soto, J.: Randomness Testing of the AES Candidate Algorithms (1999)
7. Hellekalek, P., Wegenkittl, S.: Empirical Evidence Concerning AES. ACM Trans.
Model. Comput. Simul. 13(4), 322-333 (2003)
8. Doganaksoy, A., Gologlu, F.: On Lempel-Ziv Complexity of Sequences. In: Gong,
G., Helleseth, T., Song, H.-Y., Yang, K. (eds.) SETA 2006. LNCS, vol. 4086, pp.
180-189. Springer, Heidelberg (2006)
9. Kasselman, P.: A Statistical Test for Stream Ciphers Based on the Maximum
Order Complexity. In: South African Symposium On Communication and Signal
Processing, pp. 213-218 (1998)
10. Robshaw, M.: Stream Ciphers. Technical Report TR - 701 (1994)
11. L'Ecuyer, P.: Testing Random Number Generators. In: Proceedings of the 1992
Winter Simulation Conference, pp. 305-313. IEEE Press, Los Alamitos (1992)
12. Massey, J.L., Serconek, S.: A Fourier Transform Approach to the Linear Com-
plexity of Nonlinearly Filtered Sequences. In: Desmedt, Y.G. (ed.) CRYPTO 1994.
LNCS, vol. 839, pp. 332-340. Springer, Heidelberg (1994)
