Article

Constructing Empirical Tests of Randomness

Authors:

Marek Sýs,

Petr źvenda,

Martin Ukrop,

Vashek MatyáźAuthors Info & Claims

ICETE 2014: Proceedings of the 11th International Joint Conference on e-Business and Telecommunications - Volume 4

Pages 229 - 237

https://doi.org/10.5220/0005023902290237

Published: 28 August 2014 Publication History

Abstract

In this paper we introduce a general framework for automatic construction of empirical tests of randomness. Our new framework generalises and improves a previous approach (Å venda et al., 2013) and it also provides a clear statistical interpretation of its results. This new approach was tested on selected stream ciphers from the eSTREAM competition. Results show that our approach can lay foundations to randomness testing and it is comparable to the Statistical Test Suite developed by NIST. Additionally, the proposed approach is able

to perform randomness analysis even when presented with sequences shorter by several orders of magnitude than required by the NIST suite. Although the Dieharder battery still provides a slightly better randomness analysis, our framework is able to detect non-randomness for stream ciphers with limited number of rounds (Hermes, Fubuki) where both above-mentioned batteries fail.

Index Terms

Constructing Empirical Tests of Randomness
1. Security and privacy

Recommendations

Non-randomness in eSTREAM candidates salsa20 and TSC-4
INDOCRYPT'06: Proceedings of the 7th international conference on Cryptology in India

Stream cipher initialisation should ensure that the initial state or keystream is not detectably related to the key and initialisation vector. In this paper we analyse the key/IV setup of the eSTREAM Phase 2 candidates Salsa20 and TSC-4. In the case of ...
Randomness Testing: Result Interpretation and Speed
LNCS Essays on The New Codebreakers - Volume 9100

In cryptography, randomness is typically tested using a battery of tests consisting of many tests of randomness --- each focusing on a different feature. Probability that data produced by a good generator would pass all the tests in a battery can get ...
Latin dances revisited: new analytic results of Salsa20 and ChaCha
ICICS'11: Proceedings of the 13th international conference on Information and communications security

In this paper, we propose new attacks on 9-round Salsa20 and 8-round ChaCha. We constructed a distinguisher of double-bit differentials to improve Aumasson's single-bit differential cryptanalysis. We searched for correlations using a PC, and found ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

ICETE 2014: Proceedings of the 11th International Joint Conference on e-Business and Telecommunications - Volume 4

August 2014

509 pages

ISBN:9789897580451

Editors:
Mohammad Obaidat
Fordham University
,
Andreas Holzinger
Medical University Graz
,
Pierangela Samarati
Università degli Studi di Milano

Publisher

SCITEPRESS - Science and Technology Publications, Lda

Setubal, Portugal

Publication History

Published: 28 August 2014

Author Tags

Qualifiers

Article

Index Terms

Recommendations

Non-randomness in eSTREAM candidates salsa20 and TSC-4

Randomness Testing: Result Interpretation and Speed

Latin dances revisited: new analytic results of Salsa20 and ChaCha