Detailed Information on Publication Record
2013
Towards cryptographic function distinguishers with evolutionary circuits
ŠVENDA, Petr, Martin UKROP and Václav MATYÁŠBasic information
Original name
Towards cryptographic function distinguishers with evolutionary circuits
Authors
ŠVENDA, Petr (203 Czech Republic, guarantor, belonging to the institution), Martin UKROP (703 Slovakia, belonging to the institution) and Václav MATYÁŠ (203 Czech Republic, belonging to the institution)
Edition
Portugal, Proceedings of SECRYPT 2013, 10th International Conference on Security and Cryptography, p. 135-146, 12 pp. 2013
Publisher
SCITEPRESS
Other information
Language
English
Type of outcome
Stať ve sborníku
Field of Study
10201 Computer sciences, information science, bioinformatics
Country of publisher
Czech Republic
Confidentiality degree
není předmětem státního či obchodního tajemství
Publication form
printed version "print"
References:
RIV identification code
RIV/00216224:14330/13:00066277
Organization unit
Faculty of Informatics
ISBN
978-989-8565-73-0
Keywords in English
eStream; genetic programming; random distinguisher; randomness statistical testing; software circuit
Změněno: 24/4/2014 18:20, RNDr. Pavel Šmerk, Ph.D.
Abstract
V originále
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 or Dieharder. 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 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.
Links
| GAP202/11/0422, research and development project |
|