Web: http://arxiv.org/abs/2201.01805

Jan. 7, 2022, 2:20 a.m. | Mikhail Khovanov, Maithreya Sitaraman, Daniel Tubbenhauer

cs.CR updates on arXiv.org arxiv.org

The linear decomposition attack provides a serious obstacle to direct
applications of noncommutative groups and monoids 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, …

cryptography math

More from arxiv.org / cs.CR updates on arXiv.org

Head of Information Security

@ Canny | Remote

Information Technology Specialist (INFOSEC)

@ U.S. Securities & Exchange Commission | Washington, D.C.

Information Security Manager - $90K-$180K - MANAG002176

@ Sound Transit | Seattle, WA

Sr. Software Security Architect

@ SAS | Remote

Senior Incident Responder

@ CipherTechs, Inc. | Remote

Data Security DevOps Engineer Senior/Intermediate

@ University of Michigan - ITS | Ann Arbor, MI