International Association for Cryptologic Research

International Association
for Cryptologic Research

IACR News item: 14 September 2021

Aron van Baarsen, Marc Stevens
ePrint Report ePrint Report
In this paper we study cryptographic finite abelian groups of unknown order and hardness assumptions in these groups. Abelian groups necessitate multiple group generators, which may be chosen at random. We formalize this setting and hardness assumptions therein. Furthermore, we generalize the algebraic group model and strong algebraic group model from cyclic groups to arbitrary finite abelian groups of unknown order. Building on these formalizations, we present techniques to deal with this new setting, and prove new reductions. These results are relevant for class groups of imaginary quadratic number fields and time-lock cryptography build upon them.
Expand

Additional news items may be found on the IACR news page.