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.
Author supplied keywords
Cite
CITATION STYLE
Picek, S., Picek, S., Batina, L., & Jakobovic, D. (2014). Evolving DPA-resistant boolean functions. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 8672, 812–821. https://doi.org/10.1007/978-3-319-10762-2_80
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
