Security Estimates for Quadratic Field Based Cryptosystems - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Lecture Notes in Computer Science Year : 2010

Security Estimates for Quadratic Field Based Cryptosystems


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.
Fichier principal
Vignette du fichier
ACISP.pdf (171.33 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00477949 , version 1 (30-04-2010)


  • HAL Id : inria-00477949 , version 1
  • ARXIV : 1004.5512


Jean-François Biasse, Jacobson Michael, Silverster Alan. Security Estimates for Quadratic Field Based Cryptosystems. Lecture Notes in Computer Science, 2010. ⟨inria-00477949⟩
217 View
160 Download



Gmail Facebook X LinkedIn More