In case that the p and q are predefined, which the most complicated phase in RSA algorithm. Is it the computation of "m^e mod n" ?

Similar questions and discussions