• Home
 · 
• Math/Dates
 · 
• Diffie Hellman Algorithm

Diffie Hellman Algorithm

Diffie Hellman Algorithm

Rate Diffie Hellman Algorithm

• 1
• 2
• 3
• 4
• 5

(2(2 Vote))

'
' Disclaimer:
' No prime number testing included. This is not an encryption system, it's
' a part of one (generates only <= ~32 bit keys)
'
' Note:
' -----
' (P ^ QtoP) ^ N                = This generates Overflow, So i tweaked it to:
' ((QtoP * P) Mod M) * N        = This works.
'
' ******** Shame on MS for lousy large number support in VB ********
'
' For Recreational/Educational use only
' Code (C) Glenn Larsson ([email protected])
' (All emails asking for support = Thrown away, Read Applied Cryptography!)
' ------------------------------------------------------------------------------

P = Int(Rnd(256) * 256)
Q = Int(Rnd(256) * 256)
N = Int(Rnd(256) * 256)
M = Int(Rnd(256) * 65536)

PtoQ = (P * N) Mod M
QtoP = (Q * N) Mod M

P's Key = ((QtoP * P) Mod M) * N
Q's Key = ((PtoQ * Q) Mod M) * N