Welcome to the resource topic for 2018/631
Title:
Efficient Construction of the Boomerang Connection Table
Authors: 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.
ePrint: https://eprint.iacr.org/2018/631
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .