Based on cryptography

1. You encrypt a message using the RSA encryption system as t modn, where t,e b require 100 (log2 a) - (log2 log2a) (log2 log2 log2 a) binary operation to find ab and to find the quotient and remainder when a is divided by b You may assume that the number of operations in the fas t exponentiation algorithm is twice more than the number of operations needed for all squarin The number of operations needed to convert the m number is small and can be ignored. You may also ignore the difference between n and (n) In part (b) you have to solve a transcendental equation. Dur ing the calculations you can round the results of iterations to the nearest integer gs essage into a ir- 1. You encrypt a message using the RSA encryption system as t modn, where t,e b require 100 (log2 a) - (log2 log2a) (log2 log2 log2 a) binary operation to find ab and to find the quotient and remainder when a is divided by b You may assume that the number of operations in the fas t exponentiation algorithm is twice more than the number of operations needed for all squarin The number of operations needed to convert the m number is small and can be ignored. You may also ignore the difference between n and (n) In part (b) you have to solve a transcendental equation. Dur ing the calculations you can round the results of iterations to the nearest integer gs essage into a ir