Welcome to the resource topic for 2021/1441
Title:
Length-preserving encryption with HCTR2
Authors: 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: GitHub - google/hctr2: HCTR2 specification and test vectors
ePrint: https://eprint.iacr.org/2021/1441
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .