Quantum forgery attacks on COPA,AES-COPA and marble authenticated encryption algorithms
Abstract: The classic forgery attacks on COPA, AES-COPA and Marble authenticated encryption algorithms need to query about 2n/2 times, and their success probability is not high. To solve this problem, the corresponding quantum forgery attacks on COPA, AES-COPA and Marble authenticated encryption algorithms are presented. In the quantum forgery attacks on COPA and AES-COPA, we use Simon's algorithm to find the period of the tag generation function in COPA and AES-COPA by querying in superposition, and then generate a forged tag for a new message. In the quantum forgery attack on Marble, Simon's algorithm is used to recover the secret parameter L, and the forged tag can be computed with L. Compared with classic forgery attacks on COPA, AES-COPA and Marble, our attack can reduce the number of queries from O(2n/2) to O(n) and improve success probability close to 100%.
- Nandi, M.: Revisiting Security Claims of XLS and COPA. IACR Cryptology ePrint Archive. 444 (2015)
- Lu, J.: Almost Universal Forgery Attacks on the COPA and Marble Authenticated Encryption Algorithms. in Proc. of the 2017 ACM on Asia Conference on Computer and Communications Security. 789-799 (2017)
- Shor, P.W.: Algorithms for quantum computation: discrete logarithms and factoring. in Proc. of 35th Annual Symposium on Foundations of Computer Science. 124-134 (1997)
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
