Paper 2022/091 Original: eprint.iacr.org/2022/091 ↗
The multiplicative complexity of interval checking
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.
Metadata
- Available format(s)
PDF- Category
- Secret-key cryptography
- Publication info
- Preprint.
- History
- 2022-01-31: last updated
- 2022-01-31: published
- Short URL
- https://ia.cr/2022/091
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2022/091,
author = {Thomas Häner and Mathias Soeken},
title = {The multiplicative complexity of interval checking},
howpublished = {Cryptology {ePrint} Archive, Paper 2022/091},
year = {2022},
url = {https://eprint.iacr.org/2022/091}
}