Eric Biggers

Nov 1, 2023 | eprint.iacr.org | Paul Crowley |Eric Biggers |Nathan Huckleberry

Paper 2021/1441 , Google (United States), Google (United States), Google (United States) 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.