网络安全-08：公钥密码学与RSA要点.pptVIP

* To speed up the operation of the RSA algorithm using the private key, can use the Chinese Remainder Theorem (CRT) to compute mod p q separately, and then combine results to get the desired answer. This is approx 4 times faster than calculating “C^d mod n” directly. Note that only the owner of the private key details (who knows the values of p q) can do this, but of course that’s exactly where help is needed, since if e is small then d will be likely be large! * Before the application of the public-key cryptosystem, each participant must generate a pair of keys, which requires finding prim