Nonuniform polynomial time algorithm to solve decisional Diffie-Hellman problem in finite fields under conjecture (Q4472081)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2079935
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Nonuniform polynomial time algorithm to solve decisional Diffie-Hellman problem in finite fields under conjecture |
scientific article; zbMATH DE number 2079935 |
Statements
3 August 2004
0 references
0.8080646395683289
0 references
0.7941393852233887
0 references
0.7766576409339905
0 references
0.7623490691184998
0 references
0.7586948275566101
0 references
Nonuniform polynomial time algorithm to solve decisional Diffie-Hellman problem in finite fields under conjecture (English)
0 references
