Timeline for Is this variant of Diffie-Hellman viable and quantum resilient?
Current License: CC BY-SA 4.0
52 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Dec 9, 2020 at 15:51 | history | edited | fgrieu♦ | CC BY-SA 4.0 |
Fix an error on the code' scaling of the shared secret
|
Dec 9, 2020 at 15:31 | history | edited | fgrieu♦ | CC BY-SA 4.0 |
Polish the code
|
Dec 9, 2020 at 15:06 | history | edited | fgrieu♦ | CC BY-SA 4.0 |
Solve the puzzle when $x$ is unknown.
|
Dec 8, 2020 at 14:42 | history | edited | fgrieu♦ | CC BY-SA 4.0 |
Fix a comment in code
|
Dec 8, 2020 at 13:14 | history | edited | fgrieu♦ | CC BY-SA 4.0 |
Polish
|
Dec 8, 2020 at 9:57 | history | edited | fgrieu♦ | CC BY-SA 4.0 |
Polish
|
Dec 8, 2020 at 9:44 | history | edited | fgrieu♦ | CC BY-SA 4.0 |
Polish
|
Dec 8, 2020 at 9:32 | history | edited | fgrieu♦ | CC BY-SA 4.0 |
Attacks only get better
|
Dec 8, 2020 at 9:24 | history | edited | fgrieu♦ | CC BY-SA 4.0 |
Attacks only get better
|
Dec 7, 2020 at 17:01 | history | edited | fgrieu♦ | CC BY-SA 4.0 |
typo
|
Dec 7, 2020 at 7:56 | history | edited | fgrieu♦ | CC BY-SA 4.0 |
Polish
|
Dec 7, 2020 at 7:51 | history | edited | fgrieu♦ | CC BY-SA 4.0 |
Polish
|
Dec 7, 2020 at 7:45 | history | edited | fgrieu♦ | CC BY-SA 4.0 |
Give defintion.
|
Dec 6, 2020 at 23:42 | history | edited | fgrieu♦ | CC BY-SA 4.0 |
Answer last point
|
Dec 6, 2020 at 22:07 | history | edited | fgrieu♦ | CC BY-SA 4.0 |
Polish
|
Dec 6, 2020 at 21:59 | history | edited | fgrieu♦ | CC BY-SA 4.0 |
Polish
|
Dec 6, 2020 at 21:47 | history | edited | fgrieu♦ | CC BY-SA 4.0 |
Explicit method
|
Dec 6, 2020 at 16:36 | history | edited | fgrieu♦ | CC BY-SA 4.0 |
Link to example
|
Dec 6, 2020 at 16:27 | history | edited | fgrieu♦ | CC BY-SA 4.0 |
Simplify the Ask Wolfram quesry
|
Dec 6, 2020 at 15:58 | history | edited | fgrieu♦ | CC BY-SA 4.0 |
Show an Ask Wolfram query
|
Dec 6, 2020 at 10:06 | history | edited | fgrieu♦ | CC BY-SA 4.0 |
Polish
|
Dec 5, 2020 at 16:58 | vote | accept | Modal Nest | ||
Dec 5, 2020 at 14:12 | history | edited | fgrieu♦ | CC BY-SA 4.0 |
Polish
|
Dec 5, 2020 at 11:13 | history | edited | fgrieu♦ | CC BY-SA 4.0 |
Polish
|
Dec 5, 2020 at 11:03 | history | edited | fgrieu♦ | CC BY-SA 4.0 |
Polish
|
Dec 5, 2020 at 10:47 | history | edited | fgrieu♦ | CC BY-SA 4.0 |
Polish
|
Dec 5, 2020 at 10:41 | history | edited | fgrieu♦ | CC BY-SA 4.0 |
Polish
|
Dec 5, 2020 at 9:36 | history | edited | fgrieu♦ | CC BY-SA 4.0 |
Polish
|
Dec 5, 2020 at 9:12 | history | edited | fgrieu♦ | CC BY-SA 4.0 |
Make it simple
|
Dec 5, 2020 at 9:06 | history | undeleted | fgrieu♦ | ||
Dec 5, 2020 at 9:05 | history | edited | fgrieu♦ | CC BY-SA 4.0 |
Make it simple
|
Dec 5, 2020 at 6:27 | history | edited | fgrieu♦ | CC BY-SA 4.0 |
added 1185 characters in body
|
Dec 4, 2020 at 18:29 | history | deleted | fgrieu♦ | via Vote | |
Dec 4, 2020 at 18:27 | history | undeleted | fgrieu♦ | ||
Dec 4, 2020 at 18:27 | history | edited | fgrieu♦ | CC BY-SA 4.0 |
Oups
|
Dec 4, 2020 at 18:19 | history | deleted | fgrieu♦ | via Vote | |
Dec 4, 2020 at 18:01 | history | edited | fgrieu♦ | CC BY-SA 4.0 |
Polish
|
Dec 4, 2020 at 17:50 | history | edited | fgrieu♦ | CC BY-SA 4.0 |
Polish
|
Dec 4, 2020 at 16:44 | history | edited | fgrieu♦ | CC BY-SA 4.0 |
Polish
|
Dec 4, 2020 at 16:03 | history | edited | fgrieu♦ | CC BY-SA 4.0 |
Polish
|
Dec 4, 2020 at 15:57 | history | edited | fgrieu♦ | CC BY-SA 4.0 |
Answer was changed to comment by Maarten Bodewes
|
Dec 4, 2020 at 15:27 | history | edited | fgrieu♦ | CC BY-SA 4.0 |
Polish
|
Dec 4, 2020 at 15:16 | history | edited | fgrieu♦ | CC BY-SA 4.0 |
Polish
|
Dec 4, 2020 at 15:10 | comment | added | Modal Nest | @Eric Järpe: Thank you for the response! Apologies if you think I am misrepresenting. However you refer to it yourself as version 2. "Alternatively, a one-layer security protocol may be implemented by letting the initial number be public. This version of the algorithm is referred to as Version 2. Then, all the security depends on M1FP and the secrecy of a and b" | |
Dec 4, 2020 at 15:03 | history | edited | fgrieu♦ | CC BY-SA 4.0 |
Polish
|
Dec 4, 2020 at 14:51 | history | edited | fgrieu♦ | CC BY-SA 4.0 |
Polish
|
Dec 4, 2020 at 14:40 | history | edited | fgrieu♦ | CC BY-SA 4.0 |
Polish
|
Dec 4, 2020 at 14:39 | comment | added | Eric Järpe | Thank you for your interest in this paper. But I am sorry that you have so little appreciation for it. The security of this method depends of course (as noted in the paper) on whether the initial numbers are public or not. Also, not knowing the length of the numbers transmitted or only knowing a very high upper bound of this may serve as a security against launching the simple attack (transferring the decimals to integers) which is suggested. /Regards, Eric Järpe (the author) | |
Dec 4, 2020 at 14:14 | history | edited | fgrieu♦ | CC BY-SA 4.0 |
Polish
|
Dec 4, 2020 at 13:59 | history | edited | fgrieu♦ | CC BY-SA 4.0 |
Polish
|
Dec 4, 2020 at 13:48 | history | edited | fgrieu♦ | CC BY-SA 4.0 |
added 474 characters in body
|
Dec 4, 2020 at 13:38 | history | answered | fgrieu♦ | CC BY-SA 4.0 |