A General Construction of Tweakable Block Ciphers and Different Modes of Operations
This work builds on earlier work by Rogaway at Asiacrypt 2004 on tweakable block cipher (TBC) and modes of operations. Our first contribution is to generalize Rogaway’s TBC construction by working over a ring R and by the use of a masking sequence of functions. The ring R can be instantiated as either GF(2 n ) or as ℤ . Further, over GF(2 n ), efficient instantiations of the masking sequence of functions can be done using either a Linear Feedback Shift Register (LFSR), a powering construction or a cellular automata map. Rogaway’s TBC construction was built from the powering construction over GF(2 n ). Our second contribution is to use the general TBC construction to instantiate general constructions of various modes of operations (AE, PRF, MAC, AEAD) given by Rogaway.
Keywordstweakable block cipher modes of operations AE MAC AEAD
Unable to display preview. Download preview PDF.
- 6.Katz, J., Yung, M.: Complete characterization of security notions for probabilistic private-key encryption. In: STOC, pp. 245–254 (2000)Google Scholar
- 7.Lidl, R., Niederreiter, H.: Introduction to finite fields and their applications, revised edn. Cambridge University Press, Cambridge (1994)Google Scholar
- 11.Rogaway, P.: Authenticated-encryption with associated-data. In: Atluri, V. (ed.) ACM Conference on Computer and Communications Security, pp. 98–107. ACM, New York (2002)Google Scholar
- 14.Tezuka, S., Fushimi, M.: A method of designing cellular automata as pseudo random number generators for built-in self-test for vlsi. In: Finite Fields: Theory, Applications and Algorithms, Contemporary Mathematics, AMS, pp. 363–367 (1994)Google Scholar