Now, the modulus arithmetic says that r = ( g to the power x) mod p.Now, since eve is sitting in between and listening to this communication so eve also gets to know p and g.Note that g is also known as the generator and p is known as prime modulus. Lets call the prime number as p and the other number as g. First, both Alice and Bob agree upon a prime number and another number that has no factor in common.Here are the calculation steps followed in this algorithm that make sure that eve never gets to know the final keys through which actual encryption of data takes place. Suppose Alice and Bob follow this key exchange procedure with Eve acting as a man in middle interceptor (or the bad guy). This algorithm uses arithmetic modulus as the basis of its calculation. Though this algorithm is a bit slow but it is the sheer power of this algorithm that makes it so popular in encryption key generation.įor more information on cryptography, read our earlier tutorial on cryptography basics. This algorithm was devices not to encrypt the data but to generate same private cryptographic key at both ends so that there is no need to transfer this key from one communication end to another. The Diffie-Hellman algorithm was developed by Whitfield Diffie and Martin Hellman in 1976. This transfer or rather generation on same cryptographic keys at both sides secretively was made possible by the Diffie-Hellman algorithm. The most challenging part in this type of encryption is the transfer of the encryption key from sender to receiver without anyone intercepting this key in between. Asymmetric Encryption of data requires transfer of cryptographic private key.
0 kommentar(er)
