Design And Implementation Of Probabilistic MPKC

With the rapid development of science and technology, information security issuesbecome more critical. In recent years, the leak of personal information has sounded thealarm of information security. Since the public key cryptography proposed, there are lots ofpublic key cryptosystems had been produced, these cryptosystems guaranteed the securityof information. But the advent of quantum computers prompted the information society isabout to enter the quantum era, as long as the quantum era is drawing near, the traditionalpublic key cryptosystems tend not to be able to withstand the attack of quantum computers,like such as ECC, RSA and EIGamal which were widely used will be broken. In order to beable to withstand the attack of quantum computers, there are two different solutions, one isquantum cryptography, and the other is post quantum cryptography. The probabilisticmultivariate public key cryptosystem is mainly to construct its plaintext with disturbancesnews. Because the encryption does not affect the original multivariate public keycryptosystem encryption method, therefore, the system can be applied to any kind ofmultivariate public key cryptosystem, without affecting the efficiency of its encryption onthe basis of improved security.This paper proposes two probabilistic MPKC systems, the first is to structure newplaintext with order, the original plaintext contains k elements, and disturbance messagewere calculated by the corresponding function. Then create an empty new plaintext whichcontains n=2kelements. Randomly selects the elements of the new plaintext, theoriginal plaintext is sequentially assigned to the elements of new plaintext which isselected randomly, the disturbance message also sequentially assigned to the otherremaining elements of the new plaintext, at last complete the construction of the newplaintext. In the decryption, copy a new plaintext messages, and calculate its value ofelement of the first group with the function, use the calculated result to compare with thesecond group, and find a corresponding values. If eventually just find correspondingvalues, the decryption is successful. For the second cryptosystem, the difference isdisturbance message assigns randomly to the other remaining elements of the newplaintext. In the decryption, also copy the same new plaintext message, two groups of messages are compared to each other, to find the corresponding values. Due to theperturbation order of the messages of randomness and a certain collision of disturbancemessage itself and the original plaintext message, there may be not just k correspondingvalues. Communications should have a key convention to deal with this situation.According to the above proposal, this paper also completed a specific program, through theresults, verified the correctness and feasibility of the cryptosystems, and at last analyzed theparameter selection and decrypt success rate.