Name
Abstract | ||
|---|---|---|
In this paper, we propose a novel technique, called multioutput filtering model, to study the non-randomness property of a cryptographic algorithm such as message authentication codes and block ciphers. A multi-output filtering model consists of a linear feedback shift register and a multi-output filtering function. Our contribution in this paper is twofold. First, we propose an attack technique under IND-CPA using the multi-output filtering model. By introducing a distinguishing function, we theoretically determine the success rate of this attack. In particular, we construct a distinguishing function based on the distribution of the linear complexity of component sequences, and apply it on studying TUAK's f(1) algorithm, AES, KASUMI, PRESENT and PRINTcipher. We demonstrate that the success rate of the attack on KASUMI and PRESENT is non-negligible, but f1 and AES are resistant to this attack. Second, we study the distribution of the cryptographic properties of component functions of a random primitive in the multi-output filtering model. Our experiments show some non-randomness in the distribution of algebraic degree and nonlinearity for KASUMI. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1007/978-3-319-55589-8_18 | CODES, CRYPTOLOGY AND INFORMATION SECURITY, C2SI 2017 |
Keywords | Field | DocType |
Randomness, Distinguishing attack, TUAK, Linear complexity | Discrete mathematics,Algebraic number,Nonlinear system,Block cipher,Computer science,Filter (signal processing),Real-time computing,Linear complexity,KASUMI,Randomness,Distinguishing attack | Conference |
Volume | ISSN | Citations |
10194 | 0302-9743 | 0 |
PageRank | References | Authors |
0.34 | 17 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Teng Wu | 1 | 0 | 0.34 |
| Yin Tan | 2 | 1 | 1.39 |
| Kalikinkar Mandal | 3 | 56 | 8.87 |
| Guang Gong | 4 | 1717 | 160.71 |