Conventional bit-based division property trail search is NP-complete

Aleksei Udovenko

Paper 2026/1145

Conventional bit-based division property trail search is NP-complete

Aleksei Udovenko

, University of Luxembourg

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.
Keywords: Cryptanalysis Division property NP-hardness
Contact author(s): aleksei @ affine group
History: 2026-06-08: approved; 2026-06-02: received; See all versions
Short URL: https://ia.cr/2026/1145
License: CC BY

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}
}