Name
Abstract | ||
|---|---|---|
In this paper, we present an extension to the resynchronization attack on stream ciphers of (Daemen et al., 1993). The most general attack in (Daemen et al., 1993) on a nonlinearly filtered register with linear resync has attack complexity [n/phi] x 2(phi), where n is the key length and phi the input size of the filter function. It was further shown specifically that the attack complexity can be reduced in the case when the filter function is a multiplexer. The attack of (Daemen et al., 1993) is most efficient when the input size is small. We shall show that a large input size may not necessarily guard against this attack, even when a function with good cryptographic properties is used. It may decrease the attack complexity, in the example illustrated in this paper. Boolean functions from the Maiorana-McFarland class make good choices for these filter functions due to their good cryptographic properties such as balance, high nonlinearity and high order of resiliency. However, these functions can become linear when certain input bits are fixed. We shall demonstrate this weakness and use it to achieve lower attack complexities for the general resynchronization attack of (Daemen et al., 1993). |
Year | Venue | Keywords |
|---|---|---|
2009 | SECRYPT 2009: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON SECURITY AND CRYPTOGRAPHY | Stream ciphers,Resynchronization attacks,Maiorana-McFarland functions,Cube attack |
Field | DocType | Citations |
Block size,T-function,Computer science,Cryptography,Fluhrer, Mantin and Shamir attack,Computer network,Algorithm,Theoretical computer science,Stream cipher,Correlation attack,Stream cipher attack,Differential cryptanalysis | Conference | 0 |
PageRank | References | Authors |
0.34 | 7 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Guanhan Chew | 1 | 25 | 2.92 |
| Aileen Zhang | 2 | 8 | 1.31 |
| Khoongming Khoo | 3 | 250 | 23.29 |