Sep 27, 2006 - Suppose Alice and Bob have RSA public keys in a file on a server. ... replaced the public keys Bob and Alice won't be able to decrypt correctly ...
Given a RSA key pair with public key (77, 119) and private key (5, 119), how many squaring and multiplication operations do we need to perform to encrypt a plain text M = 66 if the square-and-multiply technique is used for exponentiation?
1.2.
Solution
Given that (m has to be inferior to n): e
c=m mod n m=66, e=77, d=5, n=119 77 c=66 mod 119 1001101 c=66 mod 119 bin
If we use the squaring and multiplication method we will need:
NumberOfBitsIne =7, need 7−1 squaring NumberOfBits1Ine =4, need 4−1 multiplications