Cryptology ePrint Archive: Report 2018/631

Efficient Construction of the Boomerang Connection Table

Orr Dunkelman

Abstract: Recently, the Boomerang Connection Table was introduced by Cid et al. as a tool to better evaluate the probability of a boomerang distinguisher. To compute the BCT of an $n$-bit to $n$-bit S-box, the inventors of the BCT proposed an algorithm that takes $O(2^{3n})$ time. We show that one can construct the same table in only $O(2^{2n})$ time.

Category / Keywords: secret-key cryptography / BCT, Cryptanalysis

Date: received 26 Jun 2018, last revised 28 Jun 2018

Contact author: orrd at cs haifa ac il

Available format(s): PDF | BibTeX Citation

Version: 20180628:122333 (All versions of this report)

Short URL: ia.cr/2018/631