MIBS-64 算法 Rectangle 与 Boomerang 攻击的改进
MIBS算法是 Izadi 等人于 2009 年提出的一种轻量级分组密码, 包含 MIBS-64 和 MIBS-80 两个版本. 2019 年, Chen 等人对 MIBS-64 开展了基于 13 轮 Rectangle 区分器的 15 轮密钥恢复攻击, 时间、数据和存储复杂度为 (T,D,M)=(259,245,245). 本文进一步研究 MIBS-64 算法抵抗 Rectangle 与 Boomerang 攻击的能力. 利用差分在轮函数线性层确定性传播的特点, 改进了 Chen 等人的 15 轮 Rectangle 密钥恢复攻击, 将时间复杂度从 259 降低至 247. 引入 Song...
Gespeichert in:
| Veröffentlicht in: | Journal of Cryptologic Research 2023-07, Vol.10 (3), p.634-649 |
|---|---|
| Hauptverfasser: | , , , , , , , |
| Format: | Artikel |
| Sprache: | chi |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 649 |
|---|---|
| container_issue | 3 |
| container_start_page | 634 |
| container_title | Journal of Cryptologic Research |
| container_volume | 10 |
| creator | Xuan-Yu, LIANG Yin-Cen, CHEN Qian-Qian, YANG SONG, Ling 梁轩宇 陈胤岑 杨倩倩 宋凌 |
| description | MIBS算法是 Izadi 等人于 2009 年提出的一种轻量级分组密码, 包含 MIBS-64 和 MIBS-80 两个版本. 2019 年, Chen 等人对 MIBS-64 开展了基于 13 轮 Rectangle 区分器的 15 轮密钥恢复攻击, 时间、数据和存储复杂度为 (T,D,M)=(259,245,245). 本文进一步研究 MIBS-64 算法抵抗 Rectangle 与 Boomerang 攻击的能力. 利用差分在轮函数线性层确定性传播的特点, 改进了 Chen 等人的 15 轮 Rectangle 密钥恢复攻击, 将时间复杂度从 259 降低至 247. 引入 Song 等人提出的针对 Boomerang 攻击的新型密钥恢复算法, 对 MIBS-64 开展了 15、16 轮的 Boomerang 密钥恢复攻击, 所需的复杂度 (T,D,M) 为 (238,237,236) 和 (260,260,230). 给出了 MIBS-64 在 Boomerang 和 Rectangle 攻击下最新的安全性分析结果, 首次成功开展 16 轮的密钥恢复攻击. |
| doi_str_mv | 10.13868/j.cnki.jcr.000620 |
| format | Article |
| fullrecord | <record><control><sourceid>wanfang_jour_proqu</sourceid><recordid>TN_cdi_proquest_journals_2878118356</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><wanfj_id>mmxb202303015</wanfj_id><sourcerecordid>mmxb202303015</sourcerecordid><originalsourceid>FETCH-LOGICAL-p1285-1c1d797aff7b95662218abf5292fc068fad61927ef3c340d117918f01e35bc83</originalsourceid><addsrcrecordid>eNpFj8tKw0AYhWehYKl9AVcBcZn4_zOZ29IWL4WKoN2XZDIjjU1SkxZ9AMGdq4qg7-DGjdKFL6Opj2GggqvDgY9zIWQHIUCmhNpPA5NfjYPUlAEACAobpEVBSz9EFFukU1XjGDgXTNEQW0Sc9rsXvgi91etT_fbonVszi_LLifW-3h-8blFktmy8Vy-W3_fL1fNdvfj4-XzZJpsumlS286dtMjw6HPZO_MHZcb93MPCnSBX30WAitYyck7HmQlCKKoodp5o6A0K5KBGoqbSOGRZCgig1KgdoGY-NYm2yt469iXLXzBilxbzMm8JRlt3GFCgDBsgbbnfNTcviem6r2T9IlVSIijWPfwEDB1qj</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2878118356</pqid></control><display><type>article</type><title>MIBS-64 算法 Rectangle 与 Boomerang 攻击的改进</title><source>ProQuest One Community College</source><source>ProQuest Central UK/Ireland</source><source>ProQuest Central</source><creator>Xuan-Yu, LIANG ; Yin-Cen, CHEN ; Qian-Qian, YANG ; SONG, Ling ; 梁轩宇 ; 陈胤岑 ; 杨倩倩 ; 宋凌</creator><creatorcontrib>Xuan-Yu, LIANG ; Yin-Cen, CHEN ; Qian-Qian, YANG ; SONG, Ling ; 梁轩宇 ; 陈胤岑 ; 杨倩倩 ; 宋凌</creatorcontrib><description>MIBS算法是 Izadi 等人于 2009 年提出的一种轻量级分组密码, 包含 MIBS-64 和 MIBS-80 两个版本. 2019 年, Chen 等人对 MIBS-64 开展了基于 13 轮 Rectangle 区分器的 15 轮密钥恢复攻击, 时间、数据和存储复杂度为 (T,D,M)=(259,245,245). 本文进一步研究 MIBS-64 算法抵抗 Rectangle 与 Boomerang 攻击的能力. 利用差分在轮函数线性层确定性传播的特点, 改进了 Chen 等人的 15 轮 Rectangle 密钥恢复攻击, 将时间复杂度从 259 降低至 247. 引入 Song 等人提出的针对 Boomerang 攻击的新型密钥恢复算法, 对 MIBS-64 开展了 15、16 轮的 Boomerang 密钥恢复攻击, 所需的复杂度 (T,D,M) 为 (238,237,236) 和 (260,260,230). 给出了 MIBS-64 在 Boomerang 和 Rectangle 攻击下最新的安全性分析结果, 首次成功开展 16 轮的密钥恢复攻击.</description><identifier>ISSN: 2097-4116</identifier><identifier>ISSN: 2095-7025</identifier><identifier>DOI: 10.13868/j.cnki.jcr.000620</identifier><language>chi</language><publisher>Beijing: Chinese Association for Cryptologic Research, Journal of Cryptologic Research</publisher><subject>Algorithms ; Complexity ; Cryptography ; Encryption ; Recovery</subject><ispartof>Journal of Cryptologic Research, 2023-07, Vol.10 (3), p.634-649</ispartof><rights>2023. This work is published under http://www.jcr.cacrnet.org.cn/EN/column/column4.shtml Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><rights>Copyright © Wanfang Data Co. Ltd. All Rights Reserved.</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Uhttp://www.wanfangdata.com.cn/images/PeriodicalImages/mmxb/mmxb.jpg</thumbnail><linktohtml>$$Uhttps://www.proquest.com/docview/2878118356?pq-origsite=primo$$EHTML$$P50$$Gproquest$$Hfree_for_read</linktohtml><link.rule.ids>315,781,785,21393,27929,27930,33749,43810,64390,64394,72474,73133,73134,73136</link.rule.ids></links><search><creatorcontrib>Xuan-Yu, LIANG</creatorcontrib><creatorcontrib>Yin-Cen, CHEN</creatorcontrib><creatorcontrib>Qian-Qian, YANG</creatorcontrib><creatorcontrib>SONG, Ling</creatorcontrib><creatorcontrib>梁轩宇</creatorcontrib><creatorcontrib>陈胤岑</creatorcontrib><creatorcontrib>杨倩倩</creatorcontrib><creatorcontrib>宋凌</creatorcontrib><title>MIBS-64 算法 Rectangle 与 Boomerang 攻击的改进</title><title>Journal of Cryptologic Research</title><description>MIBS算法是 Izadi 等人于 2009 年提出的一种轻量级分组密码, 包含 MIBS-64 和 MIBS-80 两个版本. 2019 年, Chen 等人对 MIBS-64 开展了基于 13 轮 Rectangle 区分器的 15 轮密钥恢复攻击, 时间、数据和存储复杂度为 (T,D,M)=(259,245,245). 本文进一步研究 MIBS-64 算法抵抗 Rectangle 与 Boomerang 攻击的能力. 利用差分在轮函数线性层确定性传播的特点, 改进了 Chen 等人的 15 轮 Rectangle 密钥恢复攻击, 将时间复杂度从 259 降低至 247. 引入 Song 等人提出的针对 Boomerang 攻击的新型密钥恢复算法, 对 MIBS-64 开展了 15、16 轮的 Boomerang 密钥恢复攻击, 所需的复杂度 (T,D,M) 为 (238,237,236) 和 (260,260,230). 给出了 MIBS-64 在 Boomerang 和 Rectangle 攻击下最新的安全性分析结果, 首次成功开展 16 轮的密钥恢复攻击.</description><subject>Algorithms</subject><subject>Complexity</subject><subject>Cryptography</subject><subject>Encryption</subject><subject>Recovery</subject><issn>2097-4116</issn><issn>2095-7025</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><recordid>eNpFj8tKw0AYhWehYKl9AVcBcZn4_zOZ29IWL4WKoN2XZDIjjU1SkxZ9AMGdq4qg7-DGjdKFL6Opj2GggqvDgY9zIWQHIUCmhNpPA5NfjYPUlAEACAobpEVBSz9EFFukU1XjGDgXTNEQW0Sc9rsXvgi91etT_fbonVszi_LLifW-3h-8blFktmy8Vy-W3_fL1fNdvfj4-XzZJpsumlS286dtMjw6HPZO_MHZcb93MPCnSBX30WAitYyck7HmQlCKKoodp5o6A0K5KBGoqbSOGRZCgig1KgdoGY-NYm2yt469iXLXzBilxbzMm8JRlt3GFCgDBsgbbnfNTcviem6r2T9IlVSIijWPfwEDB1qj</recordid><startdate>20230703</startdate><enddate>20230703</enddate><creator>Xuan-Yu, LIANG</creator><creator>Yin-Cen, CHEN</creator><creator>Qian-Qian, YANG</creator><creator>SONG, Ling</creator><creator>梁轩宇</creator><creator>陈胤岑</creator><creator>杨倩倩</creator><creator>宋凌</creator><general>Chinese Association for Cryptologic Research, Journal of Cryptologic Research</general><general>暨南大学 网络空间安全学院,广州 510632%中国科学院 信息工程研究所 信息安全国家重点实验室,北京 100093</general><scope>8FE</scope><scope>8FG</scope><scope>ABUWG</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>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>2B.</scope><scope>4A8</scope><scope>92I</scope><scope>93N</scope><scope>PSX</scope><scope>TCJ</scope></search><sort><creationdate>20230703</creationdate><title>MIBS-64 算法 Rectangle 与 Boomerang 攻击的改进</title><author>Xuan-Yu, LIANG ; Yin-Cen, CHEN ; Qian-Qian, YANG ; SONG, Ling ; 梁轩宇 ; 陈胤岑 ; 杨倩倩 ; 宋凌</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p1285-1c1d797aff7b95662218abf5292fc068fad61927ef3c340d117918f01e35bc83</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>chi</language><creationdate>2023</creationdate><topic>Algorithms</topic><topic>Complexity</topic><topic>Cryptography</topic><topic>Encryption</topic><topic>Recovery</topic><toplevel>online_resources</toplevel><creatorcontrib>Xuan-Yu, LIANG</creatorcontrib><creatorcontrib>Yin-Cen, CHEN</creatorcontrib><creatorcontrib>Qian-Qian, YANG</creatorcontrib><creatorcontrib>SONG, Ling</creatorcontrib><creatorcontrib>梁轩宇</creatorcontrib><creatorcontrib>陈胤岑</creatorcontrib><creatorcontrib>杨倩倩</creatorcontrib><creatorcontrib>宋凌</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</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 & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>Publicly Available Content Database</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><collection>Wanfang Data Journals - Hong Kong</collection><collection>WANFANG Data Centre</collection><collection>Wanfang Data Journals</collection><collection>万方数据期刊 - 香港版</collection><collection>China Online Journals (COJ)</collection><collection>China Online Journals (COJ)</collection><jtitle>Journal of Cryptologic Research</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Xuan-Yu, LIANG</au><au>Yin-Cen, CHEN</au><au>Qian-Qian, YANG</au><au>SONG, Ling</au><au>梁轩宇</au><au>陈胤岑</au><au>杨倩倩</au><au>宋凌</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>MIBS-64 算法 Rectangle 与 Boomerang 攻击的改进</atitle><jtitle>Journal of Cryptologic Research</jtitle><date>2023-07-03</date><risdate>2023</risdate><volume>10</volume><issue>3</issue><spage>634</spage><epage>649</epage><pages>634-649</pages><issn>2097-4116</issn><issn>2095-7025</issn><abstract>MIBS算法是 Izadi 等人于 2009 年提出的一种轻量级分组密码, 包含 MIBS-64 和 MIBS-80 两个版本. 2019 年, Chen 等人对 MIBS-64 开展了基于 13 轮 Rectangle 区分器的 15 轮密钥恢复攻击, 时间、数据和存储复杂度为 (T,D,M)=(259,245,245). 本文进一步研究 MIBS-64 算法抵抗 Rectangle 与 Boomerang 攻击的能力. 利用差分在轮函数线性层确定性传播的特点, 改进了 Chen 等人的 15 轮 Rectangle 密钥恢复攻击, 将时间复杂度从 259 降低至 247. 引入 Song 等人提出的针对 Boomerang 攻击的新型密钥恢复算法, 对 MIBS-64 开展了 15、16 轮的 Boomerang 密钥恢复攻击, 所需的复杂度 (T,D,M) 为 (238,237,236) 和 (260,260,230). 给出了 MIBS-64 在 Boomerang 和 Rectangle 攻击下最新的安全性分析结果, 首次成功开展 16 轮的密钥恢复攻击.</abstract><cop>Beijing</cop><pub>Chinese Association for Cryptologic Research, Journal of Cryptologic Research</pub><doi>10.13868/j.cnki.jcr.000620</doi><tpages>16</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 2097-4116 |
| ispartof | Journal of Cryptologic Research, 2023-07, Vol.10 (3), p.634-649 |
| issn | 2097-4116 2095-7025 |
| language | chi |
| recordid | cdi_proquest_journals_2878118356 |
| source | ProQuest One Community College; ProQuest Central UK/Ireland; ProQuest Central |
| subjects | Algorithms Complexity Cryptography Encryption Recovery |
| title | MIBS-64 算法 Rectangle 与 Boomerang 攻击的改进 |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-15T11%3A55%3A03IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-wanfang_jour_proqu&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=MIBS-64%20%E7%AE%97%E6%B3%95%20Rectangle%20%E4%B8%8E%20Boomerang%20%E6%94%BB%E5%87%BB%E7%9A%84%E6%94%B9%E8%BF%9B&rft.jtitle=Journal%20of%20Cryptologic%20Research&rft.au=Xuan-Yu,%20LIANG&rft.date=2023-07-03&rft.volume=10&rft.issue=3&rft.spage=634&rft.epage=649&rft.pages=634-649&rft.issn=2097-4116&rft_id=info:doi/10.13868/j.cnki.jcr.000620&rft_dat=%3Cwanfang_jour_proqu%3Emmxb202303015%3C/wanfang_jour_proqu%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2878118356&rft_id=info:pmid/&rft_wanfj_id=mmxb202303015&rfr_iscdi=true |