2 papers
cs.CR2026
BenX: Resource-Sharing Permutations for Computational Integrity
Luca Campa, Thomas De Cnudde, Al Kindi +4
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…
cs.CR2026
A New Algebraic Algorithm for LWE
Luca Campa, Massimo Fumiani, Arnab Roy
The Learning With Errors (LWE) problem, introduced by Regev in 2005, is central to modern cryptography and post-quantum security. The algorithms to solve the search version of the…