版权所有:内蒙古大学图书馆 技术提供:维普资讯• 智图
内蒙古自治区呼和浩特市赛罕区大学西街235号 邮编: 010021
作者机构:School of Computer and Software Nanjing University of Information Science and Technology Jiangsu Nanjing210044 China Engineering Research Center of Digital Forensics Ministry of Education Nanjing University of Information Science and Technology Jiangsu Nanjing210044 China
出 版 物:《arXiv》 (arXiv)
年 卷 期:2023年
核心收录:
摘 要: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 intercept the ciphertext-tag pair (C,T) 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 C′ (C′ ≠ C) for intercepted tag T. 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 L using Simon s algorithm, then the secret parameter L is used to find the keys k1 and k2, 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 O(n), and its success probability is very close to 1. © 2023, CC BY.