Boolean functions and their generalization Vectorial Boolean functions or Substitution Boxes (S-Boxes) have attracted much attention in the domain of modern block ciphers that use only these elements to provide the necessary confusion against the cryptanalysis attacks. Thus, a significant number of research has been done to construct cryptograph-ically strong Boolean functions and S-Boxes. Among these researches, several heuristics were applied and therefore the hill climbing heuristic was largely investigated. In this paper, we propose a new variant of Hill Climbing heuristic called Parallel Steepest Ascent Hill Climbing to construct Boolean functions and n × m S-Boxes through the progressive construction and incorporation of their m coordinate Boolean functions. The obtained results demonstrate that this new variant provides solutions with high cryptographic properties.
展开▼
机译:[n i Sub>] f(2 n Sup>)和[m i Sub>] f()的模拟信号位置参数的布尔求和方法f Σ Sub> [n i Sub>]&[m i Sub>]()中的部分乘积的2 n Sup>) 2 n Sup>)使用双布尔微分d / dn + Sup>和d / dn -中间和 Sup>以及位置格式中结果和[S i Sub>] f(2 n Sup>)的生成(俄语)