Local Search Trajectories over S-box space

Abstract

A local search method is developed and applied to create trajectories over S-box spaces in this work. These trajectories show a strong linear correlation between confusion coefficient variance, transparency order, modified transparency order, and revised transparency order under the Hamming weight model. When the confusion coefficient variance values increase, the values of transparency order, modified transparency order beta zero, and revised transparency order beta zero decrease, reflecting the same theoretical resistance against side-channel attacks by power consumption. From the best of our knowledge, it is the first time that Local Search trajectories are used to discover relations between cryptography properties. The experimental results and comparisons provide evidence of the capabilities of the proposal to handle the cryptography problems.