Talk:Hyperelliptic curve cryptography

The article currently contains the following claim:

: Also, for hyperelliptic curves of genus higher that 3, there are known efficient sub-exponential attacks.

I doubt that this claim is correct. E.g., the paper P.Gaudry, "An Algorithm for Solving the Discrete Log Problem on Hyperelliptic Curves", presented at Eurocrypt 2000 gives an algorithm that under a minor practical assumption computes discrete logarithms in time $\{\backslash rm\; O\}(q^\{2g/(g+1)\})$ on hyperelliptic curves of genus g over a field of order q. While this is faster than e.g. Pollard rho this is not sub-exponential. Has a better attack been published or did I misinterpret Gaudry's result? 85.2.114.231 (talk) 19:55, 5 July 2008 (UTC)

I think you are right. Although there are some improvement to the Gaudry's result, the complexity of these attacks for small genus is slightly better than Pollard's Rho and still exponential. However, for large genus, index-calculus is subexponential. Thank you for your correction.Bossudenotredame (talk) 07:18, 1 December 2008 (UTC)

Hello fellow Wikipedians,

I have just modified one external link on Hyperelliptic curve cryptography. Please take a moment to review my edit. If you have any questions, or need the bot to ignore the links, or the page altogether, please visit this simple FaQ for additional information. I made the following changes:

• Added archive https://web.archive.org/web/20121114015633/http://certivox.com/solutions/miracl-crypto-sdk/ to http://certivox.com/solutions/miracl-crypto-sdk

When you have finished reviewing my changes, you may follow the instructions on the template below to fix any issues with the URLs.

{{sourcecheck|checked=false|needhelp=}}

Cheers.—InternetArchiveBot (Report bug) 13:51, 9 November 2017 (UTC)