Annotated edit history of
ElGamal version 1, including all changes.
View license author blame.
| Rev |
Author |
# |
Line |
| 1 |
CraigMckenna |
1 |
ElGamal cryptosystem: |
| |
|
2 |
Let p be a prime so that the discrete log problem in Zp is 'intractable' ;let 'a' be a primitive element modulo p and b=a''s'' (mod p )for some s. |
| |
|
3 |
Keep s secret;make p,a,b public. |
| |
|
4 |
|
| |
|
5 |
A message x is to e encrypted as an ordered pair |
| |
|
6 |
|
| |
|
7 |
(a''k'' (mod p ),xb''k'' (mod p )) |
| |
|
8 |
|
| |
|
9 |
where k is a (secret)random number chosen (for one use only) by the encoder. |
