I-Theorem kaMosca kanye nokufika kwe-quantum computing

Informatec Digital » Ama-algorithms » I-Theorem kaMosca kanye nokufika kwe-quantum computing

Izwe le- cryptography kanye nokuqhubekela phambili kwe -quantum computing , okuhlanganisa nezibonelo ze-quantum computing ngokwayo , kuye kwadala ukukhathazeka okuqhubekayo: kuzokwenzekani lapho ubuchwepheshe bamanje bokuphepha buphelelwa yisikhathi ngenxa yamakhompyutha anamandla e-quantum? Lesi simo siveze imigomo nemibono efana ne -Mosca's Theorem , ezama ukubikezela isikhathi esinaso sokuthatha isinyathelo ngaphambi kokuba i-cryptography yanamuhla iphulwe ngokungenakuphikiswa. Kulesi sihloko, sizohlola i-Theorem kaMosca , umthelela wayo, izingxenye zayo ezibalulekile, nokuthi ihlobene kanjani nentuthuko ye -quantum computing.

UDkt. Michele Mosca, uchwepheshe we-cryptography , waklama lesi simiso ukuze ahlaziye futhi abikezele ukuthi ubuchwepheshe be-quantum buzophula nini ama-algorithms amanje e-cryptographic . Kodwa-ke, i-theorem ayisona nje isixwayiso; iphinde iphakamise isu lokunciphisa lolu songo, igcizelela ukuphuthuma kokubuyekeza izinhlelo ze-cryptographic ngaphambi kokuba sekwephuze kakhulu.

Iyini i-Theorem kaMosca futhi yakhiwa kanjani?

I-Theorem kaMosca ivezwa njengesibalo esilula kodwa esibalulekile: X + Y > Z. Ngayinye yalezi zinto imele isici esibalulekile:

• X: Ubude besikhathi idatha okufanele igcinwe ivikelekile.
• Y: Isikhathi esidingekayo sokuqalisa izixazululo i-cryptographic ukumelana ne ikhompyutha iquantum.
• Z: Isikhathi ngaphambi kokuthi amakhompyutha e-quantum akwazi ukuphula i- i-cryptography okwamanje

Umgomo ukuqinisekisa ukuthi isamba sika- X no -Y asingaphezu kuka -Z. Uma lokhu kungalingani kungahlangatshezwana nakho, ingozi isobala: idatha izodalulwa ngaphambi kokuba kutholakale izixazululo zokuyivikela.

Izingxenye ezibalulekile zeTheorem

Ingxenye ngayinye yale fomula inemithelela ebalulekile. Ngezansi sihlaziya ingxenye ngayinye ngokuningiliziwe:

1. Impilo ewusizo yokuvikeleka (X)

Leli gama libhekisela ekutheni idatha evikelwe yi- algorithms yamanje ye-cryptographic kumele ihlale iphephile isikhathi esingakanani . Kwezinye izimo, lokhu kuphila kungaba yiminyaka embalwa, kodwa emikhakheni efana nebhange noma ukunakekelwa kwempilo, ukuvikelwa kungadingeka amashumi eminyaka.

2. Isikhathi sokufuduka (Y)

Ukuthuthukisa izinhlelo ezikhona zibe ama-algorithms amelana ne-quantum akuwona umsebenzi olula. Le nqubo ingabandakanya konke kusukela ekuthuthukiseni nasekusebenziseni amazinga kuya ekusetshenzisweni kobuchwepheshe ezingqalasizinda eziyinkimbinkimbi. Ngokwesilinganiso, kungathatha iminyaka emithathu kuya kwemihlanu, noma ngisho nangaphezulu.

3. Isikhathi sokugoqa (Z)

Lesi yisikhathi esilinganiselwe lapho amakhompyutha e-quantum ezoba namandla anele okuphula ama-algorithms okubethela amanje . Nakuba ochwepheshe bengavumelani ngosuku oluqondile, ezinye izilinganiso zisikisela ukuthi lokhu kungenzeka eminyakeni eyi-10-20 ezayo, kuye ngesivinini sokuthuthuka kwezobuchwepheshe.

Isibonelo esisebenzayo seTheorem kaMosca

Ake sicabange ngesikhungo sezezimali esidinga ukuvikela idatha yamakhasimende ebucayi ngenxa yemithetho efana ne -GDPR . Ake sithi lesi sikhungo sidinga ukugcina leyo datha iphephile iminyaka eyishumi, okumelela inani lika- X.

Ngokuphathelene nenani lika- Y , kulinganiselwa ukuthi bazodinga iminyaka emine ukuze bathuthele uhlelo lwabo lwamanje baye kolunye olumelana nokuthuthuka kwe-quantum. Okokugcina, uma amakhompyutha e-quantum akwazi ukuphula i-cryptography yamanje efika eminyakeni emihlanu ( Z ), ingozi isobala: inhlangano ngeke ibe nesikhathi esanele sokuzivikela.

Lesi sibonelo senza kucace ukuthi i-Theorem kaMosca iwusizo kanjani ekulinganiseni ubungozi kanye nokwenza izinqumo zamasu mayelana nokushintshela ezinhlelweni eziphephile.

Imithelela ye-quantum computing

I-Quantum computing imelela intuthuko yezobuchwepheshe engaguqula imikhakha efana nezokwelapha , i-meteorology , kanye nokuhlola isikhala . Kodwa-ke, umthelela osheshayo ungazwakala ekuphepheni kwe-cyber.

Ama-algorithms avikela ukuthengiselana kwethu kwasebhange, ukuxhumana, kanye nedatha eyimfihlo okwamanje asekelwe ezinkingeni zezibalo ezingenakuxazululeka kumakhompyutha akudala , kodwa hhayi emishinini ye-quantum . Lokhu kungaholela kulokho abanye abakubiza ngokuthi “i-quantum apocalypse,” lapho okhiye bokubethela beqhekeka khona ngendaba yamahora ambalwa.

Izenzo ezidingekayo ukubhekana nekusasa le-quantum

Njengoba kunikezwe lesi simo, ochwepheshe batusa ukusebenza ku- crypto agility , okungukuthi, ikhono lokuzivumelanisa ngokushesha nama-algorithms amasha kanye nemithethonqubo yokuphepha . Amanye amaphuzu abalulekile afaka:

• Tshala ocwaningweni nasekuthuthukisweni kwama-algorithms amelana nawo ikhompyutha iquantum.
• Hlanganyela nezinhlangano zamazwe ngamazwe ukuze usungule amazinga global.
• Yenza ukuhlola okujwayelekile kanye nokuhlola ukuhlola ubungozi bezinhlelo zamanje.

Ngaphezu kwalokho, kubalulekile ukusebenzisa amasu emfundo ukuqeqesha ochwepheshe bezokuphepha kwe-inthanethi ngobuchwepheshe obusha kanye nezinsongo.

I-Theorem kaMosca igcizelela ngokucacile isidingo sezinyathelo zokuthatha isinyathelo sokunciphisa izingozi zesikhathi esizayo. Isimema ukuba sicabange ngezinselele zokuthuthuka kwezobuchwepheshe futhi sithathe izinyathelo eziqondile zokuqinisekisa ikusasa ledijithali eliphephile nelithembekile.

I-athikili ehlobene:

Izibonelo ze-Quantum Computing: Amacala Angokoqobo