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.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Atsushi MITSUDA, Tetsu IWATA, "Tweakable Pseudorandom Permutation from Generalized Feistel Structure" in IEICE TRANSACTIONS on Fundamentals,
vol. E93-A, no. 1, pp. 13-21, January 2010, doi: 10.1587/transfun.E93.A.13.
Abstract: 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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E93.A.13/_p
Copy
@ARTICLE{e93-a_1_13,
author={Atsushi MITSUDA, Tetsu IWATA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Tweakable Pseudorandom Permutation from Generalized Feistel Structure},
year={2010},
volume={E93-A},
number={1},
pages={13-21},
abstract={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.},
keywords={},
doi={10.1587/transfun.E93.A.13},
ISSN={1745-1337},
month={January},}
Copy
TY - JOUR
TI - Tweakable Pseudorandom Permutation from Generalized Feistel Structure
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 13
EP - 21
AU - Atsushi MITSUDA
AU - Tetsu IWATA
PY - 2010
DO - 10.1587/transfun.E93.A.13
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E93-A
IS - 1
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - January 2010
AB - 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.
ER -