Abstract
In this paper, we present a generalization of the notion of the recently proposed related-cipher attacks. In particular, we show that when the cryptanalyst has access to an oracle under one mode, then almost all other related-cipher modes can be attacked with ease. Typically only one chosen plaintext/ciphertext query is required, while computational complexity is negligible.
| Original language | English |
|---|---|
| Title of host publication | International Conference on Computational Science and Its Applications - ICCSA 2005 |
| Pages | 661-671 |
| Number of pages | 11 |
| Volume | 3482 |
| Edition | III |
| DOIs | |
| Publication status | Published - 2005 |
| Externally published | Yes |
| Event | International Conference on Computational Science and Applications 2005 - Singapore, Singapore Duration: 9 May 2005 → 12 May 2005 https://link.springer.com/book/10.1007/b136266 (Proceedings) |
Publication series
| Name | Lecture Notes in Computer Science |
|---|---|
| ISSN (Print) | 0302-9743 |
Conference
| Conference | International Conference on Computational Science and Applications 2005 |
|---|---|
| Abbreviated title | ICCSA 2005 |
| Country/Territory | Singapore |
| City | Singapore |
| Period | 9/05/05 → 12/05/05 |
| Internet address |
|
Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver