Tweakable pseudorandom permutations have wide applications such as the disk sector encryption, and the underlying primitive for efficient MACs and authenticated encryption schemes. Goldenberg et al. showed constructions of a tweakable pseudorandom permutation based on the Feistel structure. In this paper, we explore the possibility of designing tweakable pseudorandom permutations based on the Generalized Feistel Structure. We show that tweakable pseudorandom permutations can be obtained without increasing the number of rounds compared to the non-tweakable versions. We also present designs that take multiple tweaks as input. © 2008 Springer Berlin Heidelberg.
CITATION STYLE
Mitsuda, A., & Iwata, T. (2008). Tweakable pseudorandom permutation from generalized feistel structure. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5324 LNCS, pp. 22–37). Springer Verlag. https://doi.org/10.1007/978-3-540-88733-1_2
Mendeley helps you to discover research relevant for your work.