Monoidal categories, representation gap and cryptography
arXiv:2201.01805 · doi:10.1090/btran/151
Abstract
The linear decomposition attack provides a serious obstacle to direct applications of noncommutative groups and monoids (or semigroups) in cryptography. To overcome this issue we propose to look at monoids with only big representations, in the sense made precise in the paper, and undertake a systematic study of such monoids. One of our main tools is Green's theory of cells (Green's relations). A large supply of monoids is delivered by monoidal categories. We consider simple examples of monoidal categories of diagrammatic origin, including the Temperley-Lieb, the Brauer and partition categories, and discuss lower bounds for their representations.
52 pages, many figures, revised version, comments welcome
References in corpus (25)
- A diagrammatic approach to categorification of quantum groups I
- Spiders for rank 2 Lie algebras
- A survey of graphical languages for monoidal categories
- A diagrammatic approach to categorification of quantum groups II
- A diagrammatic approach to categorification of quantum groups III
- A categorification of quantum sl(2)
- sl(3) link homology
- Diagrammatics for Soergel categories
- The two-color Soergel calculus
- Quivers of monoids with basic algebras
- The Blanchet-Khovanov algebras
- Integral presentations of quantum lattice Heisenberg algebras
- Cellular structures using -tilting modules
- Simple transitive 2-representations via (co)algebra 1-morphisms
- Motzkin monoids and partial Brauer monoids
- Two-color Soergel calculus and simple transitive 2-representations
- Functoriality of colored link homologies
- Finitary birepresentations of finitary bicategories
- Semisimplicity of Hecke and (walled) Brauer algebras
- The Modular Temperley-Lieb Algebra
- SL2 tilting modules in the mixed case
- Quivers for SL(2) tilting modules
- Relative cellular algebras
- Trihedral Soergel bimodules
- The center of SL2 tilting modules