Computing modular exponentiation efficiently is inevitable for the practicability of RSA. Compute the following exponentiations xe mod m applying the squareand-multiply algorithm:
After every iteration step, show the exponent of the intermediate result in binary notation