Efficient Construction of the Boomerang Connection Table

@article{Dunkelman2018EfficientCO,
  title={Efficient Construction of the Boomerang Connection Table},
  author={Orr Dunkelman},
  journal={IACR Cryptology ePrint Archive},
  year={2018},
  volume={2018},
  pages={631}
}
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) time. We show that one can construct the same table in only O(2) time.