Timeline for Trouble detecting cyclic group order crossovers in SECP256K1
Current License: CC BY-SA 4.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 27, 2023 at 8:51 | comment | added | Maltoon Yezi | Yeah, that's what I've meant. We have $n-1$, and to get to $2$, we have to add and not subtract. This would be going "forward". During the addition process, we would be crossing the boundary, which is: $N$. After that, the count will start over, from 1, 2, 3 and forward.... | |
| Oct 24, 2023 at 22:56 | review | Late answers | |||
| Oct 25, 2023 at 10:22 | |||||
| S Oct 24, 2023 at 22:36 | review | First answers | |||
| Oct 25, 2023 at 10:22 | |||||
| S Oct 24, 2023 at 22:36 | history | answered | Justin Wegener | CC BY-SA 4.0 |