### 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.

Available format(s)
Category
Secret-key cryptography
Publication info
Preprint. MINOR revision.
Keywords
BCTCryptanalysis
Contact author(s)
orrd @ cs haifa ac il
History
2018-06-28: revised
See all versions
Short URL
https://ia.cr/2018/631

CC BY

BibTeX

@misc{cryptoeprint:2018/631,
author = {Orr Dunkelman},
title = {Efficient Construction of the Boomerang Connection Table},
howpublished = {Cryptology ePrint Archive, Paper 2018/631},
year = {2018},
note = {\url{https://eprint.iacr.org/2018/631}},
url = {https://eprint.iacr.org/2018/631}
}

Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.