49. ECDSA 256 bit Public Key:
AAAAE2VjZHNhLXNoYTItbmlzdHAyNTYAAAAIbmlzdHAyN
TYAAABBBCv5hlgEJBGfQfF/4RdBDMv0hiaeNbwqwkyW4n
tYsUUroqqFQMROgYSdHr2bqmX0BCX87l95Hynh2nUPxbO
vWtg=
50. RSA 2048 bit Public Key:
AAAAB3NzaC1yc2EAAAADAQABAAABAQD4XK2ooKXQZFIrz
Tlu6sIVOTdnLDcKc1Qn/WvrGCBFRx5jTfKlJflCVb0Bdh
PayaYwibMzu87rn6IzfKdc3yEivcRIKJ0Vv/z86jjbK1V
7zlTXyhvp0I2IUgL46HTFQVykn88dcj0CX0vuuITfr+sH
jSLG8icBrZHOoiAXYI8xdbZFZ5BZFp5IbeD5QZ2BNotK1
SkMAt1ls2AZD48toBoX0lMiWf7pufdviQw8GIkQo7Jm52
QDFPj2QPUocVLeqCvzreWgu0SSfaIEDUMScM9alS/OBaj
rorQI9/eT85H57sv3che8ascbwN48EpQngBwwzylUl0Wm
sjYneybGW8xT
61. def modexp( base, exp, mod ):
out = base if (exp[0] == 1) else 1
for i in range(1,len(exp)):
out = (out * out) % mod;
if exp[i] == 1:
out = (out * base) % mod
return out
62. def modexp( base, exp, mod ):
out = base if (exp[0] == 1) else 1
for i in range(1,len(exp)):
out = (out * out) % mod;
if exp[i] == 1:
out = (out * base) % mod
return out