Timeline for If we allow DH operations in addition to exponentiation and multiplication can we get a lower bound for discrete logarithm?
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 20 at 12:13 | comment | added | Daniel Weber | It uses the size of the group and it being abelian, from what I could see, that's it | |
| Mar 20 at 8:24 | comment | added | Turbo | @CommandMaster I do not think the result is in Shoup's generic group model as you are talking about many 'cases' which means Maurer uses structure of the group and not a generic model. | |
| Mar 20 at 8:24 | history | edited | Turbo | CC BY-SA 4.0 |
added 54 characters in body
|
| Mar 20 at 5:03 | comment | added | Daniel Weber | The paper "Towards the Equivalence of Breaking the Diffie-Hellman Protocol and Computing Discrete Logarithms" by Maurer seems to suggest that for many cases it's fairly easy (although you do need a short advice string) | |
| Mar 20 at 4:51 | comment | added | poncho | @CommandMaster: the Diffie-Hellman operation is: with inputs $G^a, G^b$, compute the value $G^{ab}$. Quite common when talking about crypto; probably less so in general math... | |
| Mar 20 at 3:49 | comment | added | Daniel Weber | Could you clarify what you mean by Diffie-Hellman operations? | |
| Mar 20 at 3:35 | history | asked | Turbo | CC BY-SA 4.0 |