Searching for Highly Nonlinear DPA-Resistant Balanced Boolean Functions in the Rotation Symmetric Class
Youle Xu, Qichun Wang · 2019
Transparency order, proposed by Prouff in 2005 and redefined by Chakraborty et al. in 2017, is a property to assess the resistance of a Boolean function or an S-box to Differential Power Analysis (DPA) attacks. In this paper, we develop an efficient algorithm based on the Gradient Descent algorithm, and search for balanced functions with good transparency order and high nonlinearity in the rotation symmetric Boolean functions (RSBFs) class. As a result, we find some cryptographically significant Boolean functions whose resistance to DPA attacks is much better than others obtained previously.