Sciweavers

ACISP
2010
Springer

Security Estimates for Quadratic Field Based Cryptosystems

14 years 13 days ago
Security Estimates for Quadratic Field Based Cryptosystems
Abstract. We describe implementations for solving the discrete logarithm problem in the class group of an imaginary quadratic field and in the infrastructure of a real quadratic field. The algorithms used incorporate improvements over previously-used algorithms, and extensive numerical results are presented demonstrating their efficiency. This data is used as the basis for extrapolations, used to provide recommendations for parameter sizes providing approximately the same level of security as block ciphers with 80, 112, 128, 192, and 256-bit symmetric keys.
Jean-François Biasse, Michael J. Jacobson,
Added 26 Oct 2010
Updated 26 Oct 2010
Type Conference
Year 2010
Where ACISP
Authors Jean-François Biasse, Michael J. Jacobson, Alan K. Silvester
Comments (0)