{"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\/cs\/blog\/news\/predstavlen-bolee-effektivnyj-metod-opredeleniya-prefiksov-kollizij-dlya-sha-1","title":{"rendered":"Byl p\u0159edstaven efektivn\u011bj\u0161\u00ed zp\u016fsob ur\u010dov\u00e1n\u00ed kolizn\u00edch prefix\u016f pro SHA-1","gt_translate_keys":[{"key":"rendered","format":"text"}]},"content":{"rendered":"<p>V\u00fdzkumn\u00edci z francouzsk\u00e9ho st\u00e1tn\u00edho institutu pro v\u00fdzkum informatiky a automatizace (INRIA) a Nanyangsk\u00e9 technologick\u00e9 univerzity (Singapur) <noindex><a rel=\"nofollow\" href=\"https:\/\/mailarchive.ietf.org\/arch\/msg\/cfrg\/NhiGvOFzcEw108YLwF_ndyfB1k4\">vyvinuli<\/a><\/noindex> vylep\u0161en\u00fd <noindex><a rel=\"nofollow\" href=\"https:\/\/eprint.iacr.org\/2019\/459\">metoda<\/a><\/noindex> <noindex><a rel=\"nofollow\" href=\"https:\/\/eprint.iacr.org\/2019\/459.pdf\">\u00fatok\u016fm<\/a><\/noindex> na algoritmus SHA-1, kter\u00fd v\u00fdznamn\u011b usnad\u0148uje vytv\u00e1\u0159en\u00ed dvou r\u016fzn\u00fdch dokument\u016f se stejn\u00fdmi hash hodnotami SHA-1. Podstata metody spo\u010d\u00edv\u00e1 ve zjednodu\u0161en\u00ed operace pln\u00e9ho vyhled\u00e1v\u00e1n\u00ed koliz\u00ed v SHA-1 na <noindex><a rel=\"nofollow\" href=\"https:\/\/ru.wikipedia.org\/wiki\/%D0%9A%D0%BE%D0%BB%D0%BB%D0%B8%D0%B7%D0%B8%D0%BE%D0%BD%D0%BD%D0%B0%D1%8F_%D0%B0%D1%82%D0%B0%D0%BA%D0%B0#%D0%9A%D0%BE%D0%BB%D0%BB%D0%B8%D0%B7%D0%B8%D0%BE%D0%BD%D0%BD%D0%B0%D1%8F_%D0%B0%D1%82%D0%B0%D0%BA%D0%B0_%D1%81_%D0%B7%D0%B0%D0%B4%D0%B0%D0%BD%D0%BD%D1%8B%D0%BC_%D0%BF%D1%80%D0%B5%D1%84%D0%B8%D0%BA%D1%81%D0%BE%D0%BC\">kolizn\u00ed \u00fatok se zadan\u00fdm prefixem<\/a><\/noindex>, p\u0159i kter\u00e9 kolize nast\u00e1v\u00e1 za p\u0159\u00edtomnosti ur\u010dit\u00e9ho prefixu, bez ohledu na ostatn\u00ed data v sad\u011b. Jin\u00fdmi slovy, lze vypo\u010d\u00edtat dva p\u0159edem definovan\u00e9 prefixy a pokud jeden p\u0159ipoj\u00edme k jednomu dokumentu, a druh\u00fd k druh\u00e9mu \u2014 v\u00fdsledn\u00e9 SHA-1 hashe t\u011bchto soubor\u016f budou stejn\u00e9.<\/p>\n<p>Tento typ \u00fatoku st\u00e1le vy\u017eaduje obrovsk\u00e9 v\u00fdpo\u010dty a hled\u00e1n\u00ed prefix\u016f z\u016fst\u00e1v\u00e1 slo\u017eit\u011bj\u0161\u00ed ne\u017e b\u011b\u017en\u00e9 vyhled\u00e1v\u00e1n\u00ed koliz\u00ed, ale praktick\u00e1 efektivita v\u00fdsledku je v\u00fdrazn\u011b vy\u0161\u0161\u00ed. Pokud p\u0159edt\u00edm byl nejrychlej\u0161\u00ed metodou hled\u00e1n\u00ed prefix\u016f koliz\u00ed v SHA-1 prov\u00e9st 277,1 operac\u00ed, nov\u00e1 metoda sni\u017euje po\u010det v\u00fdpo\u010dt\u016f na rozmez\u00ed 266,9 a\u017e 269,4. P\u0159i t\u00e9to \u00farovni v\u00fdpo\u010dt\u016f je odhadovan\u00e1 cena \u00fatoku m\u00e9n\u011b ne\u017e sto tis\u00edc dolar\u016f, co\u017e je pro tajn\u00e9 slu\u017eby a velk\u00e9 korporace p\u0159ijateln\u00e9. Pro srovn\u00e1n\u00ed, pro hled\u00e1n\u00ed b\u011b\u017en\u00e9 kolize je nutn\u00e9 prov\u00e9st p\u0159ibli\u017en\u011b 264,7 operac\u00ed.<\/p>\n<p>V <noindex><a rel=\"nofollow\" href=\"https:\/\/www.opennet.ru\/opennews\/art.shtml?num=46091\">minul\u00e9m<\/a><\/noindex> <noindex><a rel=\"nofollow\" href=\"https:\/\/shattered.it\/\">demonstrace<\/a><\/noindex>  Google mo\u017enost\u00ed generovat r\u016fzn\u00e9 PDF soubory se stejn\u00fdm hashem SHA-1 <noindex><a rel=\"nofollow\" href=\"https:\/\/www.opennet.ru\/opennews\/art.shtml?num=46102\">byla pou\u017eita<\/a><\/noindex> finta se slou\u010den\u00edm dvou dokument\u016f do jednoho souboru, p\u0159ep\u00edn\u00e1n\u00edm viditeln\u00e9 vrstvy a posunem zna\u010dky v\u00fdb\u011bru vrstvy do oblasti vzniku kolize. P\u0159i podobn\u00fdch n\u00e1kladech na zdroje (na hled\u00e1n\u00ed prvn\u00ed kolize SHA-1 Google str\u00e1vil rok v\u00fdpo\u010dt\u016f na clusterech s 110 GPU) nov\u00e1 metoda umo\u017e\u0148uje dos\u00e1hnout shody SHA-1 pro dv\u011b libovoln\u00e9 datov\u00e9 sady. Z praktick\u00e9ho hlediska je mo\u017en\u00e9 p\u0159ipravit TLS certifik\u00e1ty, ve kter\u00fdch se uv\u00e1d\u011bj\u00ed r\u016fzn\u00e9 dom\u00e9ny, ale shoduj\u00ed se hashe SHA-1. Takov\u00e1 mo\u017enost umo\u017e\u0148uje nekal\u00e9mu certifika\u010dn\u00edmu \u00fa\u0159adu vytvo\u0159it certifik\u00e1t pro digit\u00e1ln\u00ed podpis, kter\u00fd lze pou\u017e\u00edt k autorizaci fale\u0161n\u00fdch certifik\u00e1t\u016f na libovoln\u00e9 dom\u00e9ny. Probl\u00e9m lze tak\u00e9 vyu\u017e\u00edt k naru\u0161en\u00ed protokol\u016f, kter\u00e9 se spol\u00e9haj\u00ed na absenci koliz\u00ed, jako jsou TLS, SSH a IPsec.<\/p>\n<p>Navr\u017een\u00e1 strategie hled\u00e1n\u00ed prefix\u016f pro kolize p\u0159edpokl\u00e1d\u00e1 rozd\u011blen\u00ed v\u00fdpo\u010dt\u016f na dv\u011b etapy. V prvn\u00ed etap\u011b se prov\u00e1d\u00ed vyhled\u00e1v\u00e1n\u00ed blok\u016f, kter\u00e9 jsou na pokraji kolize, pomoc\u00ed vkl\u00e1d\u00e1n\u00ed n\u00e1hodn\u00fdch prom\u011bnn\u00fdch \u0159et\u011bzc\u016f do p\u0159edem stanoven\u00e9 c\u00edlov\u00e9 mno\u017einy rozd\u00edl\u016f. Ve druh\u00e9 etap\u011b na \u00farovni jednotliv\u00fdch blok\u016f se z\u00edskan\u00e9 \u0159et\u011bzce rozd\u00edl\u016f porovn\u00e1vaj\u00ed s kolizn\u00edmi dvojicemi stav\u016f, s pou\u017eit\u00edm metod tradi\u010dn\u00edch \u00fatok\u016f pro hled\u00e1n\u00ed koliz\u00ed. <\/p>\n<p>I p\u0159es to, \u017ee teoretick\u00e1 mo\u017enost \u00fatoku na SHA-1 byla prok\u00e1z\u00e1na ji\u017e v roce 2005 a prvn\u00ed kolize byla ve skute\u010dnosti <noindex><a rel=\"nofollow\" href=\"https:\/\/www.opennet.ru\/opennews\/art.shtml?num=46091\">vykouzlen\u00e1<\/a><\/noindex> v roce 2017, SHA-1 st\u00e1le z\u016fst\u00e1v\u00e1 v ob\u011bhu a je zahrnuta v n\u011bkter\u00fdch standardech a technologi\u00edch (TLS 1.2, Git atd.). Hlavn\u00edm c\u00edlem proveden\u00e9 pr\u00e1ce bylo poskytnout dal\u0161\u00ed siln\u00fd argument pro okam\u017eit\u00e9 p\u0159eru\u0161en\u00ed pou\u017e\u00edv\u00e1n\u00ed SHA-1, zejm\u00e9na v certifik\u00e1tech a digit\u00e1ln\u00edch podeps\u00e1n\u00edch.<\/p>\n<p>D\u00e1le lze poznamenat <noindex><a rel=\"nofollow\" href=\"https:\/\/eprint.iacr.org\/2019\/474\">publikaci<\/a><\/noindex> <noindex>v\u00fdsledk\u016f<\/noindex> kryptoanal\u00fdzy blokov\u00fdch \u0161ifrovac\u00edch algoritm\u016f <noindex><a rel=\"nofollow\" href=\"https:\/\/en.wikipedia.org\/wiki\/Simon_(cipher)\">SIMON-32\/64<\/a><\/noindex>, vyvinut\u00fdch NSA a v roce 2018 schv\u00e1len\u00fdch jako standard <noindex><a rel=\"nofollow\" href=\"https:\/\/www.iso.org\/ru\/standard\/70388.html\">ISO\/IEC 29167-21:2018<\/a><\/noindex>.<br \/>\nV\u00fdzkumn\u00edk\u016fm se poda\u0159ilo vyvinout metodu pro obnovu soukrom\u00e9ho kl\u00ed\u010de na z\u00e1klad\u011b dvou zn\u00e1m\u00fdch p\u00e1r\u016f z otev\u0159en\u00e9ho textu a \u0161ifrotextu. P\u0159i omezen\u00fdch v\u00fdpo\u010detn\u00edch zdroj\u00edch trv\u00e1 nalezen\u00ed kl\u00ed\u010de od n\u011bkolika hodin do n\u011bkolika dn\u016f. Teoretick\u00fd \u00fasp\u011b\u0161nost \u00fatoku je odhadov\u00e1na na 0,25, zat\u00edmco praktick\u00e1 pro st\u00e1vaj\u00edc\u00ed prototyp \u2014 0,025.<\/p>\n<p><noindex><a rel=\"nofollow\" name=\"link\"><\/a><\/noindex><\/p>\n<p>Zdroj: <a \ncontent=\"nofollow\" rel=\"nofollow\" href=\"https:\/\/www.opennet.ru\/opennews\/art.shtml?num=50674\">opennet.ru<\/a><\/p>","protected":false,"gt_translate_keys":[{"key":"rendered","format":"html"}]},"excerpt":{"rendered":"<p>\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 [&hellip;]<\/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<!-- All in One SEO 5.0.3 - aioseo.com -->\n\t<meta name=\"description\" content=\"\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)\" \/>\n\t<meta name=\"robots\" content=\"max-image-preview:large\" \/>\n\t<meta name=\"author\" content=\"Yuri Gagarin\"\/>\n\t<link rel=\"canonical\" href=\"https:\/\/prohoster.info\/cs\/blog\/news\/predstavlen-bolee-effektivnyj-metod-opredeleniya-prefiksov-kollizij-dlya-sha-1\" \/>\n\t\t<meta name=\"generator\" content=\"All in One SEO (AIOSEO) 5.0.3\" \/>\n\t\t<meta property=\"og:locale\" content=\"cs_CZ\" \/>\n\t\t<meta property=\"og:site_name\" content=\"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\" \/>\n\t\t<meta property=\"og:type\" content=\"article\" \/>\n\t\t<meta property=\"og:title\" content=\"\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\" \/>\n\t\t<meta property=\"og:description\" content=\"\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)\" \/>\n\t\t<meta property=\"og:url\" content=\"https:\/\/prohoster.info\/cs\/blog\/news\/predstavlen-bolee-effektivnyj-metod-opredeleniya-prefiksov-kollizij-dlya-sha-1\" \/>\n\t\t<meta property=\"og:image\" content=\"https:\/\/prohoster.info\/wp-content\/uploads\/2021\/11\/logo-350.jpg\" \/>\n\t\t<meta property=\"og:image:secure_url\" content=\"https:\/\/prohoster.info\/wp-content\/uploads\/2021\/11\/logo-350.jpg\" \/>\n\t\t<meta property=\"og:image:width\" content=\"350\" \/>\n\t\t<meta property=\"og:image:height\" content=\"350\" \/>\n\t\t<meta property=\"article:published_time\" content=\"2019-10-31T18:53:04+00:00\" \/>\n\t\t<meta property=\"article:modified_time\" content=\"2019-10-31T18:53:04+00:00\" \/>\n\t\t<meta property=\"article:publisher\" content=\"https:\/\/www.facebook.com\/prohoster\" \/>\n\t\t<meta property=\"article:author\" content=\"https:\/\/www.facebook.com\/prohoster\" \/>\n\t\t<!-- All in One SEO -->\n\n","aioseo_head_json":{"title":"\ud83e\udd47Byla p\u0159edstavena efektivn\u011bj\u0161\u00ed metoda ur\u010den\u00ed prefix\u016f koliz\u00ed pro SHA-1 | ProHoster","description":"V\u00fdzkumn\u00edci z francouzsk\u00e9ho st\u00e1tn\u00edho institutu pro v\u00fdzkum informatiky a automatizace (INRIA) a Nanyangsk\u00e9 technologick\u00e9 univerzity (Singapur)","canonical_url":"https:\/\/prohoster.info\/cs\/blog\/news\/predstavlen-bolee-effektivnyj-metod-opredeleniya-prefiksov-kollizij-dlya-sha-1","robots":"max-image-preview:large","keywords":"","webmasterTools":{"miscellaneous":""},"schema":null,"og:locale":"cs_CZ","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\/cs\/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\/cs\/wp-json\/wp\/v2\/posts\/33517","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/prohoster.info\/cs\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/prohoster.info\/cs\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/prohoster.info\/cs\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/prohoster.info\/cs\/wp-json\/wp\/v2\/comments?post=33517"}],"version-history":[{"count":0,"href":"https:\/\/prohoster.info\/cs\/wp-json\/wp\/v2\/posts\/33517\/revisions"}],"wp:attachment":[{"href":"https:\/\/prohoster.info\/cs\/wp-json\/wp\/v2\/media?parent=33517"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/prohoster.info\/cs\/wp-json\/wp\/v2\/categories?post=33517"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/prohoster.info\/cs\/wp-json\/wp\/v2\/tags?post=33517"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}