p = nextprime(random(10^30))
q = nextprime(random(10^25))
n = q * p
e = random(n)
phin = (p - 1) * (q - 1)
while(gcd(e, phin) != 1, e = e + 1)
d = lift(Mod(e, phin) ^ (-1))
log(n) / log(27)

m = 12 + 21 * 27 + 11 * 27 ^ 2 + 27 ^ 3 + 19 * 27 ^ 4 + 26 * 27 ^ 5

E(x) = lift(Mod(x, n) ^ e)
D(x) = lift(Mod(x, n) ^ d)

H(x) = x
S(x) = lift(Mod(x, n) ^ d)

M(x) = lift(Mod(x, n) ^ e)