Length-preserving encryption with HCTR2

You are looking at a specific version 20211027:085150 of this paper. See the latest version.

Paper 2021/1441

Length-preserving encryption with HCTR2

Paul Crowley and Nathan Huckleberry and Eric Biggers

Abstract

On modern processors HCTR is one of the most efficient constructions for building a tweakable super-pseudorandom permutation. However, a bug in the specification and another in Chakraborty and Nandi's security proof invalidate the claimed security bound. We here present HCTR2, which fixes these issues and improves the security bound, performance and flexibility. GitHub: https://github.com/google/hctr2

Metadata

Available format(s): PDF
Category: Secret-key cryptography
Publication info: Preprint. MINOR revision.
Keywords: length-preserving encryption super-pseudorandom permutation variable input length tweakable encryption disk encryption
Contact author(s): paulcrowley @ google com,nhuck @ google com,ebiggers @ google com
History: 2023-11-01: last of 2 revisions; 2021-10-27: received; See all versions
Short URL: https://ia.cr/2021/1441
License: CC BY