Welcome to the resource topic for 2024/539
Title:
Supersingular Hashing using Lattès Maps
Authors: Daniel Larsson
Abstract:In this note we propose a variant (with four sub-variants) of the Charles–Goren–Lauter (CGL) hash function using Lattès maps over finite fields. These maps define dynamical systems on the projective line. The underlying idea is that these maps ``hide’’ the j-invariants in each step in the isogeny chain, similar to the Merkle–Damgård construction. This might circumvent the problem concerning the knowledge of the starting (or ending) curve’s endomorphism ring, which is known to create collisions in the CGL hash function.
Let us, already in the abstract, preface this note by remarking that we have not done any explicit computer experiments and benchmarks (apart from a small test on the speed of computing the orbits), nor do we make any security claims. Part of the reason for this is the author’s lack of competence in complexity theory and evaluation of security claims. Instead this note is only meant as a presentation of the main idea, the hope being that someone more competent will find it interesting enough to pursue further.
ePrint: https://eprint.iacr.org/2024/539
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 .