基于概率的公钥密码体制研究-基础数学专业论文.docxVIP

Abstract：Before Abstract： Before 1984。S．Goldwasser and S．Macali proposed probability public—key cryptography(PPC)，all public—key cryptosystems have all sorts of shortages for their certainty．Because publ ic—key cyrptosystem uses trapdoor one—way function厂O)，the possibility of calculate x or some part information of x from厂@)can not be excluded．However，PPC encrypto per bit of plaintexts， SO i t can overcome the shortage of certain publ ic—key cryptosystem．However， probability cryptosystem is not perfect，a lot of research finds that the system has the shortages such as too large expansion rate，unable signature and easy to be at tacked． Base on above background，this paper does some research on probability CryptOsystem． The first part of this paper introduces the development of cryptologic technique，the constitute of cryptosystem and the theory of digital signature． It also introduces the background and significance of PPC，sorts of common PPC and its mathematical base． The second part builds a safe and high effective RSA based PPC by the one—‘way character of trapdoor function．The improved algorithm maintains security of old one，and reduces expansion rate of ciphertexts．What’S more，this paper bui lds a digi tal signature scheme，and analyses the securi ty of new algori thm and digi tal signature scheme． The third part studies PPC which proposed by Pal l ier—Pointcheval in 1999， without lowering the security，this part improved a one—way trapdoor permutation with characters of composite residuosity class．The efficiency of encrytion and decryption is improved through comparison．The digital signature which is obtained from improved algorithm are RSA[n，疗】security as wel l as the new scheme． The forth part analyses an algorithm 1 ike X。-sin2(眈“)．A new chaos map 2 中央民族大学硕士毕业论文 中央民族大学硕士毕业论文 PAGE PAGE 3 is proposed which can solve the problems the old one has. Changes the mul tiple to square of the first iteration function，then it can resist the attack of continued fractions