Timeline for NTRU Euclidean algorithm the inverse of f modulo p
Current License: CC BY-SA 4.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 29, 2021 at 2:15 | comment | added | wdc | Thanks, this has been useful for me too. I have a follow-up question: so the Euclidean algorithm usually only runs in Euclidean domains (ED) and when working mod 3 you're running it in $\mathbb{Z}_3[X]$ (right?) which I see is an ED because $\mathbb{Z}_3$ is a field. But if you're working mod 32, then could there be problems as $\mathbb{Z}_{32}[X]$ is no longer an ED? | |
| Mar 4, 2021 at 19:16 | comment | added | Daftyler | Thank you, this is what I was hoping to see, I think I was using a invalid polynomial for my p(x). Thank you for your input! | |
| Mar 4, 2021 at 8:26 | history | answered | Daniel S | CC BY-SA 4.0 |