A computational category-theoretic approach to cryptography and average-case complexity

MaRDI QIDQ7231706zbMATH OpenFDO

Authors Hart Montgomery, Sikhar Patranabis

Publication date 22 April 2026

Published in Mathematical Cryptology (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial 4.0 International

Full work available at URL https://journals.flvc.org/mathcryptology/article/view/134668

zbMATH Keywords

category theorycomputational complexitycryptographic foundations

Mathematics Subject Classification ID

Algebraic number theory computations (11Y40) Cryptography (94A60)

This page was built for publication: A computational category-theoretic approach to cryptography and average-case complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7231706)