Timeline for How can the Stern's algorithm be used to attack McEliece?
Current License: CC BY-SA 4.0
2 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 30, 2020 at 19:18 | comment | added | Calmarius | In the meantime I think I found the answer. I tried to understand Stern's paper. And it appears the algorithm doesn't really cares about what matrix you throw at it, it doesn't even need to be the check matrix for a linear code. Which explains why the algorithm works. You know that the length of the word you look for and an algorithm fiddles with the indexes until it finds it (or not). | |
| Oct 28, 2020 at 21:49 | history | answered | kodlu | CC BY-SA 4.0 |