Existence Conditions for Commuting Key Pairs

Characterize the conditions under which distinct CARTS key-induced encoding maps commute, meaning that E_{k_1}(E_{k_2}(m)) equals E_{k_2}(E_{k_1}(m)) for relevant messages or families of messages.

Background

The paper studies whether key-induced encoding maps can commute and whether commuting keys could generate related context-search instances sharing the same hidden key. Experiments find no commuting pairs among the tested samples, but this empirical observation does not establish general non-commutativity or characterize when commuting pairs may exist. The theoretical conditions for their existence are explicitly left unresolved.

References

On the theoretical side, the hardness of the context search problem, the asymptotic structure of collision fibers, the conditions under which commuting key pairs exist, and the design of more general CARTS transforms are all concrete open problems that follow naturally from the framework.

— CARTS: Contextual Autoregressive Rank Transcoding Steganography for Full-Capacity Keyed Text Encoding  (2609.10744 - Ghantous et al., 9 Sep 2026) in Section 7, Conclusion