論文英語翻譯

論文英語翻譯

ID:38527700

大?。?6.37 KB

頁數(shù):5頁

時(shí)間:2019-06-14

論文英語翻譯_第1頁
論文英語翻譯_第2頁
論文英語翻譯_第3頁
論文英語翻譯_第4頁
論文英語翻譯_第5頁
資源描述:

《論文英語翻譯》由會(huì)員上傳分享,免費(fèi)在線閱讀,更多相關(guān)內(nèi)容在教育資源-天天文庫。

1、PublicKeyCryptologyIn1978,RonaldRivest,AdiShamir,andLeonardAdelmanpublished“AMethodforObtainingDigitalSignaturesandPublicKeyCryptosystems.”Inthispaper,theauthorsdescribeamethodofsendingcodedmessagesusingapairofpubliclyavailableintegers.Thismethodiswidelyc

2、alledtheRSApublickeycryptosystem.WebeginwitharesultoncongruencesthatextendsFermat’sLittleTheorem.Theorem1Supposethatpandqaredistinctprimesandkisanyinteger.Then(a)ForanyintegerawithGCD(a,pq)=1,a^k(p-1)(q-1)≡1(modpq)(1)(b)Foranyintegera,a^k(p-1)(q-1)+1≡a(mo

3、dpq)(2)Proof(a)IfGCD(a,pq)=1,thenaisnotdivisiblebyporq;itisrelativelyprimetoboth.ThusbyFermat’sTheorem,wohavea^p-1≡1(modp),andsoa^k(p-1)(q-1)≡1^k(q-1)=1(modp).Similarly,a^k(p-1)(q-1)≡1(modq).Thusthereexistintegersrandswitha^k(p-1)(q-1)=1+rp=1+sq.Itfollows

4、thatrp=sq,andsinceqisnotdivisiblebyp,smustbe,says=pt.Thena^k(p-1)(q-1)=1+pqtanda^k(p-1)(q-1)≡1(modpq).(b)Ifaisrelativelyprimetopq,theresultfollowsfrom(1)bymultiplyingbothsidesbya.Ifnot,thenaisdivisiblebyeitherporqorboth.Ifaisdivisiblebypq,thenbothsidesof(

5、2)arecongruentto0modpqandarethereforecongruenttoeachother.Intheremainingcase,aisdivisiblebyexactlyoneoftheintegersporq,andwithoutlossofgenerality,wemaysupposethatitisp.Thena=b^s,withs≥1andbrelativelyprimetopq.Wenoteforlaterreferencethatbmustsatisfy(2).Sin

6、cepisrelativelyprimetoq,wecanshowasintheproofofpart(a)thatforsomeintegerr,p^k(p-1)(q-1)=1+rq.Multiplyingbypthenshowsthatp^k(p-1)(q-1)≡p(modpq),andtherefore(p^s)^k(p-1)(q-1)=(p^k(p-1)(q-1)+1)^s≡p^s(modpq).Weseethatbothbandp^ssatify(2),andthereforesodoesthe

7、irproducta.DecodingSincesischosentoberelativelyprimeton,s,theremainderclassofsmodn,hasamultiplicativeinversetintheringZn.Thusforsomeintegerrwehavest≡1(modn)orst=1+k(p-1)(q-1)forsomeintegerk.WecanfindtbyusingtheEuclideanalgorithm.Ifwereceivetheintegery=x^s

8、(modm),wecomputey^t(modm)andapplyTheorem1.Sincem=pq,Theorem1(a)guaranteesthaty^t=x^st=x^1+k(p-1)(q-1)≡x(modm).Sincexdoesnotexceedm,wehavey^t(modm)=x,sowehaverecoveredtheoriginalintegerx.Wedothistoallreceivedintegers

當(dāng)前文檔最多預(yù)覽五頁,下載文檔查看全文

此文檔下載收益歸作者所有

當(dāng)前文檔最多預(yù)覽五頁,下載文檔查看全文
溫馨提示:
1. 部分包含數(shù)學(xué)公式或PPT動(dòng)畫的文件,查看預(yù)覽時(shí)可能會(huì)顯示錯(cuò)亂或異常,文件下載后無此問題,請放心下載。
2. 本文檔由用戶上傳,版權(quán)歸屬用戶,天天文庫負(fù)責(zé)整理代發(fā)布。如果您對(duì)本文檔版權(quán)有爭議請及時(shí)聯(lián)系客服。
3. 下載前請仔細(xì)閱讀文檔內(nèi)容,確認(rèn)文檔內(nèi)容符合您的需求后進(jìn)行下載,若出現(xiàn)內(nèi)容與標(biāo)題不符可向本站投訴處理。
4. 下載文檔時(shí)可能由于網(wǎng)絡(luò)波動(dòng)等原因無法下載或下載錯(cuò)誤,付費(fèi)完成后未能成功下載的用戶請聯(lián)系客服處理。