Timeline for State of the art on attempts to solve the elliptic curve discrete logarithm problem through transfering the problem to a weaker curve
Current License: CC BY-SA 4.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S Dec 9 at 10:06 | history | bounty ended | CommunityBot | ||
| S Dec 9 at 10:06 | history | notice removed | CommunityBot | ||
| S Dec 1 at 8:52 | history | bounty started | user2284570 | ||
| S Dec 1 at 8:52 | history | notice added | user2284570 | Canonical answer required | |
| Nov 14 at 4:50 | comment | added | user2284570 | @kodlu Ok, I rewrote it more formally. Essentially I don t want about papers that fails to build to keep the same scalar. In my case I m thinking about cases that don t necessarily involve the Generator | |
| Nov 14 at 4:47 | history | edited | user2284570 | CC BY-SA 4.0 |
added 20 characters in body
|
| Nov 14 at 4:45 | comment | added | kodlu | I'm sorry that's still unclear to me. If you found the paper or wrote what you are suggesting explicitly it would help the question. What is the discrete logarithm between $F$ and $G$ for example? Define it. | |
| Nov 14 at 4:35 | history | edited | user2284570 | CC BY-SA 4.0 |
added 2 characters in body
|
| Nov 14 at 4:33 | comment | added | user2284570 | @kodlu Simple. I remember about a paper where an elliptic curve is constructed easely but computing 1 that doesn t change the discrete logarithm between $O$ and $F$ rarely happen. | |
| Nov 14 at 1:05 | review | Close votes | |||
| Nov 27 at 18:21 | |||||
| Nov 14 at 0:43 | comment | added | kodlu | "successfully preserving their discrete logarithm relation"? you need to explain that for clarity | |
| Nov 13 at 21:30 | history | asked | user2284570 | CC BY-SA 4.0 |