{"id":11304,"date":"2023-03-07T09:00:06","date_gmt":"2023-03-07T06:00:06","guid":{"rendered":"https:\/\/www.kaspersky.com.tr\/blog\/?p=11304"},"modified":"2023-03-03T13:58:46","modified_gmt":"2023-03-03T10:58:46","slug":"quantum-computers-and-rsa-2023","status":"publish","type":"post","link":"https:\/\/www.kaspersky.com.tr\/blog\/quantum-computers-and-rsa-2023\/11304\/","title":{"rendered":"Kuantum bilgisayarlar 2023’te RSA \u015fifrelemeyi ortadan kald\u0131racak m\u0131?"},"content":{"rendered":"

2022\u2019nin son g\u00fcnlerinde IT toplulu\u011fu, bir grup \u00c7inli bilim insan\u0131n\u0131n sundu\u011fu bir \u00e7al\u0131\u015fmayla<\/a> \u00e7alkaland\u0131. S\u00f6z konusu \u00e7al\u0131\u015fmada, klasik ve kuantum hesaplamay\u0131 ba\u015far\u0131l\u0131 bir \u015fekilde birle\u015ftirerek, internet protokol\u00fcn\u00fcn \u00e7al\u0131\u015fmas\u0131 i\u00e7in elzem olan 2048 bit anahtar uzunlu\u011funa sahip RSA kripto algoritmas\u0131n\u0131 k\u0131rman\u0131n \u00e7ok yak\u0131n gelecekte m\u00fcmk\u00fcn oldu\u011fu iddia ediliyordu. Peki ama bu tehdit ne kadar ger\u00e7ek? Gelin, yak\u0131ndan bakal\u0131m.<\/p>\n

Kuantumun temelleri<\/h2>\n

Kuantum bir bilgisayar\u0131n \u00e7ok b\u00fcy\u00fck tam say\u0131larla ultra h\u0131zl\u0131 fakt\u00f6rizasyon yapmas\u0131 ve b\u00f6ylelikle, RSA \u015fifreleme de dahil olmak \u00fczere \u00e7ok say\u0131da asimetrik kripto algoritmaya ait anahtarlar\u0131 e\u015fle\u015ftirmesi konusundaki teorik kabiliyeti \u00e7ok uzun zamand\u0131r biliniyor. Kuantum bilgisayar\u0131n ne oldu\u011funu, nas\u0131l \u00e7al\u0131\u015ft\u0131\u011f\u0131n\u0131 ve kuantum bilgisayar yapman\u0131n neden bu kadar zor oldu\u011funu blog g\u00f6nderimizde<\/a> detayl\u0131 bir \u015fekilde a\u00e7\u0131klad\u0131k. \u015eu anda t\u00fcm uzmanlar, RSA\u2019y\u0131 k\u0131racak kadar b\u00fcy\u00fck bir kuantum bilgisayar\u0131n \u00e7ok yak\u0131n gelecekte \u00fcretilemeyece\u011fi konusunda hemfikir. Genellikle RSA anahtar\u0131 olarak kullan\u0131lan 2048 bit uzunlu\u011funda bir tam say\u0131y\u0131 fakt\u00f6rize etmek i\u00e7in Shor algoritmas\u0131n\u0131n, milyonlarca kuantum bitlik (qubit) bir kuantum bilgisayarda \u00e7al\u0131\u015ft\u0131r\u0131lmas\u0131 gerekiyor. Dolay\u0131s\u0131yla, g\u00fcn\u00fcm\u00fczdeki en iyi kuantum bilgisayarlar bile y\u0131llarca s\u00fcren ara\u015ft\u0131rmalardan sonra ancak 300-400 kuantum bit ile \u00e7al\u0131\u015ft\u0131\u011f\u0131 i\u00e7in bunun \u00e7ok yak\u0131n gelecekte ger\u00e7ekle\u015fmeyece\u011fini s\u00f6yleyebiliriz.<\/p>\n

Ancak, gelecekte ortaya \u00e7\u0131kabilecek bu sorun \u00fczerine uzun s\u00fcredir d\u00fc\u015f\u00fcn\u00fcl\u00fcyor ve g\u00fcvenlik uzmanlar\u0131 \u015fimdiden bir kuantum sonras\u0131 kriptografi<\/a>, yani kuantum bilgisayarda korsanl\u0131\u011fa kar\u015f\u0131 dayan\u0131kl\u0131 algoritmalar kullan\u0131lmas\u0131n\u0131 \u00f6neriyor. Sorunsuz bir ge\u00e7i\u015f i\u00e7in on y\u0131l veya daha uzun bir zaman ge\u00e7mesi beklenirken, RSA-2048\u2019in 2023 gibi erken bir tarihte gelebilece\u011fi iddias\u0131 s\u00fcrpriz oldu.<\/p>\n

\u00c7in\u2019den Haberler<\/h2>\n

\u00c7inli ara\u015ft\u0131rmac\u0131lar, 48 bit anahtar\u0131 10 kuantum bitlik bir bilgisayarda \u00e7al\u0131\u015ft\u0131rabildi. Ayr\u0131ca yapt\u0131klar\u0131 hesaplamayla, bu algoritmalar\u0131n\u0131 yaln\u0131zca 372 kuantum bitlik bir bilgisayarda 2048 bit anahtarlar kullanmak \u00fczere \u00f6l\u00e7eklendirmenin m\u00fcmk\u00fcn oldu\u011funu g\u00f6rd\u00fcler. Fakat b\u00f6yle bir bilgisayar g\u00fcn\u00fcm\u00fczde zaten bulunuyor, \u00f6rne\u011fin IBM\u2019de<\/a> bu t\u00fcr bir bilgisayar mevcut. Dolay\u0131s\u0131yla, g\u00fcn\u00fcn birinde internetteki t\u00fcm kripto sistemleri de\u011fi\u015ftirme ihtiyac\u0131 birdenbire, \u00fczerine ciddi \u015fekilde d\u00fc\u015f\u00fcn\u00fclmeyen uzak gelecekteki bir \u015fey olmaktan \u00e7\u0131kt\u0131. Schnorr algoritmas\u0131n\u0131n<\/a> (yukar\u0131da bahsedilen Shor algoritmas\u0131yla kar\u0131\u015ft\u0131r\u0131lmamal\u0131d\u0131r) ilave bir kuantum yakla\u015f\u0131k optimizasyon algoritmas\u0131 (QAOA) ad\u0131m\u0131yla birle\u015ftirilmesi sayesinde bir d\u00f6n\u00fcm noktas\u0131 ya\u015fanaca\u011f\u0131 garanti edildi.<\/p>\n

\"\u00d6nerilen<\/a>

\u00d6nerilen hibrid fakt\u00f6rizasyon algoritmas\u0131 plan\u0131<\/p><\/div>\n

Schnorr algoritmas\u0131, klasik hesaplama kullan\u0131larak tam say\u0131lar\u0131n daha etkin \u015fekilde fakt\u00f6rize edilmesi i\u00e7in kullan\u0131l\u0131yor. S\u00f6z\u00fc ge\u00e7en \u00c7inli grup, \u00e7al\u0131\u015fmas\u0131n\u0131n hesaplama a\u00e7\u0131s\u0131ndan en yo\u011fun evresinde kuantum optimizasyonu uygulamay\u0131 \u00f6neriyor.<\/p>\n

A\u00e7\u0131k u\u00e7lu sorular<\/h2>\n

Matematik d\u00fcnyas\u0131, Schnorr algoritmas\u0131na \u015f\u00fcpheyle yakla\u015ft\u0131. \u00c7al\u0131\u015fman\u0131n a\u00e7\u0131klamas\u0131nda yazar taraf\u0131ndan \u00f6ne s\u00fcr\u00fclen, \u201cbunun RSA kriptosistemini \u00e7\u00f6kertece\u011fi\u201d iddias\u0131 detayl\u0131 bir \u015fekilde incelendi ve sa\u011flaml\u0131\u011f\u0131n\u0131 koruyamad\u0131. \u00d6rne\u011fin \u00fcnl\u00fc kriptograf Bruce Schneier, bunun \u201c\u00c7inli grubun test etti\u011fine yak\u0131n k\u00fc\u00e7\u00fck mod\u00fcllerle d\u00fczg\u00fcn \u00e7al\u0131\u015ft\u0131\u011f\u0131n\u0131 fakat b\u00fcy\u00fck boyutlarda ba\u015far\u0131s\u0131z oldu\u011funu\u201d belirtti. Ayr\u0131ca hi\u00e7 kimse, bu algoritman\u0131n pratikte \u00f6l\u00e7eklenebilir oldu\u011funu kan\u0131tlayamad\u0131.<\/p>\n

Algoritman\u0131n \u201cen a\u011f\u0131r\u201d k\u0131sm\u0131na kuantum optimizasyonu uygulamak kula\u011fa iyi bir fikir gibi gelse de kuantum hesaplama uzmanlar\u0131, QAOA optimizasyonunun bu hesaplama problemini \u00e7\u00f6zmede etkili olaca\u011f\u0131ndan \u015f\u00fcpheli<\/a>. Bu noktada kuantum bilgisayar kullanmak m\u00fcmk\u00fcn fakat buradan zaman tasarrufu elde etmek olas\u0131 de\u011fil. \u00c7al\u0131\u015fman\u0131n yazarlar\u0131 da raporlar\u0131n\u0131n sonunda, sonu\u00e7 k\u0131sm\u0131nda bu \u015f\u00fcpheli noktadan dikkatli bir \u015fekilde bahsediyor:<\/p>\n

\nAlgoritman\u0131n kuantum h\u0131zlanmas\u0131n\u0131n, QAOA\u2019n\u0131n belirsiz yak\u0131nsamas\u0131 nedeniyle mu\u011flak oldu\u011fu belirtilmelidir.
\n\u2026
\nAyr\u0131ca kuantum h\u0131zlanmas\u0131 bilinmiyor; RSA\u2019n\u0131n kuantum ile k\u0131r\u0131lmas\u0131na daha \u00e7ok zaman var.\n<\/p><\/blockquote>\n

Yani bu hibrit algoritmay\u0131 klasik bir + kuantum sisteme uygulasan\u0131z da, RSA anahtarlar\u0131n\u0131 tahmin etmek normal bir bilgisayarla oldu\u011fu kadar uzun s\u00fcrecek.<\/p>\n

\u00dcst\u00fcne \u00fcstl\u00fck, kuantum bit say\u0131s\u0131n\u0131n yan\u0131 s\u0131ra kuantum bilgisayar\u0131n ba\u015fka \u00f6nemli parametreleri de var. Giri\u015fim ve hata say\u0131s\u0131 ile a\u011f ge\u00e7idi say\u0131s\u0131 buna \u00f6rnek verilebilir. Gerekli parametreler bir arada d\u00fc\u015f\u00fcn\u00fcld\u00fc\u011f\u00fcnde, 2023-2024 y\u0131l\u0131n\u0131n en umut veren bilgisayarlar\u0131 bile muhtemelen \u00c7in algoritmas\u0131n\u0131n gerekli \u00f6l\u00e7ekte \u00e7al\u0131\u015ft\u0131r\u0131lmas\u0131 i\u00e7in uygun de\u011fil.<\/p>\n

Faydal\u0131 \u00e7\u0131kar\u0131mlar<\/h2>\n

Kripto devrim bir kez daha ertelenirken, bu \u00e7al\u0131\u015fmayla ilgili s\u00f6ylentilerde g\u00fcvenlikle ilgili iki soruna dikkat \u00e7ekiliyor. \u00d6ncelikle, \u201ckuantum sonras\u0131 bir standart\u201d i\u00e7in \u00e7ok say\u0131da \u00f6neri i\u00e7inden kuantuma dayan\u0131kl\u0131 bir algoritma se\u00e7erken, yukar\u0131da bahsedilen Schnorr algoritmas\u0131 gibi yeni cebir yakla\u015f\u0131mlar\u0131 \u00e7ok titiz \u015fekilde ara\u015ft\u0131r\u0131lmal\u0131. \u0130kinci olarak da kuantum sonras\u0131 kriptografiye<\/a> ge\u00e7mek i\u00e7in projelerin \u00f6nceli\u011fini kesinlikle y\u00fckseltmemiz gerekiyor. \u00d6yle g\u00f6r\u00fcn\u00fcyor ki her \u015fey i\u00e7in \u00e7ok ge\u00e7 olana kadar bu konu \u00e7ok da acil g\u00f6r\u00fclmeyecek\u2026<\/p>\n","protected":false},"excerpt":{"rendered":"

Kendimizi \u201ckuantum gelece\u011fe\u201d haz\u0131rlamam\u0131z gerekti\u011fini hepimiz biliyoruz. Peki ama bunun 10-20 y\u0131l i\u00e7inde ger\u00e7ekle\u015fmesi mi bekleniyordu? Bu y\u0131l bir d\u00f6n\u00fcm noktas\u0131 ya\u015fanabilir mi?<\/p>\n","protected":false},"author":2722,"featured_media":11306,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"_acf_changed":false,"footnotes":""},"categories":[1726,1194,995],"tags":[2138,794,764],"class_list":{"0":"post-11304","1":"post","2":"type-post","3":"status-publish","4":"format-standard","5":"has-post-thumbnail","7":"category-enterprise","8":"category-business","9":"category-technology","10":"tag-kuantum-bilgisayarlar","11":"tag-sifreleme","12":"tag-tavsiye"},"hreflang":[{"hreflang":"tr","url":"https:\/\/www.kaspersky.com.tr\/blog\/quantum-computers-and-rsa-2023\/11304\/"},{"hreflang":"en-in","url":"https:\/\/www.kaspersky.co.in\/blog\/quantum-computers-and-rsa-2023\/25039\/"},{"hreflang":"en-ae","url":"https:\/\/me-en.kaspersky.com\/blog\/quantum-computers-and-rsa-2023\/20533\/"},{"hreflang":"ar","url":"https:\/\/me.kaspersky.com\/blog\/quantum-computers-and-rsa-2023\/11068\/"},{"hreflang":"en-us","url":"https:\/\/usa.kaspersky.com\/blog\/quantum-computers-and-rsa-2023\/27605\/"},{"hreflang":"en-gb","url":"https:\/\/www.kaspersky.co.uk\/blog\/quantum-computers-and-rsa-2023\/25365\/"},{"hreflang":"es-mx","url":"https:\/\/latam.kaspersky.com\/blog\/quantum-computers-and-rsa-2023\/25692\/"},{"hreflang":"es","url":"https:\/\/www.kaspersky.es\/blog\/quantum-computers-and-rsa-2023\/28248\/"},{"hreflang":"ru","url":"https:\/\/www.kaspersky.ru\/blog\/quantum-computers-and-rsa-2023\/34503\/"},{"hreflang":"x-default","url":"https:\/\/www.kaspersky.com\/blog\/quantum-computers-and-rsa-2023\/46733\/"},{"hreflang":"fr","url":"https:\/\/www.kaspersky.fr\/blog\/quantum-computers-and-rsa-2023\/19969\/"},{"hreflang":"pt-br","url":"https:\/\/www.kaspersky.com.br\/blog\/quantum-computers-and-rsa-2023\/20551\/"},{"hreflang":"de","url":"https:\/\/www.kaspersky.de\/blog\/quantum-computers-and-rsa-2023\/29645\/"},{"hreflang":"ja","url":"https:\/\/blog.kaspersky.co.jp\/quantum-computers-and-rsa-2023\/33411\/"},{"hreflang":"ru-kz","url":"https:\/\/blog.kaspersky.kz\/quantum-computers-and-rsa-2023\/25746\/"},{"hreflang":"en-au","url":"https:\/\/www.kaspersky.com.au\/blog\/quantum-computers-and-rsa-2023\/31406\/"},{"hreflang":"en-za","url":"https:\/\/www.kaspersky.co.za\/blog\/quantum-computers-and-rsa-2023\/31118\/"}],"acf":[],"banners":"","maintag":{"url":"https:\/\/www.kaspersky.com.tr\/blog\/tag\/sifreleme\/","name":"\u015fifreleme"},"_links":{"self":[{"href":"https:\/\/www.kaspersky.com.tr\/blog\/wp-json\/wp\/v2\/posts\/11304","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.kaspersky.com.tr\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.kaspersky.com.tr\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.kaspersky.com.tr\/blog\/wp-json\/wp\/v2\/users\/2722"}],"replies":[{"embeddable":true,"href":"https:\/\/www.kaspersky.com.tr\/blog\/wp-json\/wp\/v2\/comments?post=11304"}],"version-history":[{"count":2,"href":"https:\/\/www.kaspersky.com.tr\/blog\/wp-json\/wp\/v2\/posts\/11304\/revisions"}],"predecessor-version":[{"id":11308,"href":"https:\/\/www.kaspersky.com.tr\/blog\/wp-json\/wp\/v2\/posts\/11304\/revisions\/11308"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/www.kaspersky.com.tr\/blog\/wp-json\/wp\/v2\/media\/11306"}],"wp:attachment":[{"href":"https:\/\/www.kaspersky.com.tr\/blog\/wp-json\/wp\/v2\/media?parent=11304"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.kaspersky.com.tr\/blog\/wp-json\/wp\/v2\/categories?post=11304"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.kaspersky.com.tr\/blog\/wp-json\/wp\/v2\/tags?post=11304"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}