Paper 2018/631 Original: eprint.iacr.org/2018/631 ↗
Efficient Construction of the Boomerang Connection Table
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.
Metadata
- Available format(s)
PDF- Category
- Secret-key cryptography
- Publication info
- Preprint.
- History
- 2018-06-28: last updated
- 2018-06-26: published
- Short URL
- https://ia.cr/2018/631
- License
- https://creativecommons.org/licenses/by/4.0/
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},
url = {https://eprint.iacr.org/2018/631}
}