Review Note
Last Update: 05/15/2024 08:24 PM
Current Deck: Algorithms and Data Structures::El Gamal Encryption
PublishedCurrently Published Content
Front
How do we generate a public key for el gamal encryption
Back
- Choose a private key, \(x\)
- Choose a prime \(p\) and a primative root \(g\), which is a generator of \(\mathbb{Z}_p\). I.e. \(\left< g \right> = \{ g^0, g^1, \dots, g^{p-1}\} = \mathbb{Z}_p\)
- The public key is \((p, g, g^x \space mod \space p)\)
No published tags.
Pending Suggestions
No pending suggestions for this note.