Preprint
Sep 2026
BenX: Resource-Sharing Permutations for Computational Integrity
Cryptographic hash functions over integers modulo a prime play a decisive role in the efficiency and security of proof systems for computational integrity. Early designs focused on compact arithmetic circuits and efficient software execution, primarily targeting general-purpose CPUs rather than hardware accelerators. T...
Luca Campa, Thomas De Cnudde, Al Kindi et al.
· 0 citations