SAT-aided Automatic Search of Boomerang Distinguishers for ARX Ciphers (Long Paper)

ePrint Report: SAT-aided Automatic Search of Boomerang Distinguishers for ARX Ciphers (Long Paper)

Dachao Wang, Baocang Wang, Siwei Sun

In Addition-Rotation-Xor (ARX) ciphers, the large domain size obstructs the application of the boomerang connectivity table. In this paper, we explore the problem of computing this table for a modular addition and the automatic search of boomerang characteristics for ARX ciphers. We provide dynamic programming algorithms to efficiently compute this table and its variants. These algorithms are the most efficient up …

addition algorithms application automatic ciphers compute computing connectivity domain dynamic eprint report large modular problem programming report rotation sat search size xor