Abstract

During the search for S-boxes resistant to Power Attacks, the S-box space has recently been divided into Hamming Weight classes, according to its theoretical resistance to these attacks using the metric variance of the confusion coefficient. This partition allows for reducing the size of the search space. The swap operator is frequently used when searching with a random selection of items to be exchanged. In this work, the theoretical probability of changing Hamming Weight class of the S-box is calculated when the swap operator is applied randomly in a permutation. The precision of these probabilities is confirmed experimentally. Its limit and a recursive formula are theoretically proved. It is shown that this operator changes classes with high probability, which favors the exploration of the Hamming Weight class of S-boxes space but dramatically reduces the exploitation within classes. These results are generalized, showing that the probability of moving within the same class is substantially reduced by applying two swaps. Based on these results, it is proposed to modify/improve the use of the swap operator, replacing its random application with the appropriate selection of the elements to be exchanged, which allows taking control of the balance between exploration and exploitation. The calculated probabilities show that the random application of the swap operator is inappropriate during the search for nonlinear S-boxes resistant to Power Attacks since the exploration may be inappropriate when the class is resistant to Differential Power Attack. It would be more convenient to search for nonlinear S-boxes within the class. This result provides new knowledge about the influence of this operator in the balance exploration–exploitation. It constitutes a valuable tool to improve the design of future algorithms for searching S-boxes with good cryptography properties. In a probabilistic way, our main theoretical result characterizes the influence of the swap operator in the exploration–exploitation balance during the search for S-boxes resistant to Power Attacks in the Hamming Weight class space. The main practical contribution consists of proposing modifications to the swap operator to control this balance better.

Highlights

  • The objective of this work is to theoretically determine the influence used by the swap operator, in the very important balance between exploration and exploitation in the Hamming Weight class space, dur

  • It is observed how the estimated probabilities of experiment 2 coincide with those estimated in experiment 1 and with the theoretical ones, which shows that their values depend little on that of the initial permutation

  • In many of the previous investigations on the search for nonlinear bijective S-boxes, resistant to Power Attacks, the S-boxes are represented as permutations, and in the search process, to move within the space of S-boxes, the swap operator is applied with random selection of the elements to be exchanged [7,9,10]

Read more

Summary

Introduction

Side-channel attacks, in conjunction with deep learning techniques, are threatened computational systems [1,2,3] Those systems rely on the security that emerges creativecommons.org/licenses/by/ 4.0/). S-boxes with high theoretical resistance against side-channel attacks that use power consumption as a side-channel can be found by applying heuristics methods. Many of these methods apply the swap operator over a permutation (sometimes as mutation) in the S-box space [7,9,10,11,12,13,14,15,16]

Objectives
Methods
Results
Discussion
Conclusion

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.