- Hellman Diffie key exchange C
no vote
Application background - Diffie Hellman key exchange (D – h) [Note 1] is a specific method to exchange keys in the public channel safely. It is the first public key protocol, and the original concept is Ralph Merkle. [1] [2] d – h is one of the earliest examples of public key exchange in the field of cryptography. Traditionally, secure encrypted communication is required between the two parties. They first exchange keys on some secure physical channels, such as paper key list by a trusted courier. Diffie Hellman key exchange method enables both parties to establish a shared key without prior knowledge in an insecure channel. This key can be used to encrypt subsequent communications using a symmetric key cipher. Key technology: the original implementation of the simplest protocol for cryptanalysis uses the multiplication group of integer module P, where p is a prime number and G is an original root module P. this is an example of the protocol, with the blue non secret value and the red secret value. Alice and Bob agreed to use a module P = 23 and g = 5 (which is a primitive root module 23). Alice chooses a secret integer a = 6 and sends it to Bob = GA mod p a = 56 mod 23 = 8 Bob chooses a secret integer B = 15 and then Alice B = GB mod p B = 515 mod 23 = 19 Alice calculates = Ba mod 23 = 2 Bob calculates s = AB mod p = 815 mod 23 = 2 Alice and Bob now share a secret (No.2). Alice and Bob reach the same value because: Standard β = (gallium), B-mode, β = (gallium), B, mod, mod, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, Bob, (GA mod p) B mod p = (56 divided by 23) 15 mod, 23. Note that only one, B, and (GAB model P = GBA mod p) is confidential. All other values of phosphorus, gram, gallium, GA, and UK mod standards are in clear. Once Alice and Bob compute the shared secret, they can use it as an encryption key that only they know, sending messages over the same open communication channel.