Name
Abstract | ||
|---|---|---|
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.
|
Year | DOI | Venue |
|---|---|---|
2018 | 10.1145/3205455.3205518 | GECCO |
Keywords | Field | DocType |
Boolean function, genetic algorithm, statistical randomness testing | Boolean function,Mathematical optimization,Evolutionary algorithm,Statistical randomness,Computer science,Evolutionary computation,Cryptographic primitive,Theoretical computer science,Algebraic normal form,Hash function,Randomness | Conference |
ISBN | Citations | PageRank |
978-1-4503-5618-3 | 0 | 0.34 |
References | Authors | |
9 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Vojtech Mrazek | 1 | 86 | 13.41 |
| Marek Sýs | 2 | 10 | 4.24 |
| Zdenek Vasícek | 3 | 192 | 23.11 |
| Lukás Sekanina | 4 | 307 | 36.03 |
| Vashek Matyas | 5 | 165 | 29.25 |