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. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Lee, W., Sakurai, K., Hong, S., & Lee, S. (2005). On the pseudorandomness of a modification of KASUMI type permutations. In Lecture Notes in Computer Science (Vol. 3506, pp. 313–329). Springer Verlag. https://doi.org/10.1007/11496618_23
Mendeley helps you to discover research relevant for your work.