Determining Cryptographic Distinguishers for eStream and SHA-3
Candidate Functions with Evolutionary Circuits

D 2014

Determining Cryptographic Distinguishers for eStream and SHA-3 Candidate Functions with Evolutionary Circuits

ŠVENDA, Petr, Martin UKROP and Václav MATYÁŠ

Basic information

Original name

Determining Cryptographic Distinguishers for eStream and SHA-3 Candidate Functions 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

Berlin, E-Business and Telecommunications, p. 290-305, 16 pp. 2014

Publisher

Springer Berlin Heidelberg

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:

The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-662-44788-8_17

RIV identification code

RIV/00216224:14330/14:00074102

Organization unit

Faculty of Informatics

ISBN

978-3-662-44787-1

ISSN

DOI

http://dx.doi.org/10.1007/978-3-662-44788-8_17

UT WoS

000345296600017

Keywords in English

eStream; Genetic programming; Random distinguisher; Randomness statistical testing; Software circuit

Abstract

V originále

Cryptanalysis of a cryptographic function usually requires advanced cryptanalytical skills and extensive amount of human labor with an option of using randomness testing suites like STS NIST or Dieharder. These can be applied to test statistical properties of cryptographic function outputs. We propose a more open approach based on software circuit that acts as a testing function automatically evolved by a stochastic optimization algorithm. Information leaked during cryptographic function evaluation is used to find a distinguisher of outputs produced by 25 candidate algorithms for eStream and SHA-3 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.

Links

GAP202/11/0422, research and development project

Name: Bezpečnostní protokoly podporující soukromí a detekce průniku v bezdrátových senzorových sítích (Acronym: P202/11/0422)

Investor: Czech Science Foundation

Citovat

ŠVENDA, Petr, Martin UKROP and Václav MATYÁŠ. Determining Cryptographic Distinguishers for eStream and SHA-3 Candidate Functions with Evolutionary Circuits. In Mohammad S. Obaidat, Joaquim Filipe. E-Business and Telecommunications. Berlin: Springer Berlin Heidelberg, 2014, p. 290-305. ISBN 978-3-662-44787-1. Available from: https://dx.doi.org/10.1007/978-3-662-44788-8_17.

@inproceedings{1209743,
   author = {Švenda, Petr and Ukrop, Martin and Matyáš, Václav},
   address = {Berlin},
   booktitle = {E-Business and Telecommunications},
   doi = {http://dx.doi.org/10.1007/978-3-662-44788-8_17},
   editor = {Mohammad S. Obaidat, Joaquim Filipe},
   keywords = {eStream; Genetic programming; Random distinguisher; Randomness statistical testing; Software circuit},
   howpublished = {tištěná verze "print"},
   language = {eng},
   location = {Berlin},
   isbn = {978-3-662-44787-1},
   pages = {290-305},
   publisher = {Springer Berlin Heidelberg},
   title = {Determining Cryptographic Distinguishers for eStream and SHA-3 Candidate Functions with Evolutionary Circuits},
   url = {http://dx.doi.org/10.1007/978-3-662-44788-8_17},
   year = {2014}
}

TY  - JOUR
ID  - 1209743
AU  - Švenda, Petr - Ukrop, Martin - Matyáš, Václav
PY  - 2014
TI  - Determining Cryptographic Distinguishers for eStream and SHA-3 Candidate Functions with Evolutionary Circuits
PB  - Springer Berlin Heidelberg
CY  - Berlin
SN  - 9783662447871
KW  - eStream
KW  - Genetic programming
KW  - Random distinguisher
KW  - Randomness statistical testing
KW  - Software circuit
UR  - http://dx.doi.org/10.1007/978-3-662-44788-8_17
N2  - Cryptanalysis of a cryptographic function usually requires advanced cryptanalytical skills and extensive amount of human labor with an option of using randomness testing suites like STS NIST or Dieharder. These can be applied to test statistical properties of cryptographic function outputs. We propose a more open approach based on software circuit that acts as a testing function automatically evolved by a stochastic optimization algorithm. Information leaked during cryptographic function evaluation is used to find a distinguisher of outputs produced by 25 candidate algorithms for eStream and SHA-3 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.
ER  -

ŠVENDA, Petr, Martin UKROP and Václav MATYÁŠ. Determining Cryptographic Distinguishers for eStream and SHA-3 Candidate Functions with Evolutionary Circuits. In Mohammad S. Obaidat, Joaquim Filipe. \textit{E-Business and Telecommunications}. Berlin: Springer Berlin Heidelberg, 2014, p.~290-305. ISBN~978-3-662-44787-1. Available from: https://dx.doi.org/10.1007/978-3-662-44788-8\_{}17.

Detailed Information on Publication Record