Talk:Discrete logarithm: Difference between revisions

From Citizendium
Jump to navigation Jump to search
imported>David E. Volk
m (New page: {{subpages}})
 
imported>Sandy Harris
No edit summary
 
Line 1: Line 1:
{{subpages}}
{{subpages}}
== "A quasi-polynomial algorithm for discrete logarithm ..." ==
An attack published last year.  It is not the first paper along these lines & may not be the last. [http://hal.inria.fr/hal-00835446/] Looks nasty, but I cannot really evaluate it. Any mathematicians about who could take a look? [[User:Sandy Harris|Sandy Harris]] 03:39, 24 March 2014 (UTC)

Latest revision as of 21:39, 23 March 2014

This article is developed but not approved.
 Main Article
 Discussion
Related Articles  [?]
Bibliography  [?]
External Links  [?]
Citable Version  [?]
 
To learn how to update the categories for this article, see here. To update categories, edit the metadata template.
 Definition:  The problem of finding logarithms in a finite field. [d] [e]
Checklist and Archives
 Workgroup category:  Mathematics [Editors asked to check categories]
 Talk Archive:  none  English language variant:  American English

"A quasi-polynomial algorithm for discrete logarithm ..."

An attack published last year. It is not the first paper along these lines & may not be the last. [1] Looks nasty, but I cannot really evaluate it. Any mathematicians about who could take a look? Sandy Harris 03:39, 24 March 2014 (UTC)

Retrieved from "https://citizendium.org/wiki/index.php?title=Talk:Discrete_logarithm&oldid=390453"