Evolving Boolean Functions for Fast and Efficient Randomness Testing

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F18%3APU130710" target="_blank" >RIV/00216305:26230/18:PU130710 - isvavai.cz</a>

Nalezeny alternativní kódy

RIV/00216224:14330/18:00101071

Výsledek na webu

<a href="https://www.fit.vut.cz/research/publication/11686/" target="_blank" >https://www.fit.vut.cz/research/publication/11686/</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1145/3205455.3205518" target="_blank" >10.1145/3205455.3205518</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Evolving Boolean Functions for Fast and Efficient Randomness Testing

Popis výsledku v původním jazyce

The security of cryptographic algorithms (such as block ciphers and hash functions) is often evaluated in terms of their output randomness. This paper presents a novel method for the statistical randomness testing of cryptographic primitives, which is based on the evolutionary construction of the so-called randomness distinguisher. Each distinguisher is represented as a Boolean polynomial in the Algebraic Normal Form. The previous approach, in which the distinguishers were developed in two phases by means of the brute-force method, is replaced with a more scalable evolutionary algorithm (EA). On seven complex datasets, this EA provided distinguishers of the same quality as the previous approach, but the execution time was in practice reduced 40 times. This approach allowed us to perform a more efficient search in the space of Boolean distinguishers and to obtain more complex high-quality distinguishers than the previous approach.

Název v anglickém jazyce

Evolving Boolean Functions for Fast and Efficient Randomness Testing

Popis výsledku anglicky

The security of cryptographic algorithms (such as block ciphers and hash functions) is often evaluated in terms of their output randomness. This paper presents a novel method for the statistical randomness testing of cryptographic primitives, which is based on the evolutionary construction of the so-called randomness distinguisher. Each distinguisher is represented as a Boolean polynomial in the Algebraic Normal Form. The previous approach, in which the distinguishers were developed in two phases by means of the brute-force method, is replaced with a more scalable evolutionary algorithm (EA). On seven complex datasets, this EA provided distinguishers of the same quality as the previous approach, but the execution time was in practice reduced 40 times. This approach allowed us to perform a more efficient search in the space of Boolean distinguishers and to obtain more complex high-quality distinguishers than the previous approach.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

<a href="/cs/project/GA16-08565S" target="_blank" >GA16-08565S: Rozvoj kryptoanalytických metod prostřednictvím evolučních výpočtů</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2018

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

Proceedings of the Genetic and Evolutionary Computation Conference (GECCO '18)

ISBN

978-1-4503-5618-3

ISSN

—

e-ISSN

—

Počet stran výsledku

8

Strana od-do

1302-1309

Název nakladatele

Association for Computing Machinery

Místo vydání

Kyoto

Místo konání akce

Kyoto

Datum konání akce

15. 7. 2018

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

000579327800168