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...
Saved in:
| Published in | Quantum information processing Vol. 20; no. 4 |
|---|---|
| Main Authors | , , |
| Format | Journal Article |
| Language | English |
| Published |
New York
Springer US
01.04.2021
Springer Nature B.V |
| Subjects | |
| Online Access | Get full text |
| ISSN | 1570-0755 1573-1332 |
| DOI | 10.1007/s11128-021-03036-w |
Cover
| Summary: | 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%. |
|---|---|
| Bibliography: | 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 |