I wonder if you could recast cryptography in categorical language:

Instead of “groups, rings and fields + probabilistic Turing machines”, you work with objects that stand for resources (channels, keys, random beacons, OT-boxes, etc.) and morphisms that stand for protocols transforming those resources.

Tricks with polynomials and Riemann-Roch spaces. Breaking into the platonic realm to pillage forbidden abstractions. Starknet grantee.

Some papers I found (haven't read and probably goes way over my head):
- Categorical Composable Cryptography: https://arxiv.org/abs/2105.05949
- Abstract / Constructive Cryptography: https://crypto.ethz.ch/publications/files/MauRen11.pdf