{"ID":2858607,"CreatedAt":"2026-06-01T04:54:23.091178241Z","UpdatedAt":"2026-06-01T04:54:23.091178241Z","DeletedAt":null,"paper_url":"https://arxiv.org/abs/2510.06707","arxiv_id":"2510.06707","title":"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.","short_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. Thi...","url_abs":"https://arxiv.org/abs/2510.06707","url_pdf":"https://arxiv.org/pdf/2510.06707v1","authors":"[\"Katharina Arms\"]","published":"2025-10-08T06:59:10Z","proceeding":"math.RT","tasks":"[\"math.RT\",\"cs.CR\"]","methods":"[]","has_code":false}