An Efficient Hash Function for Imaginary Class Groups

ePrint Report: An Efficient Hash Function for Imaginary Class Groups

Kostas Kryptos Chalkias, Jonas Lindstrøm, Arnab Roy

This paper presents a new efficient hash function for imaginary class groups. Many class group based protocols, such as verifiable delay functions, timed commitments and accumulators, rely on the existence of an efficient and secure hash function, but there are not many concrete constructions available in the literature, and existing constructions are too inefficient for practical use cases.


Our novel approach, building on …

class eprint report function functions hash hash function protocols report