Name
Abstract | ||
|---|---|---|
Boolean functions represent an important primitive in the design of various cryptographic algorithms. There exist several well-known schemes where a Boolean function is used to add nonlinearity to the cipher. Thus, methods to generate Boolean functions that possess good cryptographic properties present an important research goal. Among other techniques, evolutionary computation has proved to be a well suited approach for this problem. In this paper, we present three different objective functions, where each inspects important cryptographic properties of Boolean functions, and examine four evolutionary algorithms. Our research confirms previous results, but also sheds new insights on the effectiveness and comparison of different evolutionary algorithms for this problem. (C) 2015 Elsevier B.V. All rights reserved. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1016/j.asoc.2015.10.066 | Applied Soft Computing |
Keywords | Field | DocType |
Evolutionary algorithms,Boolean functions,Cryptography,Comparison,Analysis | Boolean function,Theoretical computer science,Standard Boolean model,Artificial intelligence,And-inverter graph,Maximum satisfiability problem,Mathematical optimization,Boolean circuit,Boolean satisfiability problem,Algorithm,Security of cryptographic hash functions,Boolean expression,Mathematics,Machine learning | Journal |
Volume | ISSN | Citations |
40 | 1568-4946 | 8 |
PageRank | References | Authors |
0.54 | 33 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Stjepan Picek | 1 | 164 | 44.70 |
| Domagoj Jakobovic | 2 | 195 | 29.01 |
| Julian F. Miller | 3 | 16 | 1.35 |
| Lejla Batina | 4 | 1488 | 107.99 |
| Marko Čupić | 5 | 22 | 4.99 |