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 a Václav MATYÁŠ

Základní údaje

Originální název

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

Autoři

ŠVENDA, Petr (203 Česká republika, garant, domácí); Martin UKROP (703 Slovensko, domácí) a Václav MATYÁŠ (203 Česká republika, domácí)

Vydání

Berlin, E-Business and Telecommunications, od s. 290-305, 16 s. 2014

Nakladatel

Springer Berlin Heidelberg

Další údaje

Jazyk

angličtina

Typ výsledku

Stať ve sborníku

Obor

10201 Computer sciences, information science, bioinformatics

Stát vydavatele

Česká republika

Utajení

není předmětem státního či obchodního tajemství

Forma vydání

tištěná verze "print"

Odkazy

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

Kód RIV

RIV/00216224:14330/14:00074102

Organizační jednotka

Fakulta informatiky

ISBN

978-3-662-44787-1

ISSN

DOI

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

UT WoS

000345296600017

EID Scopus

2-s2.0-84908528308

Klíčová slova anglicky

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

Příznaky

Mezinárodní význam, Recenzováno

Změněno: 27. 4. 2015 06:09, RNDr. Pavel Šmerk, Ph.D.

Anotace

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.

Návaznosti

GAP202/11/0422, projekt VaV

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

Investor: Grantová agentura ČR, Bezpečnostní protokoly podporující soukromí a detekce průniku v bezdrátových senzorových sítích

Citovat

ŠVENDA, Petr; Martin UKROP a 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, s. 290-305. ISBN 978-3-662-44787-1. Dostupné z: https://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 = {https://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  - CONF
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 a 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, s.~290-305. ISBN~978-3-662-44787-1. Dostupné z: https://doi.org/10.1007/978-3-662-44788-8\_{}17.

Přehled o publikaci