Representation Gap of the Motzkin Monoid
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911197583900672 |
|---|---|
| author | Arms, Katharina |
| author_facet | Arms, Katharina |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_06707 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Representation Gap of the Motzkin Monoid Arms, Katharina Representation Theory Cryptography and Security Primary: 05E10, 20M30, secondary: 94A60 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. |
| title | Representation Gap of the Motzkin Monoid |
| topic | Representation Theory Cryptography and Security Primary: 05E10, 20M30, secondary: 94A60 |
| url | https://arxiv.org/abs/2510.06707 |