(PowerBuilder) Diffie-Hellman Key Exchange (DH)

Diffie-Hellman key exchange (DH) is a cryptographic protocol that allows two parties that have no prior knowledge of each other to jointly establish a shared secret key.

This example demonstrates how two parties (Alice and Bob) can compute an N-bit shared secret key without the key ever being transmitted.

Chilkat ActiveX Downloads ActiveX for 32-bit and 64-bit Windows

integer li_rc
oleobject loo_DhBob
oleobject loo_DhAlice
string p
integer g
integer li_Success
string ls_EBob
string ls_EAlice
string ls_KBob
string ls_KAlice
oleobject loo_Crypt
string ls_SessionKey
string ls_Iv
string ls_CipherText64
string ls_PlainText

// This example requires the Chilkat API to have been previously unlocked.
// See Global Unlock Sample for sample code.

// Create two separate instances of the DH object.
loo_DhBob = create oleobject
// Use "Chilkat_9_5_0.Dh" for versions of Chilkat < 10.0.0
li_rc = loo_DhBob.ConnectToNewObject("Chilkat.Dh")
if li_rc < 0 then
    destroy loo_DhBob
    MessageBox("Error","Connecting to COM object failed")
    return
end if
loo_DhAlice = create oleobject
// Use "Chilkat_9_5_0.Dh" for versions of Chilkat < 10.0.0
li_rc = loo_DhAlice.ConnectToNewObject("Chilkat.Dh")

// The DH algorithm begins with a large prime, P, and a generator, G.  
// These don't have to be secret, and they may be transmitted over an insecure channel.  
// The generator is a small integer and typically has the value 2 or 5.

// The Chilkat DH component provides the ability to use known
// "safe" primes, as well as a method to generate new safe primes.

// This example will use a known safe prime.  Generating
// new safe primes is a time-consuming CPU intensive task
// and is normally done offline.

// Bob will choose to use the 2nd of our 8 pre-chosen safe primes.  
// It is the Prime for the 2nd Oakley Group (RFC 2409) -- 
// 1024-bit MODP Group.  Generator is 2. 
// The prime is: 2^1024 - 2^960 - 1 + 2^64 * { [2^894 pi] + 129093 }
loo_DhBob.UseKnownPrime(2)

// The computed shared secret will be equal to the size of the prime (in bits).
// In this case the prime is 1024 bits, so the shared secret will be 128 bytes (128 * 8 = 1024).
// However, the result is returned as an SSH1-encoded bignum in hex string format.
// The SSH1-encoding prepends a 2-byte count, so the result is going  to be 2 bytes
// longer: 130 bytes.  This results in a hex string that is 260 characters long (two chars
// per byte for the hex encoding).

// Bob will now send P and G to Alice.
p = loo_DhBob.P
g = loo_DhBob.G

// Alice calls SetPG to set P and G.  SetPG checks
// the values to make sure it's a safe prime and will
// return 0 if not.
li_Success = loo_DhAlice.SetPG(p,g)
if li_Success <> 1 then
    Write-Debug "P is not a safe prime"
    destroy loo_DhBob
    destroy loo_DhAlice
    return
end if

// Each side begins by generating an "E"
// value.  The CreateE method has one argument: numBits.
// It should be set to twice the size of the number of bits
// in the session key.

// Let's say we want to generate a 128-bit session key
// for AES encryption.  The shared secret generated by the Diffie-Hellman
// algorithm will be longer, so we'll hash the result to arrive at the
// desired session key length.  However, the length of the session
// key we'll utlimately produce determines the value that should be
// passed to the CreateE method.

// In this case, we'll be creating a 128-bit session key, so pass 256 to CreateE.
// This setting is for security purposes only -- the value
// passed to CreateE does not change the length of the shared secret
// that is produced by Diffie-Hellman.  
// Also, there is no need to pass in a value larger
// than 2 times the expected session key length.  It suffices to
// pass exactly 2 times the session key length.

// Bob generates a random E (which has the mathematical
// properties required for DH).

ls_EBob = loo_DhBob.CreateE(256)

// Alice does the same:

ls_EAlice = loo_DhAlice.CreateE(256)

// The "E" values are sent over the insecure channel.
// Bob sends his "E" to Alice, and Alice sends her "E" to Bob.

// Each side computes the shared secret by calling FindK.
// "K" is the shared-secret.

// Bob computes the shared secret from Alice's "E":
ls_KBob = loo_DhBob.FindK(ls_EAlice)

// Alice computes the shared secret from Bob's "E":
ls_KAlice = loo_DhAlice.FindK(ls_EBob)

// Amazingly, kBob and kAlice are identical and the expected
// length (260 characters).  The strings contain the hex encoded bytes of
// our shared secret:
Write-Debug "Bob's shared secret:"
Write-Debug ls_KBob
Write-Debug "Alice's shared secret (should be equal to Bob's)"
Write-Debug ls_KAlice

// To arrive at a 128-bit session key for AES encryption, Bob and Alice should
// both transform the raw shared secret using a hash algorithm that produces
// the size of session key desired.   MD5 produces a 16-byte (128-bit) result, so
// this is a good choice for 128-bit AES.

// To produce the session key:
loo_Crypt = create oleobject
// Use "Chilkat_9_5_0.Crypt2" for versions of Chilkat < 10.0.0
li_rc = loo_Crypt.ConnectToNewObject("Chilkat.Crypt2")

loo_Crypt.EncodingMode = "hex"
loo_Crypt.HashAlgorithm = "md5"

ls_SessionKey = loo_Crypt.HashStringENC(ls_KBob)

Write-Debug "128-bit Session Key:"
Write-Debug ls_SessionKey

// Encrypt something...
loo_Crypt.CryptAlgorithm = "aes"
loo_Crypt.KeyLength = 128
loo_Crypt.CipherMode = "cbc"

// Use an IV that is the MD5 hash of the session key...

ls_Iv = loo_Crypt.HashStringENC(ls_SessionKey)

// AES uses a 16-byte IV:
Write-Debug "Initialization Vector:"
Write-Debug ls_Iv

loo_Crypt.SetEncodedKey(ls_SessionKey,"hex")
loo_Crypt.SetEncodedIV(ls_Iv,"hex")

// Encrypt some text:

loo_Crypt.EncodingMode = "base64"
ls_CipherText64 = loo_Crypt.EncryptStringENC("The quick brown fox jumps over the lazy dog")
Write-Debug ls_CipherText64

ls_PlainText = loo_Crypt.DecryptStringENC(ls_CipherText64)

Write-Debug ls_PlainText


destroy loo_DhBob
destroy loo_DhAlice
destroy loo_Crypt