How (Not) to Hash into Class Groups of Imaginary Quadratic Fields?

Seres, István András and Burcsi, Péter and Kutas, Péter (2025) How (Not) to Hash into Class Groups of Imaginary Quadratic Fields? LECTURE NOTES IN COMPUTER SCIENCE, 15598. pp. 303-326. ISSN 0302-9743

Text 2024-034.pdf - Published Version Restricted to Repository staff only Download (1MB) | Request a copy

Abstract

Class groups of imaginary quadratic fields (class groups for short) have seen a resurgence in cryptography as transparent groups of unknown order. They are a prime candidate for being a trustless alternative to RSA groups because class groups do not need a (distributed) trusted setup to sample a cryptographically secure group of unknown order. Class groups have recently found many applications in verifiable secret sharing, secure multiparty computation, transparent polynomial commitments, and perhaps most importantly, in time-based cryptography, i.e., verifiable delay functions, (homomorphic) time-lock puzzles, timed commitments, etc. However, there are various roadblocks to making class groups widespread in practical cryptographic deployments. We initiate the rigorous study of hashing into class groups. Specifically, we want to sample a uniformly distributed group element in a class group such that nobody knows its discrete logarithm with respect to any public parameter. We point out several flawed algorithms in numerous publicly available class group libraries. We further illustrate the insecurity of these hash functions by showing concrete attacks against cryptographic protocols, i.e., verifiable delay functions, if they were deployed with one of those broken hash-to-class group functions. We propose two families of cryptographically secure hash functions into class groups. We implement these constructions and evaluate their performance. We release our implementation as an open-source library.

Actions (login required)

Edit Item