HCH: A new tweakable enciphering scheme using the hash-encrypt-hash approach

37Citations
Citations of this article
25Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The notion and the first construction of a tweakable enciphering scheme, called CMC, was presented by Halevi-Rogaway at Crypto 2003. In this paper, we present HCH, which is a new construction of such a scheme. The construction uses the hash-encrypt-hash approach introduced by Naor-Reingold. This approach has recently been used in the constructions of tweakable enciphering schemes HCTR and PEP. HCH has several advantages over the previous schemes CMC, EME, EME*, HCTR, and PEP. CMC, EME, and EME* use two block-cipher invocations per message block, while HCTR, PEP, and HCH use only one. PEP uses four multiplications per block, while HCTR and HCH use only two. In HCTR, the security bound is cubic, while in HCH security bound is quadratic.

Cite

CITATION STYLE

APA

Chakraborty, D., & Sarkar, P. (2006). HCH: A new tweakable enciphering scheme using the hash-encrypt-hash approach. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4329 LNCS, pp. 287–302). Springer Verlag. https://doi.org/10.1007/11941378_21

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free