Other formats:
BibTeX
LaTeX
RIS
@inproceedings{1119423,
author = {Švenda, Petr and Ukrop, Martin and Matyáš, Václav},
address = {Portugal},
booktitle = {Proceedings of SECRYPT 2013, 10th International Conference on Security and Cryptography},
editor = {Pierangela Samarati},
keywords = {eStream; genetic programming; random distinguisher; randomness statistical testing; software circuit},
howpublished = {tištěná verze "print"},
language = {eng},
location = {Portugal},
isbn = {978-989-8565-73-0},
pages = {135-146},
publisher = {SCITEPRESS},
title = {Towards cryptographic function distinguishers with evolutionary circuits},
url = {http://www.fi.muni.cz/~xsvenda/papers/secrypt2013/},
year = {2013}
}
TY - JOUR
ID - 1119423
AU - Švenda, Petr - Ukrop, Martin - Matyáš, Václav
PY - 2013
TI - Towards cryptographic function distinguishers with evolutionary circuits
PB - SCITEPRESS
CY - Portugal
SN - 9789898565730
KW - eStream
KW - genetic programming
KW - random distinguisher
KW - randomness statistical testing
KW - software circuit
UR - http://www.fi.muni.cz/~xsvenda/papers/secrypt2013/
L2 - http://www.fi.muni.cz/~xsvenda/papers/secrypt2013/
N2 - 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.
ER -
ŠVENDA, Petr, Martin UKROP and Václav MATYÁŠ. Towards cryptographic function distinguishers with evolutionary circuits. In Pierangela Samarati. \textit{Proceedings of SECRYPT 2013, 10th International Conference on Security and Cryptography}. Portugal: SCITEPRESS. p.~135-146. ISBN~978-989-8565-73-0. 2013.
|
