Timeline for Kyber prime modulus p and base generator g
Current License: CC BY-SA 4.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 7, 2024 at 17:23 | vote | accept | Bart | ||
| Sep 6, 2024 at 21:35 | history | became hot network question | |||
| Sep 6, 2024 at 16:33 | answer | added | Daniel S | timeline score: 4 | |
| Sep 6, 2024 at 15:06 | comment | added | Bart | That is interesting, but what I do not understand is why I can remove them without breaking the entire algorithm. | |
| Sep 6, 2024 at 14:20 | comment | added | Alex Them | Moreover, without finding a reference through their specification, my best guesses would be: $p$ denotes the modulus (which is prime). You can also find it as $q$ sometimes. This means that the computations of the protocol happen in modular arithmetic with modulus $p$. The base generator $g$ probably denotes the generator of the group that the computations are happening. With a generator, you can "construct" the group using only $g$ and its powers ($g^2,g^3,...$). | |
| Sep 6, 2024 at 14:09 | history | edited | Bart | CC BY-SA 4.0 | edited body |
| Sep 6, 2024 at 14:06 | comment | added | Alex Them | In the title you denote the base generator with $g$ while in the text you denote it as $q$. Could you specify which is the correct one? | |
| S Sep 6, 2024 at 13:35 | review | First questions | |||
| Sep 6, 2024 at 15:58 | |||||
| S Sep 6, 2024 at 13:35 | history | asked | Bart | CC BY-SA 4.0 |