Paper 2026/1145 Original: eprint.iacr.org/2026/1145 ↗
Conventional bit-based division property trail search is NP-complete
Abstract
This short note shows that the conventional (2-subset) bit-based division property trail search problem is NP-complete.
Metadata
- Available format(s)
PDF- Category
- Secret-key cryptography
- Publication info
- Preprint.
- History
- 2026-06-02: last updated
- 2026-06-02: published
- Short URL
- https://ia.cr/2026/1145
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2026/1145,
author = {Aleksei Udovenko},
title = {Conventional bit-based division property trail search is NP-complete},
howpublished = {Cryptology {ePrint} Archive, Paper 2026/1145},
year = {2026},
url = {https://eprint.iacr.org/2026/1145}
}