Timeline for Is Diffie-Hellman less secure when A and B select the same random number? [duplicate]
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 9, 2021 at 23:24 | history | closed |
kelalaka CommunityBot |
Duplicate of Diffie-Hellman: difficulty of computing $g^{x^2}$ given $g^x$? | |
| Nov 9, 2021 at 23:13 | comment | added | Umbral Reaper | Ah, thank you! I knew that I was just missing enough knowledge to phrase my question properly. | |
| Nov 9, 2021 at 23:11 | comment | added | kelalaka | It is called Square Diffie-Hellman.Yes attacker can observe the event if they are lucky. Here another Show How to Efficiently Solve the Computational Diffie-Hellman Assumption given an Algorithm that Solves the Square-DH Problem | |
| Nov 9, 2021 at 23:10 | comment | added | Umbral Reaper | The question came up in a discussion around the Diffie-Hellman key exchange, and Google did not provide an answer. From this question, I understand that the probability is somewhere in the order of 1/((2^256)^2). However, my understanding of the mechanism of Diffie-Hellman is not much deeper than the paint analogy, in which it would be trivial to detect that A and B are using the same secret key. | |
| Nov 9, 2021 at 22:58 | comment | added | kelalaka | Welcome to Cryptography.SE. What is the origin of this question? Do you know the probability of it? negligible! So you asking given $g^x$ find $g^{x^2}$. What have you tried? And note we have dupes! | |
| S Nov 9, 2021 at 22:51 | review | First questions | |||
| Nov 9, 2021 at 23:25 | |||||
| S Nov 9, 2021 at 22:51 | history | asked | Umbral Reaper | CC BY-SA 4.0 |