arXiv · 2510.06707
Representation Gap of the Motzkin Monoid
Abstract
The linear decomposition attack reveals a vulnerability in encryption algorithms operating within groups or monoids with excessively small representations. The representation gap, defined as the size of the smallest non-trivial representation, therefore serves as a metric to assess the security of these algorithms. This paper will demonstrate that the diagrammatic Motzkin monoids exhibit a large representation gap, positioning them as promising candidates for robust encryption algorithms.
Explore related subjects
Keep this discovery
Katharina Arms. 2025-10-08. Representation Gap of the Motzkin Monoid. https://arxiv.org/abs/2510.06707
Cite the original work for its findings. Save a collection to share your selection of sources.