Quantum forgery attacks on COPA, AES-COPA and marble authenticated encryption algorithms

The classic forgery attacks on COPA, AES-COPA and Marble authenticated encryption algorithms need to query about 2 n / 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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Quantum information processing Ročník 20; číslo 4
Hlavní autoři: Xu, Yinsong, Liu, Wenjie, Yu, Wenbin
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Springer US 01.04.2021
Springer Nature B.V
Témata:
Algorithms
Data Structures and Information Theory
Encryption
Forgery
Marble
Mathematical Physics
Physics
Physics and Astronomy
Quantum Computing
Quantum Information Technology
Quantum Physics
Spintronics
COPA
Quantum forgery attack
Marble
Simon’s algorithm
AES-COPA
ISSN:1570-0755, 1573-1332
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:The classic forgery attacks on COPA, AES-COPA and Marble authenticated encryption algorithms need to query about 2 n / 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 ( 2 n / 2 ) to O ( n ) and improve success probability close to 100%.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1570-0755
1573-1332
DOI:10.1007/s11128-021-03036-w