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.IT2022
Quantum Cryptanalysis of Farfalle and (Generalised) Key-Alternating Feistel Networks
S. Hodžić, A. Roy, E. Andreeva
Farfalle is a permutation-based construction for building a pseudorandom function which has been proposed by G. Bertoni et al. in 2017. In this work, we show that by observing suit…