On the pseudorandomness of a modification of KASUMI type permutations

Authors:
Wonil Lee;Kouichi Sakurai;Seokhie Hong;Sangjin Lee
Affiliations:
Faculty of Information Science and Electrical Engineering, Kyushu University, Fukuoka, Japan;Faculty of Information Science and Electrical Engineering, Kyushu University, Fukuoka, Japan;Dept. ESAT/COSIC, Katholieke Universiteit Leuven, Leuven-Heverlee, Belgium;Center for Information Security Technologies (CIST), Korea University, Seoul, Korea
Venue:
ICISC'04 Proceedings of the 7th international conference on Information Security and Cryptology
Year:
2004

Citing 5
Cited 0

How to construct pseudorandom permutations from pseudorandom functions

SIAM Journal on Computing - Special issue on cryptography
Pseudorandom permutations based on the DES scheme

EUROCODE '90 Proceedings of the International Symposium on Coding Theory and Applications
Provable Security of KASUMI and 3GPP Encryption Mode f8

ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
New Block Encryption Algorithm MISTY

FSE '97 Proceedings of the 4th International Workshop on Fast Software Encryption
On the pseudorandomness of KASUMI type permutations

ACISP'03 Proceedings of the 8th Australasian conference on Information security and privacy

Quantified Score

Hi-index	0.00

Visualization

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.