Abstract
We present a modification of KASUMI type permutations and analyze the security of it using the notion of pseudorandomness. Our modified KASUMI type permutation can be computed more efficiently than the original KASUMI type permutation. Furthermore, our results have a slightly better (same) upper bound of success probability against arbitrary attackers in the sense of (super) pseudorandomness.
Original language | English |
---|---|
Pages (from-to) | 313-329 |
Number of pages | 17 |
Journal | Lecture Notes in Computer Science |
Volume | 3506 |
DOIs | |
Publication status | Published - 2005 |
Event | 7th International Conference on Information Security and Cryptology - ICISC 2004 - Seoul, Korea, Republic of Duration: 2004 Dec 2 → 2004 Dec 3 |
Keywords
- Block cipher
- KASUMI
- Provable security
- Pseudorandomness
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Science(all)