Based On The Probability Of Rsa Public Key Cryptography Algorithm

RSA public key cryptography was created by Rivest, Shamir and Adleman in 1978, it represents the public key cryptography system. RSA is the most universe application in the public key cryptography, and has taken the important position in encryption,discryption and signature. It is deterministic cryptology and has no security against chosen cleartext attachs, so the probabilistic encryption scheme has been proposed by Goldwasser and Micali in 1984, but it can not be used because of its higher message expansion. A new system is designed by Blum and Goldwasser in 1985, which can lower the message expansion to 1 + k/t , and it has been presented to meet application needs. There are many good public key cryptography schemes recently, but the schemes' message expansion is still higher.The paper works on RSA public key cryptography, and proposes RSA probabilistic public key cryptography scheme. The following is my main research works:1. The paper designs a probabilistic cryptography scheme based on RSA, which has polynomial secure and the message expansion is 1. The improved scheme is designed because of the low efficiency of longer message, it is proved have polynomial security and the writer analyses it's function .2. The paper presents a probabilistic digital signature scheme based on RSA and a program is designed based on this algorithm, then we get an example of this digital signature scheme by operating the program.