Jump to content

Index calculus algorithm

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Lelik (talk | contribs) at 05:10, 27 February 2005. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

In group theory, the Index calculus algorithm algorithm is an algorithm for computing discrete logarithms. This is the best known algorithm for certain groups.

Theory

This article is a stub. You can help Wikipedia by expanding it.

The algorithm

This article is a stub. You can help Wikipedia by expanding it.

In practice

This article is a stub. You can help Wikipedia by expanding it.

The running time of the algorithm is:

This article is a stub. You can help Wikipedia by expanding it.

The space complexity is blah.

This article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Index_calculus_algorithm&oldid=10609442"