All of the following help in speeding up RSA encryption and decryption except $\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_$

Question $9$ options:

A$)$

using distinct primes p; q

B$)$

choosing a short public exponent e

C$)$

square$-$and$-$multiply algorithm

D$)$

Chinese Remainder Theorem