Assuming that you know (n), explain how to compute a 1 mod n for any a

Question:

Assuming that you know Φ(n), explain how to compute a− 1 mod n for any a ∈ ℤ*n using the procedure MODULAR-EXPONENTIATION.

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  book-img-for-question

Introduction to Algorithms

ISBN: 978-0262033848

3rd edition

Authors: Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest

Question Posted: