Parallel SAT Framework to Find Clustering of Differential Characteristics and Its Applications

ePrint Report: Parallel SAT Framework to Find Clustering of Differential Characteristics and Its Applications

Kosei Sakamoto, Ryoma Ito, Takanori Isobe

The most crucial but time-consuming task for differential cryptanalysis is to find a differential with a high probability. To tackle this task, we propose a new SAT-based automatic search framework to efficiently figure out a differential with the highest probability under a specified condition. As the previous SAT methods (e.g., the Sun et al’s method proposed at ToSC 2021(1)) focused …

applications automatic clustering consuming cryptanalysis eprint report find framework high report sat task