3 citations · 3 across the 1 of their papers we have counts for
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.CR2023★ 3 cited
Arion: Arithmetization-Oriented Permutation and Hashing from Generalized Triangular Dynamical Systems
Arnab Roy, Matthias Johann Steiner, Stefano Trevisani
In this paper we propose the (keyed) permutation Arion and the hash function ArionHash over for odd and particularly large primes. The design of Arion is based on th…