HomeSort by relevance Sort by last modified time
    Searched full:phi_n (Results 1 - 3 of 3) sorted by null

  /external/chromium-trace/catapult/third_party/gsutil/third_party/rsa/rsa/
_version133.py 282 phi_n = (p-1) * (q-1)
288 if are_relatively_prime(e, n) and are_relatively_prime(e, phi_n): break
290 (d, i, j) = extended_euclid_gcd(e, phi_n)
293 raise Exception("e (%d) and phi_n (%d) are not relatively prime" % (e, phi_n))
295 if not (e * i) % phi_n == 1:
296 raise Exception("e (%d) and i (%d) are not mult. inv. modulo phi_n (%d)" % (e, i, phi_n))
_version200.py 350 phi_n = (p-1) * (q-1)
356 if are_relatively_prime(e, n) and are_relatively_prime(e, phi_n): break
358 (d, i, j) = extended_gcd(e, phi_n)
361 raise Exception("e (%d) and phi_n (%d) are not relatively prime" % (e, phi_n))
364 if not (e * i) % phi_n == 1:
365 raise Exception("e (%d) and i (%d) are not mult. inv. modulo phi_n (%d)" % (e, i, phi_n))
key.py 516 phi_n = (p - 1) * (q - 1)
522 d = rsa.common.inverse(e, phi_n)
524 raise ValueError("e (%d) and phi_n (%d) are not relatively prime" %
525 (e, phi_n))
527 if (e * d) % phi_n != 1:
529 "phi_n (%d)" % (e, d, phi_n))

Completed in 9382 milliseconds