Length-preserving encryption with HCTR2

Paul Crowley; Nathan Huckleberry; Eric Biggers

Paper 2021/1441 Original: eprint.iacr.org/2021/1441 ↗

Length-preserving encryption with HCTR2

Paul Crowley

Nathan Huckleberry

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.
History: 2023-11-01: last updated; 2021-10-27: published
Short URL: https://ia.cr/2021/1441
License: https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2021/1441,
      author = {Paul Crowley and Nathan Huckleberry and Eric Biggers},
      title = {Length-preserving encryption with HCTR2},
      howpublished = {Cryptology {ePrint} Archive, Paper 2021/1441},
      year = {2021},
      url = {https://eprint.iacr.org/2021/1441}
}