On Division Polynomial PIT and Supersingularity

01/08/2018
by   Javad Doliskani, et al.
0

For an elliptic curve E over a finite field _q, where q is a prime power, we propose new algorithms for testing the supersingularity of E. Our algorithms are based on the Polynomial Identity Testing (PIT) problem for the p-th division polynomial of E. In particular, an efficient algorithm using points of high order on E is given.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/15/2017

Counting Roots of Polynomials over Z/p^2Z

Until recently, the only known method of finding the roots of polynomial...
research
03/12/2023

New Space-Efficient Quantum Algorithm for Binary Elliptic Curves using the Optimized Division Algorithm

In previous research, quantum resources were concretely estimated for so...
research
02/09/2021

On exact division and divisibility testing for sparse polynomials

No polynomial-time algorithm is known to test whether a sparse polynomia...
research
07/18/2021

Elliptic Curve Fast Fourier Transform (ECFFT) Part I: Fast Polynomial Algorithms over all Finite Fields

For smooth finite fields F_q (i.e., when q-1 factors into small primes) ...
research
11/29/2019

Tropical Polynomial Division and Neural Networks

In this work, we examine the process of Tropical Polynomial Division, a ...
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
02/03/2016

Division and Slope Factorization of p-Adic Polynomials

We study two important operations on polynomials defined over complete d...

Please sign up or login with your details

Forgot password? Click here to reset