Talk:Hyperelliptic curve cryptography

	Mathematics portal This article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.MathematicsWikipedia:WikiProject MathematicsTemplate:WikiProject Mathematicsmathematics articles
Low	This article has been rated as Low-priority on the project's priority scale.

Cryptography: Computer science Low‑importance

	This article is within the scope of WikiProject Cryptography, a collaborative effort to improve the coverage of Cryptography on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.CryptographyWikipedia:WikiProject CryptographyTemplate:WikiProject CryptographyCryptography articles
Low	This article has been rated as Low-importance on the importance scale.
	This article is supported by WikiProject Computer science (assessed as Low-importance).

What is the group operation? Does such information belong here, or in Hyperelliptic_curve ?

I'll try to spruce up the article later today with the group operation. It would belong in this article CryptoDerk

Complexity of attacks against hyperelliptic curves

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 ${\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)[reply]

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)[reply]

External links modified

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.

This message was posted before February 2018. After February 2018, "External links modified" talk page sections are no longer generated or monitored by InternetArchiveBot. No special action is required regarding these talk page notices, other than regular verification using the archive tool instructions below. Editors have permission to delete these "External links modified" talk page sections if they want to de-clutter talk pages, but see the RfC before doing mass systematic removals. This message is updated dynamically through the template {{source check}} (last update: 5 June 2024).

If you have discovered URLs which were erroneously considered dead by the bot, you can report them with this tool.
If you found an error with any archives or the URLs themselves, you can fix them with this tool.

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