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.
Document type :
Journal articles
Complete list of metadatas

Cited literature [22 references]  Display  Hide  Download

https://hal.inria.fr/inria-00477949
Contributor : Jean-François Biasse <>
Submitted on : Friday, April 30, 2010 - 2:08:42 PM
Last modification on : Wednesday, March 27, 2019 - 4:41:27 PM
Long-term archiving on : Thursday, September 30, 2010 - 4:42:35 PM

Files

ACISP.pdf
Files produced by the author(s)

Identifiers

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

Collections

Citation

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

Share

Metrics

Record views

437

Files downloads

267