{"id":33517,"date":"2019-10-31T21:53:04","date_gmt":"2019-10-31T18:53:04","guid":{"rendered":"https:\/\/prohoster.info\/blog\/predstavlen-bolee-effektivnyj-metod-opredeleniya-prefiksov-kollizij-dlya-sha-1\/"},"modified":"2019-10-31T21:53:04","modified_gmt":"2019-10-31T18:53:04","slug":"predstavlen-bolee-effektivnyj-metod-opredeleniya-prefiksov-kollizij-dlya-sha-1","status":"publish","type":"post","link":"https:\/\/prohoster.info\/et\/blog\/news\/predstavlen-bolee-effektivnyj-metod-opredeleniya-prefiksov-kollizij-dlya-sha-1","title":{"rendered":"Esitleti efektiivsem meetod SHA-1 konflikti prefiksite m\u00e4\u00e4ramiseks","gt_translate_keys":[{"key":"rendered","format":"text"}]},"content":{"rendered":"

Prantsuse riikliku arvutitehnika ja automaatika uurimisinstituudi (INRIA) ja Nanyangi Tehnoloogia \u00dclikooli (Singapur) teadlased on arendanud<\/a><\/noindex> t\u00e4iustatud meetod<\/a><\/noindex> r\u00fcnnakud<\/a><\/noindex> SHA-1 algoritmi vastu, mis oluliselt lihtsustab kahe erineva dokumendi loomist sama SHA-1 hajuvusv\u00e4\u00e4rtusega. Meetodi olemus seisneb SHA-1 t\u00f5elise konflikti leidmise operatsiooni v\u00e4hendamises konflikti r\u00fcnnaku jaoks, millel on m\u00e4\u00e4ratud prefiks<\/a><\/noindex>, millel konflikte tekib teatud prefikside olemasolul, s\u00f5ltumata muust komplekti andmete osast. Teisis\u00f5nu, on v\u00f5imalik arvutada kaks etten\u00e4htud prefiksit ja kui \u00fcks neist lisada \u00fchele dokumendile ja teine teisele \u2014 nende failide SHA-1 hashes on identsed.<\/p>\n

Selle t\u00fc\u00fcbi r\u00fcnnak n\u00f5uab endiselt tohutuid arvutusi ja prefiksite leidmine j\u00e4\u00e4b keerulisemaks kui tavaline konflikti leidmine, kuid ka tulemuse praktiline efektiivsus on oluliselt k\u00f5rgem. Kui varasem k\u00f5ige kiirem konflikti prefiksite leidmise meetod SHA-1-s n\u00f5udis 277,1 operatsiooni, siis uus meetod v\u00e4hendab arvutuste arvu vahemikku 266,9 kuni 269,4. Sellise taseme arvutustega on r\u00fcnnaku hinnanguline maksumus v\u00e4hem kui sada tuhat dollarit, mis on t\u00e4iesti taskukohane luureteenistustele ja suurtele korporatsioonidele. V\u00f5rdluseks, et tavalise konflikti leidmiseks on vaja teha umbes 264,7 operatsiooni.<\/p>\n

Uues eelmisel<\/a><\/noindex> demonstreerimisel<\/a><\/noindex> Google'i v\u00f5imet genereerida erinevaid PDF-faile sama SHA-1 hajuvusv\u00e4\u00e4rtusega kasutati<\/a><\/noindex> trikk, mis \u00fchendab kahe dokumendi \u00fcheks failiks, vahetades n\u00e4htava kihi ja nihutades valikukihti piirkonda, kus toimub kollisioon. Sarnaste ressursside kulude juures (SHA-1 esimese kollisiooni leidmine n\u00f5udis Google'ilt aasta arvutusi 110 GPU klastris) v\u00f5imaldab uus meetod saavutada SHA-1 sobivust kahe vabalt valitud andmekogumi jaoks. Praktiliselt saab ette valmistada TLS-sertifikaate, milles mainitakse erinevaid domeene, kuid SHA-1 h\u00e4\u0161id kattuvad. Selline v\u00f5imalus v\u00f5imaldab petlikul sertifitseerimisasutusel luua digitaalallkirja sertifikaadi, mida saab kasutada vale sertifikaatide autoriseerimiseks juhuslike domeenide jaoks. Probleemi saab kasutada ka protokollide kompromiteerimiseks, mis s\u00f5ltuvad kollisioonide puudumisest, n\u00e4iteks TLS, SSH ja IPsec.<\/p>\n

Eeln\u00e4htud kollisioonide prefiksite leidmise strateegia t\u00e4histab arvutuste jagamist kaheks etapiks. Esimeses etapis otsitakse blokke, mis on kollisiooni piiril, sisestades juhuslikke muutujaid kettidesse ettem\u00e4\u00e4ratud sihikomplekti erinevustest. Teises etapis v\u00f5rreldakse saadud erinevuste ahelad individuaalsete plokkide tasemel kollisioonidega koos seotud olekute paaridega, kasutades traditsioonilisi kollisioonide tabamise meetodeid. <\/p>\n

Kuigi teoreetiline r\u00fcnnaku v\u00f5imalus SHA-1 vastu on t\u00f5estatud juba 2005. aastal, ja esimene kollisioon tuvastati praktikas leiti<\/a><\/noindex> 2017. aastal, on SHA-1 endiselt laialdaselt kasutusel ja esindab m\u00f5ningaid standardeid ja tehnoloogiaid (n\u00e4iteks TLS 1.2, Git jne). Peamine eesm\u00e4rk tehtud t\u00f6\u00f6s oli pakkuda veel \u00fcht kaalukat argumenti SHA-1 viivitamatuks l\u00f5petamiseks, eriti sertifikaatides ja digitaalallkirjades.<\/p>\n

Lisaks v\u00f5ib m\u00e4rkida avaldamist<\/a><\/noindex> tulemused<\/noindex> blokeeringute \u0161ifreerimise kr\u00fcptoanal\u00fc\u00fcsist SIMON-32\/64<\/a><\/noindex>, mis on v\u00e4lja t\u00f6\u00f6tatud USA NSA poolt ja kinnitatud 2018. aastal standardina ISO\/IEC 29167-21:2018<\/a><\/noindex>.
\nUurijatel \u00f5nnestus v\u00e4lja t\u00f6\u00f6tada meetod salajase v\u00f5tme taastamiseks, tuginedes kahte teadaolevat paari avatud teksti ja kr\u00fcpteeritud teksti. Piiratud arvutusressursside puhul v\u00f5tab v\u00f5tme leidmine aega mitu tundi kuni mitu p\u00e4eva. R\u00fcnnaku teoreetiline eduv\u00f5imalus on hinnanguliselt 0,25 ja olemasoleva protot\u00fc\u00fcbi praktikas 0,025.<\/p>\n

<\/a><\/noindex><\/p>\n

Allikas: opennet.ru<\/a><\/p>","protected":false,"gt_translate_keys":[{"key":"rendered","format":"html"}]},"excerpt":{"rendered":"

\u0418\u0441\u0441\u043b\u0435\u0434\u043e\u0432\u0430\u0442\u0435\u043b\u0438 \u0438\u0437 \u0444\u0440\u0430\u043d\u0446\u0443\u0437\u0441\u043a\u043e\u0433\u043e \u0433\u043e\u0441\u0443\u0434\u0430\u0440\u0441\u0442\u0432\u0435\u043d\u043d\u043e\u0433\u043e \u0438\u043d\u0441\u0442\u0438\u0442\u0443\u0442\u0430 \u0438\u0441\u0441\u043b\u0435\u0434\u043e\u0432\u0430\u043d\u0438\u0439 \u0432 \u0438\u043d\u0444\u043e\u0440\u043c\u0430\u0442\u0438\u043a\u0435 \u0438 \u0430\u0432\u0442\u043e\u043c\u0430\u0442\u0438\u043a\u0435 (INRIA) \u0438 \u041d\u0430\u043d\u044c\u044f\u043d\u0441\u043a\u043e\u0433\u043e \u0442\u0435\u0445\u043d\u043e\u043b\u043e\u0433\u0438\u0447\u0435\u0441\u043a\u043e\u0433\u043e \u0443\u043d\u0438\u0432\u0435\u0440\u0441\u0438\u0442\u0435\u0442\u0430 (\u0421\u0438\u043d\u0433\u0430\u043f\u0443\u0440) \u0440\u0430\u0437\u0440\u0430\u0431\u043e\u0442\u0430\u043b\u0438 \u0443\u0441\u043e\u0432\u0435\u0440\u0448\u0435\u043d\u0441\u0442\u0432\u043e\u0432\u0430\u043d\u043d\u044b\u0439 \u043c\u0435\u0442\u043e\u0434 \u0430\u0442\u0430\u043a\u0438 \u043d\u0430 \u0430\u043b\u0433\u043e\u0440\u0438\u0442\u043c SHA-1, \u0441\u0443\u0449\u0435\u0441\u0442\u0432\u0435\u043d\u043d\u043e \u0443\u043f\u0440\u043e\u0449\u0430\u044e\u0449\u0438\u0439 \u0441\u043e\u0437\u0434\u0430\u043d\u0438\u0435 \u0434\u0432\u0443\u0445 \u0440\u0430\u0437\u043d\u044b\u0445 \u0434\u043e\u043a\u0443\u043c\u0435\u043d\u0442\u043e\u0432 \u0441 \u043e\u0434\u0438\u043d\u0430\u043a\u043e\u0432\u044b\u043c\u0438 \u0445\u044d\u0448\u0430\u043c\u0438 SHA-1. \u0421\u0443\u0442\u044c \u043c\u0435\u0442\u043e\u0434\u0430 \u0432 \u0441\u0432\u0435\u0434\u0435\u043d\u0438\u0438 \u043e\u043f\u0435\u0440\u0430\u0446\u0438\u0438 \u043f\u043e\u043b\u043d\u043e\u0446\u0435\u043d\u043d\u043e\u0433\u043e \u043f\u043e\u0434\u0431\u043e\u0440\u0430 \u043a\u043e\u043b\u043b\u0438\u0437\u0438\u0438 \u0432 SHA-1 \u043a \u043a\u043e\u043b\u043b\u0438\u0437\u0438\u043e\u043d\u043d\u043e\u0439 \u0430\u0442\u0430\u043a\u0435 \u0441 \u0437\u0430\u0434\u0430\u043d\u043d\u044b\u043c \u043f\u0440\u0435\u0444\u0438\u043a\u0441\u043e\u043c, \u043f\u0440\u0438 \u043a\u043e\u0442\u043e\u0440\u043e\u0439 \u043a\u043e\u043b\u043b\u0438\u0437\u0438\u044f \u0432\u043e\u0437\u043d\u0438\u043a\u0430\u0435\u0442 \u043f\u0440\u0438 \u043d\u0430\u043b\u0438\u0447\u0438\u0438 […]<\/p>\n","protected":false,"gt_translate_keys":[{"key":"rendered","format":"html"}]},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[702],"tags":[],"class_list":["post-33517","post","type-post","status-publish","format-standard","hentry","category-news"],"aioseo_notices":[],"aioseo_head":"\n\t\t\n\t\n\t\n\t\n\t\n\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\n","aioseo_head_json":{"title":"\ud83e\udd47Esitatud on t\u00f5husam meetod SHA-1 kokkup\u00f5rgete eellugemise m\u00e4\u00e4ramiseks | ProHoster","description":"Prantsuse riikliku arvutitehnika ja automaatika uurimisinstituudi (INRIA) ja Nanyangi Tehnoloogia \u00dclikooli (Singapur) teadlased","canonical_url":"https:\/\/prohoster.info\/et\/blog\/news\/predstavlen-bolee-effektivnyj-metod-opredeleniya-prefiksov-kollizij-dlya-sha-1","robots":"max-image-preview:large","keywords":"","webmasterTools":{"miscellaneous":""},"schema":null,"og:locale":"et_EE","og:site_name":"ProHoster | \u041a\u0443\u043f\u0438\u0442\u044c \u043d\u0430\u0434\u0435\u0436\u043d\u044b\u0439 \u0445\u043e\u0441\u0442\u0438\u043d\u0433 \u0434\u043b\u044f \u0441\u0430\u0439\u0442\u043e\u0432 \u0441 \u0437\u0430\u0449\u0438\u0442\u043e\u0439 \u043e\u0442 DDoS, VPS VDS \u0441\u0435\u0440\u0432\u0435\u0440\u044b","og:type":"article","og:title":"\ud83e\udd47\u041f\u0440\u0435\u0434\u0441\u0442\u0430\u0432\u043b\u0435\u043d \u0431\u043e\u043b\u0435\u0435 \u044d\u0444\u0444\u0435\u043a\u0442\u0438\u0432\u043d\u044b\u0439 \u043c\u0435\u0442\u043e\u0434 \u043e\u043f\u0440\u0435\u0434\u0435\u043b\u0435\u043d\u0438\u044f \u043f\u0440\u0435\u0444\u0438\u043a\u0441\u043e\u0432 \u043a\u043e\u043b\u043b\u0438\u0437\u0438\u0439 \u0434\u043b\u044f SHA-1 | ProHoster","og:description":"\u0418\u0441\u0441\u043b\u0435\u0434\u043e\u0432\u0430\u0442\u0435\u043b\u0438 \u0438\u0437 \u0444\u0440\u0430\u043d\u0446\u0443\u0437\u0441\u043a\u043e\u0433\u043e \u0433\u043e\u0441\u0443\u0434\u0430\u0440\u0441\u0442\u0432\u0435\u043d\u043d\u043e\u0433\u043e \u0438\u043d\u0441\u0442\u0438\u0442\u0443\u0442\u0430 \u0438\u0441\u0441\u043b\u0435\u0434\u043e\u0432\u0430\u043d\u0438\u0439 \u0432 \u0438\u043d\u0444\u043e\u0440\u043c\u0430\u0442\u0438\u043a\u0435 \u0438 \u0430\u0432\u0442\u043e\u043c\u0430\u0442\u0438\u043a\u0435 (INRIA) \u0438 \u041d\u0430\u043d\u044c\u044f\u043d\u0441\u043a\u043e\u0433\u043e \u0442\u0435\u0445\u043d\u043e\u043b\u043e\u0433\u0438\u0447\u0435\u0441\u043a\u043e\u0433\u043e \u0443\u043d\u0438\u0432\u0435\u0440\u0441\u0438\u0442\u0435\u0442\u0430 (\u0421\u0438\u043d\u0433\u0430\u043f\u0443\u0440)","og:url":"https:\/\/prohoster.info\/et\/blog\/news\/predstavlen-bolee-effektivnyj-metod-opredeleniya-prefiksov-kollizij-dlya-sha-1","og:image":"https:\/\/prohoster.info\/wp-content\/uploads\/2021\/11\/logo-350.jpg","og:image:secure_url":"https:\/\/prohoster.info\/wp-content\/uploads\/2021\/11\/logo-350.jpg","og:image:width":350,"og:image:height":350,"article:published_time":"2019-10-31T18:53:04+00:00","article:modified_time":"2019-10-31T18:53:04+00:00","article:publisher":"https:\/\/www.facebook.com\/prohoster","article:author":"https:\/\/www.facebook.com\/prohoster"},"aioseo_meta_data":{"post_id":"33517","title":null,"description":null,"keywords":null,"keyphrases":null,"primary_term":null,"canonical_url":null,"og_title":null,"og_description":null,"og_object_type":"default","og_image_type":"default","og_image_url":null,"og_image_width":null,"og_image_height":null,"og_image_custom_url":null,"og_image_custom_fields":null,"og_video":null,"og_custom_url":null,"og_article_section":null,"og_article_tags":null,"twitter_use_og":false,"twitter_card":"default","twitter_image_type":"default","twitter_image_url":null,"twitter_image_custom_url":null,"twitter_image_custom_fields":null,"twitter_title":null,"twitter_description":null,"schema":{"blockGraphs":[],"customGraphs":[],"default":{"data":{"Article":[],"Course":[],"Dataset":[],"FAQPage":[],"Movie":[],"Person":[],"Product":[],"ProductReview":[],"Car":[],"Recipe":[],"Service":[],"SoftwareApplication":[],"WebPage":[]},"graphName":"","isEnabled":true},"graphs":[]},"schema_type":null,"schema_type_options":null,"pillar_content":false,"robots_default":true,"robots_noindex":false,"robots_noarchive":false,"robots_nosnippet":false,"robots_nofollow":false,"robots_noimageindex":false,"robots_noodp":false,"robots_notranslate":false,"robots_max_snippet":null,"robots_max_videopreview":null,"robots_max_imagepreview":"large","priority":null,"frequency":null,"local_seo":null,"seo_analyzer_scan_date":"2026-01-21 15:37:19","breadcrumb_settings":null,"limit_modified_date":false,"reviewed_by":null,"ai":null,"created":"2021-03-01 02:39:23","updated":"2026-01-21 15:37:19","focus_keyword":null,"additional_keywords":null,"truseo_locale":null},"gt_translate_keys":[{"key":"link","format":"url"}],"_links":{"self":[{"href":"https:\/\/prohoster.info\/et\/wp-json\/wp\/v2\/posts\/33517","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/prohoster.info\/et\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/prohoster.info\/et\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/prohoster.info\/et\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/prohoster.info\/et\/wp-json\/wp\/v2\/comments?post=33517"}],"version-history":[{"count":0,"href":"https:\/\/prohoster.info\/et\/wp-json\/wp\/v2\/posts\/33517\/revisions"}],"wp:attachment":[{"href":"https:\/\/prohoster.info\/et\/wp-json\/wp\/v2\/media?parent=33517"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/prohoster.info\/et\/wp-json\/wp\/v2\/categories?post=33517"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/prohoster.info\/et\/wp-json\/wp\/v2\/tags?post=33517"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}