Timeline for lower bound for solve ECDLP
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 20, 2016 at 11:22 | comment | added | Meysam Ghahramani | @MaxAlekseyev, for fixed $j,d$ suppose $m'=(\sum\limits_{i=0}^{\ell-d+j} k_i \cdot 2^i)$. | |
| Jan 20, 2016 at 3:13 | comment | added | Max Alekseyev | This is confusing. I do not see any $m'$ in the original question. | |
| Jan 19, 2016 at 12:57 | comment | added | Meysam Ghahramani | @MaxAlekseyev, We have several $m'P$, so that $m'=\lfloor\frac{k}{2^t}\rfloor$. | |
| Jan 16, 2016 at 5:47 | comment | added | Max Alekseyev | Isn't that the same as if we are simply given $\ell-d+j$ lowest bits of $k$, i.e., $k_0, k_1, \dots, k_{\ell-d+j}$ ? | |
| Jan 13, 2016 at 19:51 | history | asked | Meysam Ghahramani | CC BY-SA 3.0 |