Generalised Weber Functions
Andreas Enge (INRIA Bordeaux - Sud-Ouest), Fran\c{c}ois Morain (LIX,, INRIA Saclay - Ile de France)

TL;DR
This paper generalizes Weber functions using Dedekind eta functions, classifies when their powers generate class fields, and explores their potential for cryptographic elliptic curve reductions.
Contribution
It introduces a generalized Weber function framework, classifies cases for class field generation, and provides formulas relating these invariants to modular functions.
Findings
Classified cases where powers of generalized Weber functions generate class fields.
Derived formulas for the degree of modular equations relating these functions to j-invariants.
Explored applications in constructing elliptic curve reductions for cryptography.
Abstract
A generalised Weber function is given by , where is the Dedekind function and is any integer; the original function corresponds to . We classify the cases where some power evaluated at some quadratic integer generates the ring class field associated to an order of an imaginary quadratic field. We compare the heights of our invariants by giving a general formula for the degree of the modular equation relating and . Our ultimate goal is the use of these invariants in constructing reductions of elliptic curves over finite fields suitable for cryptographic use.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Cryptography and Residue Arithmetic · Algebraic Geometry and Number Theory
