- I-algorithm ye-RSA isebenzisa inkqubo yezitshixo zikawonke-wonke kunye nezabucala ukufihla kunye nokufihla ulwazi.
- Ngokusekwe kubunzima bokulinganisa amanani amakhulu amakhulu, ibonelela ngenqanaba eliphezulu lokhuseleko.
- Isetyenziswa ngokubanzi kwiisignesha zedijithali, uqhagamshelo olukhuselekileyo kunye noguqulelo lomyalezo.
- Owona mceli mngeni walo kwixesha elizayo yi-quantum computing kunye nophuhliso lwezinye iindlela ezingemva kwe-quantum.
I-algorithm yeRSA Yenye yeentsika ezisisiseko ze-cryptography yanamhlanje kunye nenkqubo esetyenziswa ngokubanzi uguqulelo oluntsonkothileyo lwedatha ebuthathaka kwi-Intanethi. Ukusuka kwintengiselwano kwi-Intanethi ukuya kwi uqinisekiso lomyalezo, iRSA iye yatshintsha indlela esikhusela ngayo inkcazelo yethu. Kodwa isebenza njani kwaye kutheni ikhuselekile?
Kweli nqaku, siza kucazulula yonke imiba ephambili ye-algorithm ye-RSA, ukusuka kwiziseko zayo zemathematika ukuya kwizicelo zayo ezisebenzayo. Ukongeza, siya kujongana nemiba yobugcisa efana isizukulwana esingundoqo, indima ye ukubala amanani aphambili kunye neminye imingeni le nkqubo ejongene nayo kwixesha elizayo ngokufika kwe ubungakanani beekhompyuter.
Yintoni i-algorithm yeRSA?
I-algorithm yeRSA, egama layo livela kwiifani zabadali bayo: URon Rivest, uAdi Shamir kunye noLeonard Adleman, yinkqubo ye i-asymmetric cryptography. Yaphuhliswa ngo-1977 kwi-Massachusetts Institute of Technology (MIT) kwaye isekelwe kwizitshixo ezimbini ezahlukeneyo: isitshixo sikawonke-wonke. Imiyalezo entsonkothileyo kunye neqhosha labucala le baziqonde.
Eyona nto iphambili ye-RSA kukuba isombulula omnye weyona mingeni ibalulekileyo ye-cryptography: ukuvumela i unxibelelwano olukhuselekileyo phakathi kwamaqela amabini angazange abenalo ithuba langaphambili lokwabelana ngesitshixo ngasese. Le nkqubo isebenzisa Ubunzima bokulinganisa amanani amakhulu njengesiseko sokhuseleko lwakho.
Imbali emfutshane ye-algorithm yeRSA
Ngaphambi kokufika kwe-RSA, i-cryptography yayixhomekeke ngokuyinhloko kwiinkqubo ze-symmetric ezifuna ukuba amaqela omabini abelane ngesitshixo esifanayo. Utshintshiselwano olukhuselekileyo lwezi zitshixo zabucala yayiyenye yezona ndawo zibuthathaka kakhulu kwezi nkqubo.
I-RSA yatshintsha le ntshukumo ngokuzisa isitshixo sikawonke-wonke kunye nenkqubo yesitshixo sabucala. Nangona isazi sezibalo saseBrithani Clifford Cocks Ngaphambili wayeyila inkqubo efanayo kwi-1973 ngelixa esebenzela uRhulumente wase-UK, ukufunyanwa kwakhe kwahlala kuhlelwe kude kube ngu-1997. Abaphandi be-MIT baphuhlise i-RSA ngokuzimeleyo kwaye banelungelo lobunikazi kwi-1983.
Isebenza njani iRSA?
Ukuqonda indlela esebenza ngayo iRSA, kubalulekile ukuqonda ukuba injani na velisa izitshixo kunye nendlela esetyenziswa ngayo imathematika encrypt y cacisa imiyalezo.
Isizukulwana esiphambili
- Amanani amabini amakhulu amakhulu akhethiwe, abizwa p y q.
- Imveliso yayo ibalwa n, eya kuba yimodyuli yezitshixo zikawonke-wonke nezabucala:
n = p * q. - Ixabiso lomsebenzi we-Euler lichongiwe:
φ(n) = (p-1)*(q-1). - Inani likhethwa e lowo ngumzala naye
φ(n). Eli nani liya kuba le umxhasi woluntu. - I-exponent yabucala iyabalwa d, eyanelisa ukuhambelana:
e * d ≡ 1 (mod φ(n)).
Isiphumo sokugqibela zizitshixo ezibini: esoluntu, esakhiwe (n, e), kunye neyabucala, emelwe ngu (n, d).
uguqulelo oluntsonkothileyo lomyalezo
Ukuguqulela ngokuntsonkothileyo umyalezo M, oku kuba yinani elipheleleyo m oko kungaphantsi kwe n. Emva koko, ifomula isetyenziswa:
C = m^e mod n
Isiphumo, C, ngumyalezo ofihliweyo.
Ukucatshulwa kwemiyalezo
Umamkeli usebenzisa isitshixo sakhe sabucala ukucima umyalezo ofihliweyo. C, usebenzisa ifomyula echaseneyo:
m = C^d mod n
Ngaloo ndlela, umyalezo wokuqala uyafunyanwa m.
Umzekelo osebenzayo wendlela iRSA esebenza ngayo
Masithi sikhetha amanani aphambili p = 61 y q = 53. Imveliso yazo zombini iya kuba n = 3233. Sibala umsebenzi wayo we-Euler: φ(n) = (61-1)*(53-1) = 3120. Sikhetha = 17, eyi-coprime ukuya ku-3120. Emva koko, sibala d: d = 2753.
Ukuba sifuna ukufihla umyalezo M = 123, sifumana:
C = 123^17 mod 3233 = 855
Ukucima umyalezo ofihliweyo C=855, sisebenzisa ifomyula echaseneyo:
m = 855^2753 mod 3233 = 123
Izinto eziluncedo kuguqulelo oluntsonkothileyo lweRSA
- Ukufihla: Ivumela i utshintshiselwano olukhuselekileyo yolwazi ngaphandle kokwabelana ngesitshixo kwangaphambili.
- Ukungafani: Ingasetyenziselwa zombini Imiyalezo entsonkothileyo ukuba kunjalo asayine amaxwebhu ngokwedijithali.
- Ukhuseleko oluqinisekisiweyo: Ubunzima boku ukubala amanani amakhulu iyenza ikhuseleke kakhulu.
Imida yangoku kunye nemingeni ye-algorithm ye-RSA
Ngaphandle kweenzuzo zayo, iRSA inemida ethile yendalo. Umzekelo, iyacotha kune-algorithms symmetric encryption, iyenza ingasebenzi kakuhle ukufihla umthamo omkhulu wedatha. Ukongeza, ifuna amaqhosha amade (ubuncinci 2048 ungazama) ukugcina ukhuseleko kuhlaselo lwangoku.
Omnye umngeni obalulekileyo sisisongelo esibangelwa siso ubungakanani beekhompyuter, ezinokubeka esichengeni ukhuseleko lwe-RSA kwixesha elizayo. Ngenxa yesi sizathu, bayakhula I-post-quantum cryptographic algorithms njengezinye iindlela.
Usetyenziso lwe-algorithm ye-RSA
I-RSA isetyenziswa kwiindawo ezahlukeneyo zobuchwepheshe, kuquka:
- imidibaniso ekhuselekileyo kwizikhangeli zewebhu (SSL/TLS).
- Ukutyikitya kwedijithali ukuqinisekisa ubunyani bamaxwebhu.
- Uguqulelo oluntsonkothileyo lwe-imeyile kunye nemiyalezo ekhawulezileyo.
- Uqinisekiso kwiinethiwekhi zabucala ezinenyani (VPNs).
Namhlanje, iRSA isengumgangatho owamkelwa ngokubanzi kwi ukhuseleko lwekhompyutha kunye ukhuseleko lwedatha.
I-algorithm yeRSA iguqule indlela esikhusela ngayo unxibelelwano lwethu lwedijithali, inikezela ngenqanaba ukhuseleko olungazange lubonwe ngaphambili isekelwe kwiingcamango ezinzulu zemathematika. Nangona ijongene nemingeni kunye ne indalo yetekhnoloji, ihlala ingundoqo kwihlabathi le-cryptography.