Krys

︠24b8a16a-3fd1-4898-bbe0-6f240f382b9ds︠

#p = next_prime(2^100)
p = 233 #musi byc pierwsza
F = GF(p)
#g = F(primitive_root(p)) # g wszystko jedno jakie chyba
g = F(3)

print "p =", p, "and g =", g

a = randrange(1000) # losowanie od 0 do p chyba

A = (g**a)%p
print "public key A =", A

b =  randrange(1000) # losowanie od 0 do p
B = (g**b)%p
sB = (A**b)%p
sA = (B**a)%p
print "public key B =", B
print "private key sA = ", sA, "\nprivate key sB =", sB


print "Is it the same private key?"
sB == sA

#time discrete_log(A,g)
︡7765ce03-2665-4331-87dc-63f251e643ed︡{"stdout":"p = 233 and g = 3\n"}︡{"stdout":"public key A = 116\n"}︡{"stdout":"public key B = 103\n"}︡{"stdout":"private key sA =  49 \nprivate key sB = 49\n"}︡{"stdout":"Is it the same private key?\n"}︡{"stdout":"True\n"}︡{"done":true}