Multiplication polynomials for elliptic curves over finite local rings

02/07/2023
by   Riccardo Invernizzi, et al.
0

For a given elliptic curve E over a finite local ring, we denote by E^∞ its subgroup at infinity. Every point P ∈ E^∞ can be described solely in terms of its x-coordinate P_x, which can be therefore used to parameterize all its multiples nP. We refer to the coefficient of (P_x)^i in the parameterization of (nP)_x as the i-th multiplication polynomial. We show that this coefficient is a degree-i rational polynomial without a constant term in n. We also prove that no primes greater than i may appear in the denominators of its terms. As a consequence, for every finite field 𝔽_q and any k∈ℕ^*, we prescribe the group structure of a generic elliptic curve defined over 𝔽_q[X]/(X^k), and we show that their ECDLP on E^∞ may be efficiently solved.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/17/2018

Algorithmic Obfuscation over GF(2^m)

Galois Field arithmetic blocks are the key components in many security a...
research
06/15/2018

Counting points on genus-3 hyperelliptic curves with explicit real multiplication

We propose a Las Vegas probabilistic algorithm to compute the zeta funct...
research
02/05/2020

Efficient ECM factorization in parallel with the Lyness map

The Lyness map is a birational map in the plane which provides one of th...
research
01/25/2018

A New Algorithm for Double Scalar Multiplication over Koblitz Curves

Koblitz curves are a special set of elliptic curves and have improved pe...
research
06/28/2023

Fast and Frobenius: Rational Isogeny Evaluation over Finite Fields

Consider the problem of efficiently evaluating isogenies ϕ: E → E/H of e...
research
10/25/2018

Counting points on hyperelliptic curves with explicit real multiplication in arbitrary genus

We present a probabilistic Las Vegas algorithm for computing the local z...

Please sign up or login with your details

Forgot password? Click here to reset