{"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\/hu\/blog\/news\/predstavlen-bolee-effektivnyj-metod-opredeleniya-prefiksov-kollizij-dlya-sha-1","title":{"rendered":"Bemutatkozott egy hat\u00e9konyabb m\u00f3dszer a SHA-1 \u00fctk\u00f6z\u00e9sek prefixel\u00e9s\u00e9nek meghat\u00e1roz\u00e1s\u00e1ra.","gt_translate_keys":[{"key":"rendered","format":"text"}]},"content":{"rendered":"

A francia Informatika \u00e9s Automatiz\u00e1l\u00e1s \u00c1llami Kutat\u00f3int\u00e9zet (INRIA) \u00e9s a Nanyang Technological University (Szingap\u00far) kutat\u00f3i. kifejlesztettek<\/a><\/noindex> fejlesztett met\u00f3dus<\/a><\/noindex> U1.1.9.6. A t\u00e1mad\u00f3k a hiteles\u00edt\u0151 adatok billenty\u0171zeten val\u00f3 be\u00edr\u00e1s\u00e1t a billenty\u0171k megnyom\u00e1s\u00e1nak hangj\u00e1nak elemz\u00e9s\u00e9vel figyelt\u00e9k meg.<\/a><\/noindex> az SHA-1 algoritmushoz, amely l\u00e9nyegesen megk\u00f6nny\u00edti k\u00e9t k\u00fcl\u00f6nb\u00f6z\u0151 dokumentum l\u00e9trehoz\u00e1s\u00e1t azonos SHA-1 hash-el. A m\u00f3dszer l\u00e9nyege, hogy a SHA-1 \u00fctk\u00f6z\u00e9s teljes m\u00e9rt\u00e9k\u0171 brute force keres\u00e9s\u00e9t a megadott prefixre t\u00f6rt\u00e9n\u0151 \u00fctk\u00f6z\u00e9ses t\u00e1mad\u00e1ssal<\/a><\/noindex>, ahol \u00fctk\u00f6z\u00e9s l\u00e9p fel bizonyos prefixek jelenl\u00e9t\u00e9ben, f\u00fcggetlen\u00fcl a t\u00f6bbi adatt\u00f3l a k\u00e9szletben. M\u00e1s szavakkal, kisz\u00e1m\u00edthat\u00f3 k\u00e9t el\u0151re meghat\u00e1rozott prefix, \u00e9s ha az egyiket egy dokumentumhoz csatoljuk, a m\u00e1sikat pedig a m\u00e1sodikhoz — a k\u00e9t f\u00e1jl SHA-1 hash \u00e9rt\u00e9kei megegyeznek.<\/p>\n

Ez a t\u00e1mad\u00e1si forma m\u00e9g mindig hatalmas sz\u00e1m\u00edt\u00e1si ig\u00e9nyeket t\u00e1maszt, \u00e9s a prefixek keres\u00e9se nehezebb, mint a hagyom\u00e1nyos \u00fctk\u00f6z\u00e9sek keres\u00e9se, de a gyakorlati hat\u00e9konys\u00e1ga l\u00e9nyegesen magasabb. Ha eddig a leggyorsabb m\u00f3dszer a SHA-1 \u00fctk\u00f6z\u00e9sek prefix\u00e9nek keres\u00e9s\u00e9re 277,1 m\u0171veletet ig\u00e9nyelt, akkor az \u00faj m\u00f3dszer a sz\u00e1m\u00edt\u00e1sok sz\u00e1m\u00e1t 266,9 \u00e9s 269,4 k\u00f6z\u00e9 cs\u00f6kkenti. Ezen a szinten a t\u00e1mad\u00e1s becs\u00fclt k\u00f6lts\u00e9ge kevesebb mint sz\u00e1zezer doll\u00e1r, ami elfogadhat\u00f3 az \u00fcgyn\u00f6ks\u00e9gek \u00e9s nagyv\u00e1llalatok sz\u00e1m\u00e1ra. \u00d6sszehasonl\u00edt\u00e1sk\u00e9ppen egy \u00e1tlagos \u00fctk\u00f6z\u00e9s keres\u00e9s\u00e9hez k\u00f6r\u00fclbel\u00fcl 264,7 m\u0171veletre van sz\u00fcks\u00e9g.<\/p>\n

A el\u0151z\u0151<\/a><\/noindex> bemutat\u00f3k<\/a><\/noindex> a Google \u00e1ltal k\u00fcl\u00f6nb\u00f6z\u0151 PDF f\u00e1jlok gener\u00e1l\u00e1s\u00e1nak lehet\u0151s\u00e9ge, azonos SHA-1 hash-el. haszn\u00e1lat\u00e1val<\/a><\/noindex> A m\u00f3dszer, amely lehet\u0151v\u00e9 teszi k\u00e9t dokumentum egy f\u00e1jlba val\u00f3 egyes\u00edt\u00e9s\u00e9t, a l\u00e1that\u00f3 r\u00e9teg v\u00e1ltakoztat\u00e1s\u00e1val \u00e9s a r\u00e9tegv\u00e1laszt\u00f3 jel\u00f6l\u0151 elmozd\u00edt\u00e1s\u00e1val a \u00fctk\u00f6z\u00e9s keletkez\u00e9s\u00e9nek ter\u00fclet\u00e9n. Hasonl\u00f3 er\u0151forr\u00e1s-k\u00f6lts\u00e9gek mellett (a Google egy \u00e9vig sz\u00e1molt SHA-1 els\u0151 \u00fctk\u00f6z\u00e9s\u00e9nek keres\u00e9s\u00e9re egy 110 GPU-b\u00f3l \u00e1ll\u00f3 klaszterrel) az \u00faj m\u00f3dszer lehet\u0151v\u00e9 teszi a SHA-1 egyez\u0151s\u00e9g\u00e9nek el\u00e9r\u00e9s\u00e9t k\u00e9t tetsz\u0151leges adathalmazon. Gyakorlati szempontb\u00f3l TLS-tan\u00fas\u00edtv\u00e1nyokat lehet el\u0151k\u00e9sz\u00edteni, amelyek elt\u00e9r\u0151 domaineket eml\u00edtenek, de a SHA-1 hashek egyeznek. Ez a lehet\u0151s\u00e9g lehet\u0151v\u00e9 teszi, hogy egy tisztess\u00e9gtelen hiteles\u00edt\u0151 hat\u00f3s\u00e1g tan\u00fas\u00edtv\u00e1nyt k\u00e9sz\u00edtsen egy digit\u00e1lis al\u00e1\u00edr\u00e1shoz, amelyet hamis tan\u00fas\u00edtv\u00e1nyok azonos\u00edt\u00e1s\u00e1ra haszn\u00e1lhatnak tetsz\u0151leges domainekhez. A probl\u00e9ma a TLS, SSH \u00e9s IPsec olyan protokollok kompromitt\u00e1l\u00e1s\u00e1hoz is felhaszn\u00e1lhat\u00f3, amelyek nem sz\u00e1m\u00edtanak \u00fctk\u00f6z\u00e9sekre.<\/p>\n

A javasolt \u00fctk\u00f6z\u00e9shez vezet\u0151 prefix keres\u00e9si strat\u00e9gia a sz\u00e1m\u00edt\u00e1sok k\u00e9t szakaszra bont\u00e1s\u00e1t felt\u00e9telezi. Az els\u0151 szakaszban a hat\u00e1reset \u00fctk\u00f6z\u00e9sre v\u00e1r\u00f3 blokkok keres\u00e9se t\u00f6rt\u00e9nik, v\u00e9letlenszer\u0171 v\u00e1ltoz\u00f3 l\u00e1ncok be\u00e1gyaz\u00e1s\u00e1val egy el\u0151re meghat\u00e1rozott c\u00e9lk\u00fcl\u00f6nbs\u00e9gek k\u00e9szletbe. A m\u00e1sodik szakaszban, egyes blokkok szintj\u00e9n, a kapott k\u00fcl\u00f6nbs\u00e9g-l\u00e1ncokat p\u00e1ros\u00edtj\u00e1k a \u00fctk\u00f6z\u00e9ssel j\u00e1r\u00f3 \u00e1llapotok p\u00e1rjaival, a hagyom\u00e1nyos \u00fctk\u00f6z\u00e9s kiv\u00e1laszt\u00e1si t\u00e1mad\u00e1si m\u00f3dszereket alkalmazva. <\/p>\n

B\u00e1r a SHA-1 ellen ir\u00e1nyul\u00f3 elm\u00e9leti t\u00e1mad\u00e1s lehet\u0151s\u00e9ge m\u00e1r 2005-ben bizony\u00edt\u00e1st nyert, \u00e9s a gyakorlatban az els\u0151 \u00fctk\u00f6z\u00e9st 92903<\/a><\/noindex> 2017-ben \u00e9s a SHA-1 m\u00e9g mindig haszn\u00e1latban van bizonyos szabv\u00e1nyokban \u00e9s technol\u00f3gi\u00e1kban (TLS 1.2, Git stb.). A v\u00e9gzett munka f\u0151 c\u00e9lja az volt, hogy \u00fajabb megalapozott \u00e9rvet ny\u00fajtson a SHA-1 azonnali haszn\u00e1lat\u00e1nak megsz\u00fcntet\u00e9s\u00e9re, k\u00fcl\u00f6n\u00f6sen a tan\u00fas\u00edtv\u00e1nyokban \u00e9s digit\u00e1lis al\u00e1\u00edr\u00e1sokban.<\/p>\n

Tov\u00e1bbi megjegyz\u00e9sk\u00e9nt k\u00f6zz\u00e9 tette<\/a><\/noindex> eredm\u00e9nyek<\/noindex> blokk titkos\u00edt\u00e1si kriptogr\u00e1fiai elemz\u00e9se SIMON-32\/64<\/a><\/noindex>, amelyeket az Egyes\u00fclt \u00c1llamok Nemzetbiztons\u00e1gi \u00dcgyn\u00f6ks\u00e9ge fejlesztett ki, \u00e9s 2018-ban hagytak j\u00f3v\u00e1 mint szabv\u00e1nyt. ISO\/IEC 29167-21:2018<\/a><\/noindex>.
\nA kutat\u00f3knak siker\u00fclt kidolgozniuk egy m\u00f3dszert a titkos kulcs vissza\u00e1ll\u00edt\u00e1s\u00e1ra k\u00e9t ismert ny\u00edlt sz\u00f6veg \u00e9s titkos sz\u00f6veg p\u00e1r alapj\u00e1n. Korl\u00e1tozott sz\u00e1m\u00edt\u00e1si forr\u00e1sok mellett a kulcs kital\u00e1l\u00e1s\u00e1hoz sz\u00fcks\u00e9ges id\u0151 n\u00e9h\u00e1ny \u00f3r\u00e1t\u00f3l n\u00e9h\u00e1ny napig terjed. A t\u00e1mad\u00e1s elm\u00e9leti sikeress\u00e9gi ar\u00e1ny\u00e1t 0,25-re, a megl\u00e9v\u0151 protot\u00edpus gyakorlati ar\u00e1ny\u00e1t pedig 0,025-re becs\u00fclik.<\/p>\n

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

Forr\u00e1s: 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\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\udd47Bemutat\u00e1sra ker\u00fclt egy hat\u00e9konyabb m\u00f3dszer a SHA-1 \u00fctk\u00f6z\u00e9sek el\u0151tagjainak meghat\u00e1roz\u00e1s\u00e1ra | ProHoster","description":"A francia Informatika \u00e9s Automatiz\u00e1l\u00e1s \u00c1llami Kutat\u00f3int\u00e9zet (INRIA) \u00e9s a Nanyang Technological University (Szingap\u00far) kutat\u00f3i.","canonical_url":"https:\/\/prohoster.info\/hu\/blog\/news\/predstavlen-bolee-effektivnyj-metod-opredeleniya-prefiksov-kollizij-dlya-sha-1","robots":"max-image-preview:large","keywords":"","webmasterTools":{"miscellaneous":""},"schema":null,"og:locale":"hu_HU","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\/hu\/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\/hu\/wp-json\/wp\/v2\/posts\/33517","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/prohoster.info\/hu\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/prohoster.info\/hu\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/prohoster.info\/hu\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/prohoster.info\/hu\/wp-json\/wp\/v2\/comments?post=33517"}],"version-history":[{"count":0,"href":"https:\/\/prohoster.info\/hu\/wp-json\/wp\/v2\/posts\/33517\/revisions"}],"wp:attachment":[{"href":"https:\/\/prohoster.info\/hu\/wp-json\/wp\/v2\/media?parent=33517"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/prohoster.info\/hu\/wp-json\/wp\/v2\/categories?post=33517"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/prohoster.info\/hu\/wp-json\/wp\/v2\/tags?post=33517"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}