# Is the private key static or variable key in the elgamal algorithm?

1. Bashir chooses a large random prime p and a primitive root α modulo p.
2. Bashir then chooses a random integer a with 2 ≤ a < p - 1 and computes α^a mod p.
3. Bashir’s public key is (p,α,α^a) and his private session key is a.

Enciphering stage consists of the following steps:

1. Amina obtains Bashir’s public key (p,α,α^a).
2. She chooses a random natural number b < p - 1.
3. She computes α^b mod p and mα^ab mod p.
4. Amina then sends the cipher text c = (α^b,mα^ab) to Bashir.

Deciphering stage consists of the following steps:

1. Bashir uses his private key to compute (α^b )^(-a) mod p.
2. Then he deciphers m by computing (α^b )^(-a) .mα^ab mod p.

I understood this algorithm but I have Wondered simple

Imagine that we have a message consists of four parts (block data) and want Amina encrypted and sent to Bashir.

Is Amina used the same Private Key (b) Of four parts or generate a new private key for each part of the message During the session encryption.