Evolving DPA-Resistant Boolean Functions

Stjepan Picek^1,2, Lejla Batina¹, and Domagoj Jakobovic²

¹Radboud University Nijmegen, Institute for Computing and Information Sciences, Postbus 9010, 6500 GL, Nijmegen, The Netherlands

²Faculty of Electrical Engineering and Computing, University of Zagreb, Unska 3, Zagreb, Croatia

Abstract. Boolean functions are important primitives in cryptography. Accordingly, there exist numerous works on the methods of constructions of Boolean functions. However, the property specifying the resistance of Boolean functions against Differential Power Analysis (DPA) attacks was until now scarcely investigated and only for S-boxes. Here, we evolve Boolean functions that have higher resistance to DPA attacks than others published before by using two well-known evolutionary computation methods where genetic programming shows best performance.

Keywords: Genetic Algorithms, Genetic Programming, Boolean Functions, Cryptographic Properties, Transparency Order

LNCS 8672, p. 812 ff.

Full article in PDF | BibTeX

lncs@springer.com
© Springer International Publishing Switzerland 2014