Question

1. Assume that in an implementation of the RSA cryptosystem one modular squar- ing takes 75% of the time of a modular multiplication. How much quicker is one encryption on average if instead of a 2048-bit public key the short exponent e

Answer 1

Answer:

3 times faster

Explanation:

The full form of RMS is Rivest–Shamir–Adleman. It refers to the public key crypto-system which is mainly used for securing the data transmission. It is one of the oldest algorithm.

The time taken bu modular squaring is 75 percent of the time required by the modular multiplication. Therefore, one encryption works three times quicker on an average if the short exponent of $e=2^{16}+1$ is used instead of the 2048 bit public key.