As we know, we can compute $a^b \pmod{n}$ efficiently using Right-to-left binary method Modular exponentiation.
Assume b is a prime number .
Can we compute directly $(a+1)^b\pmod{n}$ using $a^b\pmod{n}$?
As we know, we can compute $a^b \pmod{n}$ efficiently using Right-to-left binary method Modular exponentiation.
Assume b is a prime number .
Can we compute directly $(a+1)^b\pmod{n}$ using $a^b\pmod{n}$?
No comments:
Post a Comment