- I-RSA iyisistimu ye-cryptography engalingani esebenzisa okhiye bomphakathi nabangasese ukubethela nokucisha ulwazi.
- Ukuphepha kwayo kusekelwe ebunzimeni bokuqhathanisa izinombolo ezinkulu, ezithathwe kumkhiqizo wama-prime amabili.
- Uhla olubanzi lwezinhlelo zokusebenza: i-SSL/TLS, ukusayina kwedijithali kanye nokuqinisekiswa; noma kunjalo, idinga okhiye abade futhi ibhekene nezinsongo zesikhathi esizayo njenge-quantum computing.
I-algorithm ye-RSA ingenye yezinsika ze-cryptography yesimanje kanye nesistimu esetshenziswa kabanzi yokubhala ngemfihlo idatha ebucayi kwi-inthanethi. Kusukela ekuthengiselaneni kwe-inthanethi kuya ekuqinisekisweni kwemiyalezo , i-RSA ishintshe indlela esivikela ngayo ulwazi lwethu. Kodwa isebenza kanjani, futhi kungani iphephile kangaka?
Kulesi sihloko, sizohlukanisa zonke izici ezibalulekile ze-algorithm ye-RSA, kusukela ezisekelweni zayo zezibalo kuya ekusetshenzisweni kwayo okusebenzayo kakhulu. Sizophinde sibhekane nezici zobuchwepheshe ezifana nokukhiqizwa kwezihluthulelo , indima ye -prime factorization , kanye nezinye zezinselele lolu hlelo oluzobhekana nazo esikhathini esizayo ngokufika kwe -quantum computing.
Iyini i-algorithm ye-RSA?
I-algorithm ye-RSA, eqanjwe ngabadali bayo uRon Rivest, u-Adi Shamir, noLeonard Adleman , iyisistimu ye -cryptography engalingani . Yasungulwa ngo-1977 eMassachusetts Institute of Technology (MIT) futhi isekelwe ezikhiyeni ezimbili ezihlukene: ukhiye womphakathi wokubethela imiyalezo kanye nokhiye wangasese wokuyikhipha.
Isici esiyinhloko se-RSA ukuthi ixazulula enye yezinselelo ezibaluleke kakhulu ku-cryptography: ukuvumela ukuxhumana okuphephile phakathi kwamaqembu amabili angakaze abe nethuba lokwabelana ngokhiye ngasese. Lolu hlelo lusebenzisa ubunzima bokufaka izinombolo ezinkulu njengesisekelo sokuphepha kwalo.
Umlando omfushane we-algorithm ye-RSA
Ngaphambi kokufika kwe-RSA, i-cryptography yayincike kakhulukazi kumasistimu wama-symmetrics ayedinga ukuthi izinhlangothi zombili zabelane ngokhiye ofanayo. Ukushintshaniswa okuphephile kwalaba khiye abayimfihlo bekungenye yezindawo ezisengozini kakhulu zalezi zinhlelo.
I-RSA yashintsha lokhu ngokusungula uhlelo lokhiye lukahulumeni nolwangasese. Nakuba isazi sezibalo saseBrithani uClifford Cocks ayesungule uhlelo olufanayo ekuqaleni kuka-1973 ngesikhathi esebenzela uhulumeni wase-UK, ukutholwa kwakhe kwaqhubeka kwahlukaniswa kwaze kwaba ngu-1997. Abacwaningi be-MIT bathuthukisa i-RSA ngokuzimela futhi bayigunyaza ngo-1983.
Isebenza kanjani i-RSA?
Ukuze uqonde ukuthi i-RSA isebenza kanjani, kubalulekile ukuqonda ukuthi okhiye bakhiqizwa kanjani nokuthi basetshenziswa kanjani ngokwezibalo ukubethela nokuqaqa imiyalezo.
Ukukhiqiza ukhiye
- Kukhethwa izinombolo ezimbili ezinkulu, ezibizwa p y q.
- Umkhiqizo wayo ubalwa n, okuzoba imojuli yokhiye basesidlangalaleni nabayimfihlo:
n = p * q. - Inani lomsebenzi we-Euler liyanqunywa:
φ(n) = (p-1)*(q-1). - Kukhethwa inombolo e lowo umzala naye
φ(n). Le nombolo kuzoba yi- i-exponent yomphakathi. - I-eksponenti yangasese ibalwa d, okwanelisa ukuhambisana:
e * d ≡ 1 (mod φ(n)).
Umphumela wokugcina uwukhiye ababili: esomphakathi, esakhiwe (n, e), futhi eyimfihlo, emelelwa ngu (n, d).
ukubethela komlayezo
Ukuze ubethele umlayezo M, lokhu kuba inombolo ephelele m (ngokwesibonelo, ukusebenzisa kanambambili izinombolo izinhlelo) lokho kungaphansi kuka n. Bese, ifomula isetshenziswa:
C = m^e mod n
Umphumela, u-C , umlayezo obethelwe.
Ukususa ukubethela kwemiyalezo
Umamukeli usebenzisa ukhiye wakhe wangasese ukuze akhiphe umbhalo ofihliwe umlayezo C , esebenzisa ifomula ephambene:
m = C^d mod n
Ngakho-ke, umlayezo wokuqala u-m uyatholwa.
Isibonelo esisebenzayo sendlela i-RSA esebenza ngayo
Ake sithi sikhetha izinombolo eziyinhloko p = 61 y q = 53. Umkhiqizo wabo bobabili uzoba n = 3233. Sibala umsebenzi wayo we-Euler: φ(n) = (61-1)*(53-1) = 3120. Siyakhetha e =17, okuyi-coprime kuya ku-3120. Bese, sibala d: d = 2753.
Uma sifuna ukubethela umlayezo M = 123 , sithola:
C = 123^17 mod 3233 = 855
Ukuze sikhiphe umbhalo obhaliwe ku- C = 855 , sisebenzisa ifomula ephambene:
m = 855^2753 mod 3233 = 123
Izinzuzo zokubethela kwe-RSA
- Ukuyimfihlo: Ivumela i- ukushintshana okuvikelekile yolwazi ngaphandle kokwabelana ngokhiye ngaphambili.
- Ukuhlukahluka: Ingasetshenziswa kokubili bethela imilayezo ngokuqondene sayina amadokhumenti ngedijithali.
- Ukuphepha okuqinisekisiwe: Ubunzima boku ukufaka izinombolo ezinkulu kwenza kuphephe ngokwedlulele.
Imikhawulo yamanje kanye nezinselelo ze-algorithm ye-RSA
Naphezu kwezinzuzo zayo, i-RSA inemikhawulo ethile engokwemvelo. Isibonelo, ihamba kancane kune- algorithms yokubethela ehambisanayo , okwenza ingasebenzi kahle ekubetheleni idatha eningi. Ngaphezu kwalokho, idinga okhiye abade (okungenani ama-bits angu-2048 ) ukuze ivikeleke ekuhlaselweni kwanamuhla.
Enye inselele ebalulekile usongo olubangelwa yi -quantum computing , olungabeka engcupheni ukuphepha kwe-RSA esikhathini esizayo. Ngenxa yalesi sizathu, ama-algorithms e-cryptographic e-post-quantum ayathuthukiswa njengezindlela ezihlukile.
Izicelo ze-algorithm ye-RSA
I-RSA isetshenziswa ezindaweni ezihlukahlukene zobuchwepheshe, okuhlanganisa:
- ukuxhumana okuvikelekile kuziphequluli zewebhu (SSL/TLS).
- Amasiginesha edijithali ukuqinisekisa ubuqiniso bemibhalo.
- Ukubethela kwe-imeyili kanye nemiyalezo esheshayo.
- Ukufakazela ubuqiniso en amanethiwekhi ayimfihlo we-virtual (VPN).
Namuhla, i-RSA isalokhu iyindinganiso eyamukelwa kabanzi ekuphepheni kwamakhompyutha kanye nokuvikelwa kwedatha.
I-algorithm ye-RSA ishintshe indlela esivikela ngayo ukuxhumana kwethu kwedijithali, inikeza izinga lokuphepha elingakaze libonwe ngaphambili elisekelwe emiqondweni ejulile yezibalo. Nakuba ibhekene nezinselele ngokuvela kobuchwepheshe , isalokhu iyingxenye eyisisekelo ye-cryptography.
