The efficiency of solving multiple discrete logarithm problems and the implications for the security of fixed elliptic curves
Hitchcock, Yvonne R., Montague, Paul, Carter, Gary P., & Dawson, Edward P. (2004) The efficiency of solving multiple discrete logarithm problems and the implications for the security of fixed elliptic curves. International Journal of Information Security, 3(2), pp. 86-98.
This paper examines the cryptographic security of fixed versus random elliptic curves over GF(p). It assumes a precomputation for use in breaking the elliptic curve discrete logarithm problem (
Impact and interest:
Citation counts are sourced monthly from and citation databases.
These databases contain citations from different subsets of available publications and different time periods and thus the citation count from each is usually different. Some works are not in either database and no count is displayed. Scopus includes citations from articles published in 1996 onwards, and Web of Science® generally from 1980 onwards.
Citations counts from theindexing service can be viewed at the linked Google Scholar™ search.
|Item Type:||Journal Article|
|Additional Information:||For more information, please refer to the journal’s website (see hypertext link) or contact the author.|
|Keywords:||Elliptic curve discrete logarithm problem (ecdlp), Baby, step giant, step method (bsgs), Pollards rho method, Fixed elliptic curve, Precomputation|
|Divisions:||Past > QUT Faculties & Divisions > Faculty of Science and Technology|
|Copyright Owner:||Copyright 2004 Springer|
|Copyright Statement:||The original publication is available at SpringerLink
|Deposited On:||16 Oct 2007 00:00|
|Last Modified:||29 Feb 2012 13:07|
Repository Staff Only: item control page