Using equivalence classes to accelerate solving the discrete logarithm problem in a short interval (Q3562909)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Using equivalence classes to accelerate solving the discrete logarithm problem in a short interval |
scientific article; zbMATH DE number 5713641
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Using equivalence classes to accelerate solving the discrete logarithm problem in a short interval |
scientific article; zbMATH DE number 5713641 |
Statements
Using Equivalence Classes to Accelerate Solving the Discrete Logarithm Problem in a Short Interval (English)
0 references
28 May 2010
0 references
Discrete Logarithm Problem (DLP)
0 references
elliptic curves
0 references
negation map
0 references
efficiently computable group homomorphisms
0 references
0.8764015436172485
0 references
0.8497629761695862
0 references
0.845377504825592
0 references
0.8325361013412476
0 references
0.8094506859779358
0 references
