[Resource Topic] 2020/1513: Indifferentiable hashing from Elligator 2

Welcome to the resource topic for 2020/1513

Indifferentiable hashing from Elligator 2

Authors: Mike Hamburg


Bernstein et al. recently introduced a system Elligator'' for steganographic key distribution. At the heart of their construction are invertible maps between a finite field $\mathbb{F}$ and an elliptic curve $\mathcal{E}$ over $\mathbb{F}$. There are two such maps, called $\phi$ in the Elligator 1’’ system, and \psi in the Elligator 2'' system. Here we show two ways to construct hash functions from $\psi$ which are indifferentiable from a random oracle. Because $\psi$ is relatively simple, our analyses are also simple. One of our constructions uses a novel wallpapering’’ approach, whereas the other uses the hash-twice-and-add approach of Brier et al.

ePrint: https://eprint.iacr.org/2020/1513

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 .