def __init__(self): self.p = p self.q = q self.n = RSA.find_n(self, p, q) self.totient = RSA.find_totient(self, p, q) self.e = RSA.find_totient_coprime(self, self.totient) self.d = RSA.find_inverse(self, self.e, self.totient) self.public_key = (n, e)
def test(self): return RSA.find_n(self, 3, 11)