Define discrete logarithm. Explain the procedure of sharing the secret | Cryptography 2076

Cryptography20765 marksDiffie-Helman Key Exchange

Define discrete logarithm. Explain the procedure of sharing the secret key in Diffie Hellman. [5]

For a prime number P and a primitive root a, if: $a^i \equiv b \pmod{P}$ Then i is called the discrete logarithm of the number b for the base a mod P, and is denoted as: $dloga(b) = i$ The difficulty of computing the discrete logarithm (given b, a, and P, finding i) forms the mathematical fou...

For a prime number P and a primitive root a, if: $$a^i \equiv b \pmod{P}$$ Then i is called the discrete logarithm of the number b for the base a mod P, and is denoted as: $$dloga(b) = i$$ The difficulty of computing the discrete logarithm (given b, a, and P, finding i) forms the mathematical fou...

← PreviousAll questions Next question →

Up nextDistinguish between stream cipher and block cipher. Encrypt the message WE ARE IN SAME RAC