One of the important algorithms in public key cryptography is RSA. The RSA is expensive due to using modular exponentiation for greater keys. A parallel method is presented in previous work. The proposed algorithm (CRSA), employs hypercube interconnection network to make RSA parallel. This paper presents the optimization of CRSA along with simulation results. The results of the conducted simulations indicate that this method requires less time to carry out encryption and decryption process compared to the original RSA and the other existing parallel approaches in the literature. These results are evaluated mathematically using time complexity.