New strategy for searching disturbance vector of SHA-1 collision attack

Dear editor,We present a new algorithm to search for effective disturbance vectors with a complexity of 2~（38）based on the following two properties of disturbance vectors.One property is the weight correlation between the first 16-step disturbance vectors and the60-step disturbance vectors.The other...

Full description

Saved in:
Bibliographic Details
Published in:Science China. Information sciences 2017-12, Vol.60 (12), p.276-278, Article 129101
Main Authors: Feng, Hao, Zeng, Guang, Han, Wenbao, Yang, Yang
Format: Article
Language:English
Subjects:
Computer Science
Information Systems and Communication Service
Letter
SHA-1
向量
属性
性能要求
扰动
搜索
碰撞攻击
阶跃
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites cdi_FETCH-LOGICAL-c338t-1bef3dc8a592a6cea5c34e8d7042df5dbd6f8ce4f9da3987f33b8e8439c354313
container_end_page 278
container_issue 12
container_start_page 276
container_title Science China. Information sciences
container_volume 60
creator Feng, Hao
Zeng, Guang
Han, Wenbao
Yang, Yang
description Dear editor,We present a new algorithm to search for effective disturbance vectors with a complexity of 2~（38）based on the following two properties of disturbance vectors.One property is the weight correlation between the first 16-step disturbance vectors and the60-step disturbance vectors.The other property requires all the differences of the active bit positions of the first 16-step disturbance vectors to be
doi_str_mv 10.1007/s11432-016-9241-x
format article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2918579606</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><cqvip_id>673840374</cqvip_id><sourcerecordid>2918579606</sourcerecordid><originalsourceid>FETCH-LOGICAL-c338t-1bef3dc8a592a6cea5c34e8d7042df5dbd6f8ce4f9da3987f33b8e8439c354313</originalsourceid><addsrcrecordid>eNp9kEFLAzEQhYMoWLQ_wFvQczTZyW6SYynaCkUPKngL2Wyy3Vp322Sr7b83pUVvzmUG5n3vwUPoitFbRqm4i4xxyAhlBVEZZ2R7ggZMFoowxdRpugvBiQB4P0fDGBc0DQDNhBygyZP7xrEPpnf1Dvsu4OhMsPOmrXHVxH4TStNah7-c7dOz8_hlOiIM2265bGLTtdj0vbEfl-jMm2V0w-O-QG8P96_jKZk9Tx7HoxmxALInrHQeKitNrjJTWGdyC9zJSlCeVT6vyqrw0jruVWVASeEBSukkB2Uh58DgAt0cfFehW29c7PWi24Q2RepMMZkLVdAiqdhBZUMXY3Ber0LzacJOM6r3lelDZTpVpveV6W1isgMTk7atXfhz_g-6PgbNu7ZeJ-43qRAgOQXB4QfhB3o7</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2918579606</pqid></control><display><type>article</type><title>New strategy for searching disturbance vector of SHA-1 collision attack</title><source>Springer Nature</source><creator>Feng, Hao ; Zeng, Guang ; Han, Wenbao ; Yang, Yang</creator><creatorcontrib>Feng, Hao ; Zeng, Guang ; Han, Wenbao ; Yang, Yang</creatorcontrib><description>Dear editor,We present a new algorithm to search for effective disturbance vectors with a complexity of 2~（38）based on the following two properties of disturbance vectors.One property is the weight correlation between the first 16-step disturbance vectors and the60-step disturbance vectors.The other property requires all the differences of the active bit positions of the first 16-step disturbance vectors to be</description><identifier>ISSN: 1674-733X</identifier><identifier>EISSN: 1869-1919</identifier><identifier>DOI: 10.1007/s11432-016-9241-x</identifier><language>eng</language><publisher>Beijing: Science China Press</publisher><subject>Computer Science ; Information Systems and Communication Service ; Letter ; SHA-1 ; 向量 ; 属性 ; 性能要求 ; 扰动 ; 搜索 ; 碰撞攻击 ; 阶跃</subject><ispartof>Science China. Information sciences, 2017-12, Vol.60 (12), p.276-278, Article 129101</ispartof><rights>Science China Press and Springer-Verlag GmbH Germany, part of Springer Nature 2017</rights><rights>Science China Press and Springer-Verlag GmbH Germany, part of Springer Nature 2017.</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c338t-1bef3dc8a592a6cea5c34e8d7042df5dbd6f8ce4f9da3987f33b8e8439c354313</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Uhttp://image.cqvip.com/vip1000/qk/84009A/84009A.jpg</thumbnail><link.rule.ids>314,777,781,27905,27906</link.rule.ids></links><search><creatorcontrib>Feng, Hao</creatorcontrib><creatorcontrib>Zeng, Guang</creatorcontrib><creatorcontrib>Han, Wenbao</creatorcontrib><creatorcontrib>Yang, Yang</creatorcontrib><title>New strategy for searching disturbance vector of SHA-1 collision attack</title><title>Science China. Information sciences</title><addtitle>Sci. China Inf. Sci</addtitle><addtitle>SCIENCE CHINA Information Sciences</addtitle><description>Dear editor,We present a new algorithm to search for effective disturbance vectors with a complexity of 2~（38）based on the following two properties of disturbance vectors.One property is the weight correlation between the first 16-step disturbance vectors and the60-step disturbance vectors.The other property requires all the differences of the active bit positions of the first 16-step disturbance vectors to be</description><subject>Computer Science</subject><subject>Information Systems and Communication Service</subject><subject>Letter</subject><subject>SHA-1</subject><subject>向量</subject><subject>属性</subject><subject>性能要求</subject><subject>扰动</subject><subject>搜索</subject><subject>碰撞攻击</subject><subject>阶跃</subject><issn>1674-733X</issn><issn>1869-1919</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2017</creationdate><recordtype>article</recordtype><recordid>eNp9kEFLAzEQhYMoWLQ_wFvQczTZyW6SYynaCkUPKngL2Wyy3Vp322Sr7b83pUVvzmUG5n3vwUPoitFbRqm4i4xxyAhlBVEZZ2R7ggZMFoowxdRpugvBiQB4P0fDGBc0DQDNhBygyZP7xrEPpnf1Dvsu4OhMsPOmrXHVxH4TStNah7-c7dOz8_hlOiIM2265bGLTtdj0vbEfl-jMm2V0w-O-QG8P96_jKZk9Tx7HoxmxALInrHQeKitNrjJTWGdyC9zJSlCeVT6vyqrw0jruVWVASeEBSukkB2Uh58DgAt0cfFehW29c7PWi24Q2RepMMZkLVdAiqdhBZUMXY3Ber0LzacJOM6r3lelDZTpVpveV6W1isgMTk7atXfhz_g-6PgbNu7ZeJ-43qRAgOQXB4QfhB3o7</recordid><startdate>20171201</startdate><enddate>20171201</enddate><creator>Feng, Hao</creator><creator>Zeng, Guang</creator><creator>Han, Wenbao</creator><creator>Yang, Yang</creator><general>Science China Press</general><general>Springer Nature B.V</general><scope>2RA</scope><scope>92L</scope><scope>CQIGP</scope><scope>W92</scope><scope>~WA</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>8FE</scope><scope>8FG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K7-</scope><scope>P5Z</scope><scope>P62</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope></search><sort><creationdate>20171201</creationdate><title>New strategy for searching disturbance vector of SHA-1 collision attack</title><author>Feng, Hao ; Zeng, Guang ; Han, Wenbao ; Yang, Yang</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c338t-1bef3dc8a592a6cea5c34e8d7042df5dbd6f8ce4f9da3987f33b8e8439c354313</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2017</creationdate><topic>Computer Science</topic><topic>Information Systems and Communication Service</topic><topic>Letter</topic><topic>SHA-1</topic><topic>向量</topic><topic>属性</topic><topic>性能要求</topic><topic>扰动</topic><topic>搜索</topic><topic>碰撞攻击</topic><topic>阶跃</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Feng, Hao</creatorcontrib><creatorcontrib>Zeng, Guang</creatorcontrib><creatorcontrib>Han, Wenbao</creatorcontrib><creatorcontrib>Yang, Yang</creatorcontrib><collection>维普_期刊</collection><collection>中文科技期刊数据库-CALIS站点</collection><collection>中文科技期刊数据库-7.0平台</collection><collection>中文科技期刊数据库-工程技术</collection><collection>中文科技期刊数据库- 镜像站点</collection><collection>CrossRef</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central</collection><collection>Advanced Technologies &amp; Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Databases</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>Computer Science Database</collection><collection>Advanced Technologies &amp; Aerospace Database</collection><collection>ProQuest Advanced Technologies &amp; Aerospace Collection</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><jtitle>Science China. Information sciences</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Feng, Hao</au><au>Zeng, Guang</au><au>Han, Wenbao</au><au>Yang, Yang</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>New strategy for searching disturbance vector of SHA-1 collision attack</atitle><jtitle>Science China. Information sciences</jtitle><stitle>Sci. China Inf. Sci</stitle><addtitle>SCIENCE CHINA Information Sciences</addtitle><date>2017-12-01</date><risdate>2017</risdate><volume>60</volume><issue>12</issue><spage>276</spage><epage>278</epage><pages>276-278</pages><artnum>129101</artnum><issn>1674-733X</issn><eissn>1869-1919</eissn><abstract>Dear editor,We present a new algorithm to search for effective disturbance vectors with a complexity of 2~（38）based on the following two properties of disturbance vectors.One property is the weight correlation between the first 16-step disturbance vectors and the60-step disturbance vectors.The other property requires all the differences of the active bit positions of the first 16-step disturbance vectors to be</abstract><cop>Beijing</cop><pub>Science China Press</pub><doi>10.1007/s11432-016-9241-x</doi><tpages>3</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 1674-733X
ispartof Science China. Information sciences, 2017-12, Vol.60 (12), p.276-278, Article 129101
issn 1674-733X
1869-1919
language eng
recordid cdi_proquest_journals_2918579606
source Springer Nature
subjects Computer Science
Information Systems and Communication Service
Letter
SHA-1
向量
属性
性能要求
扰动
搜索
碰撞攻击
阶跃
title New strategy for searching disturbance vector of SHA-1 collision attack
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-18T23%3A06%3A35IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=New%20strategy%20for%20searching%20disturbance%20vector%20of%20SHA-1%20collision%20attack&rft.jtitle=Science%20China.%20Information%20sciences&rft.au=Feng,%20Hao&rft.date=2017-12-01&rft.volume=60&rft.issue=12&rft.spage=276&rft.epage=278&rft.pages=276-278&rft.artnum=129101&rft.issn=1674-733X&rft.eissn=1869-1919&rft_id=info:doi/10.1007/s11432-016-9241-x&rft_dat=%3Cproquest_cross%3E2918579606%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c338t-1bef3dc8a592a6cea5c34e8d7042df5dbd6f8ce4f9da3987f33b8e8439c354313%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2918579606&rft_id=info:pmid/&rft_cqvip_id=673840374&rfr_iscdi=true