Abstract
Recently, data-dependent permutations (DDP) that are very suitable for intelligent multimedia and ubiquitous computing systems have been introduced as a new cryptographic primitive for the design of fast encryption systems. The CIKS-128 and CIKS-128H block ciphers are the typical examples of DDP-based encryption algorithms. In this paper, we show that CIKS-128 and CIKS-128H are vulnerable to related-key differential attacks. We first describe how to construct their full-round related-key differential characteristics with high probabilities and then we exploit them to break the full-round CIKS-128 and CIKS-128H with 244, and 248 data/time complexities, respectively.
Original language | English |
---|---|
Pages (from-to) | 447-466 |
Number of pages | 20 |
Journal | Computing and Informatics |
Volume | 30 |
Issue number | 3 |
State | Published - 2011 |
Keywords
- CIKS-128
- CIKS-128H
- Encryption algorithms
- Intelligent multimedia and ubiquitous computing systems
- Related-key differential characteristics