Attributed metadata history
Up to 100 retained publisher events per page for 47120bb7605a35ef2943dfc393f089e00d4ae2fcac6d89a97d80212cef8cbad0. Withdrawals and unavailable references remain attributed to their publishers.
intelligence_src_e53adb99e40ae66258
observed · 2026-10-12 16:25:04 UTC
ePrint Report: The Graded Monoidal Action for Cryptography Jonathan Komada Eriksen, Emil August Hovd Olaisen We give a new framework for constructing post-quantum protocols based on graded monoidal actions. An essential difference between the graded monoidal action framework and the cryptographic group action framework is that our higher-rank problems give rise to infinite structures, where elements do not admit inverses, while cryptographic group actions are finite by definition. Nevertheless, we show that the hard problems for cryptographic group actions reduces to the corresponding family of hard problems for graded monoidal actions. However, the main motivation is that for general graded monoidal actions, the relevant problems admit no known subexponential quantum attacks, while still having enough structure to formulate some protocols based on cryptographic group actions, such as the Diffie-Hellman key-exchange. Our framework can, to the extent we make clear in the paper, be instantiated with the module-action on oriented principally polarized abelian varieties (PPAV's), generalizing the class gr
Fingerprint: 6aab13262198054b3e681deb754e9e7b3ed1b1e309f22c50e398fbf7e069186c
intelligence_src_e53adb99e40ae66258
observed · 2026-10-12 16:25:03 UTC
available
Fingerprint: 366cb966e32414edc1db353849a1ee8d6b8462b83786e04001881ba6594765ad