Lecture Notes in Computer Science, 2000, Volume 1976/2000, 234-247, DOI: 10.1007/3-540-44448-3_18

Security of Cryptosystems Based on Class Groups of Imaginary Quadratic Orders

Safuat Hamdy and Bodo Möller

View Related Documents

Abstract

In this work we investigate the dificulty of the discrete logarithm problem in class groups of imaginary quadratic orders.In particular, we discuss several strategies to compute discrete logarithms in those class groups.Based on heuristic reasoning, we give advice for selecting the cryptographic parameter, i.e. the discriminant, such that cryptosystems based on class groups of imaginary quadratic orders would offer a similar security as commonly used cryptosystems.

Fulltext Preview

Image of the first page of the fulltext document