Welcome to the resource topic for 2022/091
Title:
The multiplicative complexity of interval checking
Authors: Thomas Häner, Mathias Soeken
Abstract:We determine the exact AND-gate cost of checking if a\leq x < b, where a and b are constant integers. Perhaps surprisingly, we find that the cost of interval checking never exceeds that of a single comparison and, in some cases, it is even lower.
ePrint: https://eprint.iacr.org/2022/091
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 .