Diffie-Hellman Key Exchange Algorithm in Java

• Download source - 83.6 KB
• Download source code from GitHub

Introduction

The Diffie-Hellman Key Exchange algorithm, also called exponential key exchange, is one of the public key exchange algorithm. The algorithm is used for sharing the keys between two parties. The intruder cannot calculate the key until he cracks the private value of one of the parties.

Using the Code

The main part of the code is written in the class "DiffieHellman".

public class DiffieHellman {
    BigInteger p, g;
    public DiffieHellman(){}

    public void genPrimeAndPrimitiveRoot(){
        this.p = BigInteger.valueOf(new PrimeNumberGen().getPrimeNumber());
        this.g = BigInteger.valueOf(new PrimitiveRootGen(this.p.intValue()).getPr());
    }

    public BigInteger getP() {
        return p;
    }

    public BigInteger getG() {
        return g;
    }

    public BigInteger getAliceMessage(BigInteger aliceSecretNumber){
        return this.g.modPow(aliceSecretNumber, this.p);
    }

    public BigInteger getBobMessage(BigInteger bobSecretNumber){
        return this.g.modPow(bobSecretNumber, this.p);
    }

    public BigInteger aliceCalculationOfKey
    (BigInteger bobMessage, BigInteger aliceSecretNumber){
        return bobMessage.modPow(aliceSecretNumber, this.p);
    }

    public BigInteger bobCalculationOfKey
    (BigInteger aliceMessage, BigInteger bobSecretNumber){
        return aliceMessage.modPow(bobSecretNumber, this.p);
    }
}

The algorithm starts with calculating two values "p" and "g", which are public values shared by both users. The "p" is prime number, and "g" is one of the primitive root of "p".

The second step of the algorithm is selecting private values. Assumes the names of parties who are going to share the code are "Alice" and "Bob". Alice selects her secret key as aliceSec and Bob selects his secret key as bobSec.

The third step of the algorithm calculates the message to be shared between parties. Alice calculates her message by:

aliceMsg = g^aliceSec % p

And Bob calculates his message by:

bobMsg = g^bobSec % p

Then, Alice and Bob will share the keys between them.

The next and last step is calculation of key. Alice calculates key from her end by using the formula:

aliceKey = bobMsg^aliceSec % p

And Bob calculates key from his end using the formula:

bobKey = aliceMsg^bobSec % p

The keys calculated by Alice and Bob will be equal and the key cannot be calculated (crack) by third party until he/she knows the secret key of Alice or Bob. Until the secret key is kept as secret, the key will be secured. :)

Screenshot

Points of Interest

It is interesting to see how the Euclidean algorithms are useful in network security and cryptography.

History

• 26^th April, 2020: Initial version