{"title":"基于Simon算法的OTR结构量子伪造攻击","authors":"Wenjie Liu, Mengting Wang, Zi-Xi Li","doi":"10.1142/s021773232350092x","DOIUrl":null,"url":null,"abstract":"Classical forgery attacks against Offset Two-round (OTR) structures require some harsh conditions, such as some plaintext and ciphertext pairs need to be known, and the success probability is not too high. To solve these problems, a quantum forgery attack on OTR structure using Simon’s algorithm is proposed. The attacker intercepts the ciphertext-tag pair [Formula: see text] between the sender and receiver, while Simon’s algorithm is used to find the period of the tag generation function in OTR, then we can successfully forge new ciphertext [Formula: see text] ([Formula: see text]) for intercepted tag [Formula: see text]. For a variant of OTR structure (Prøst-OTR-Even-Mansour structure), a universal forgery attack, in which it is easy to generate the correct tag of any given message if the attacker is allowed to change a single block in it, is proposed. It first obtains the secret parameter [Formula: see text] using Simon’s algorithm, then the secret parameter [Formula: see text] is used to find the keys [Formula: see text] and [Formula: see text], so that an attacker can forge the changed messages. It only needs several plaintext blocks to help obtain the keys to forge any messages. Performance analysis shows that the query complexity of our attack is [Formula: see text], and its success probability is very close to 1.","PeriodicalId":18752,"journal":{"name":"Modern Physics Letters A","volume":" ","pages":""},"PeriodicalIF":1.6000,"publicationDate":"2023-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Quantum forgery attacks against OTR structures based on Simon’s algorithm\",\"authors\":\"Wenjie Liu, Mengting Wang, Zi-Xi Li\",\"doi\":\"10.1142/s021773232350092x\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Classical forgery attacks against Offset Two-round (OTR) structures require some harsh conditions, such as some plaintext and ciphertext pairs need to be known, and the success probability is not too high. To solve these problems, a quantum forgery attack on OTR structure using Simon’s algorithm is proposed. The attacker intercepts the ciphertext-tag pair [Formula: see text] between the sender and receiver, while Simon’s algorithm is used to find the period of the tag generation function in OTR, then we can successfully forge new ciphertext [Formula: see text] ([Formula: see text]) for intercepted tag [Formula: see text]. For a variant of OTR structure (Prøst-OTR-Even-Mansour structure), a universal forgery attack, in which it is easy to generate the correct tag of any given message if the attacker is allowed to change a single block in it, is proposed. It first obtains the secret parameter [Formula: see text] using Simon’s algorithm, then the secret parameter [Formula: see text] is used to find the keys [Formula: see text] and [Formula: see text], so that an attacker can forge the changed messages. It only needs several plaintext blocks to help obtain the keys to forge any messages. Performance analysis shows that the query complexity of our attack is [Formula: see text], and its success probability is very close to 1.\",\"PeriodicalId\":18752,\"journal\":{\"name\":\"Modern Physics Letters A\",\"volume\":\" \",\"pages\":\"\"},\"PeriodicalIF\":1.6000,\"publicationDate\":\"2023-08-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Modern Physics Letters A\",\"FirstCategoryId\":\"101\",\"ListUrlMain\":\"https://doi.org/10.1142/s021773232350092x\",\"RegionNum\":4,\"RegionCategory\":\"物理与天体物理\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"ASTRONOMY & ASTROPHYSICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Modern Physics Letters A","FirstCategoryId":"101","ListUrlMain":"https://doi.org/10.1142/s021773232350092x","RegionNum":4,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"ASTRONOMY & ASTROPHYSICS","Score":null,"Total":0}
引用次数: 0
摘要
经典的针对OTR (Offset Two-round)结构的伪造攻击需要一些苛刻的条件,例如需要知道一些明文和密文对,并且成功概率不会太高。针对这些问题,提出了一种利用Simon算法对OTR结构进行量子伪造攻击的方法。攻击者拦截发送方和接收方之间的密文-标签对[公式:见文],利用西蒙算法在OTR中找到标签生成函数的周期,就可以成功地为截获的标签[公式:见文]伪造新的密文[公式:见文]([公式:见文])。针对OTR结构的一种变体(Prøst-OTR-Even-Mansour结构),提出了一种通用伪造攻击方法,只要允许攻击者更改消息中的单个块,就可以很容易地生成任意给定消息的正确标签。它首先利用西蒙算法获得秘密参数[Formula: see text],然后利用秘密参数[Formula: see text]找到密钥[Formula: see text]和[Formula: see text],这样攻击者就可以伪造改变后的消息。它只需要几个明文块来帮助获得伪造任何消息的密钥。性能分析表明,我们的攻击查询复杂度为[公式:见文],其成功概率非常接近于1。
Quantum forgery attacks against OTR structures based on Simon’s algorithm
Classical forgery attacks against Offset Two-round (OTR) structures require some harsh conditions, such as some plaintext and ciphertext pairs need to be known, and the success probability is not too high. To solve these problems, a quantum forgery attack on OTR structure using Simon’s algorithm is proposed. The attacker intercepts the ciphertext-tag pair [Formula: see text] between the sender and receiver, while Simon’s algorithm is used to find the period of the tag generation function in OTR, then we can successfully forge new ciphertext [Formula: see text] ([Formula: see text]) for intercepted tag [Formula: see text]. For a variant of OTR structure (Prøst-OTR-Even-Mansour structure), a universal forgery attack, in which it is easy to generate the correct tag of any given message if the attacker is allowed to change a single block in it, is proposed. It first obtains the secret parameter [Formula: see text] using Simon’s algorithm, then the secret parameter [Formula: see text] is used to find the keys [Formula: see text] and [Formula: see text], so that an attacker can forge the changed messages. It only needs several plaintext blocks to help obtain the keys to forge any messages. Performance analysis shows that the query complexity of our attack is [Formula: see text], and its success probability is very close to 1.
期刊介绍:
This letters journal, launched in 1986, consists of research papers covering current research developments in Gravitation, Cosmology, Astrophysics, Nuclear Physics, Particles and Fields, Accelerator physics, and Quantum Information. A Brief Review section has also been initiated with the purpose of publishing short reports on the latest experimental findings and urgent new theoretical developments.