loading
Documents

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Petr Svenda ; Martin Ukrop and Vashek Matyas

Affiliation: Masaryk University, Czech Republic

ISBN: 978-989-8565-73-0

Keyword(s): eStream, Genetic Programming, Random Distinguisher, Randomness Statistical Testing, Software Circuit.

Related Ontology Subjects/Areas/Topics: Applied Cryptography ; Cryptographic Techniques and Key Management ; Data Engineering ; Databases and Data Security ; Information and Systems Security ; Security in Information Systems ; Security Metrics and Measurement

Abstract: Cryptanalysis of a cryptographic function usually requires advanced cryptanalytical skills and extensive amount of human labour. However, some automation is possible, e.g., by using randomness testing suites like STS NIST (Rukhin, 2010) or Dieharder (Brown, 2004). These can be applied to test statistical properties of cryptographic function outputs. Yet such testing suites are limited only to predefined patterns testing particular statistical defects. We propose more open approach based on a combination of software circuits and evolutionary algorithms to search for unwanted statistical properties like next bit predictability, random data non-distinguishability or strict avalanche criterion. Software circuit that acts as a testing function is automatically evolved by a stochastic optimization algorithm and uses information leaked during cryptographic function evaluation. We tested this general approach on problem of finding a distinguisher (Englund et al., 2007) of outputs produced by several candidate algorithms for eStream competition from truly random sequences. We obtained similar results (with some exceptions) as those produced by STS NIST and Dieharder tests w.r.t. the number of rounds of the inspected algorithm. This paper focuses on providing solid assessment of the proposed approach w.r.t. STS NIST and Dieharder when applied over multiple different algorithms rather than obtaining best possible result for a particular one. Additionally, proposed approach is able to provide random distinguisher even when presented with very short sequence like 16 bytes only. (More)

PDF ImageFull Text

Download
Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 54.156.51.193

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Svenda P., Ukrop M. and Matyas V. (2013). Towards Cryptographic Function Distinguishers with Evolutionary Circuits.In Proceedings of the 10th International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2013) ISBN 978-989-8565-73-0, pages 135-146. DOI: 10.5220/0004524001350146

@conference{secrypt13,
author={Petr Svenda and Martin Ukrop and Vashek Matyas},
title={Towards Cryptographic Function Distinguishers with Evolutionary Circuits},
booktitle={Proceedings of the 10th International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2013)},
year={2013},
pages={135-146},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004524001350146},
isbn={978-989-8565-73-0},
}

TY - CONF

JO - Proceedings of the 10th International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2013)
TI - Towards Cryptographic Function Distinguishers with Evolutionary Circuits
SN - 978-989-8565-73-0
AU - Svenda P.
AU - Ukrop M.
AU - Matyas V.
PY - 2013
SP - 135
EP - 146
DO - 10.5220/0004524001350146

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.