Beyond two criteria for supersingularity: coefficients of division polynomials
Christophe Debry

TL;DR
This paper establishes a new criterion for supersingularity of elliptic curves over finite fields by relating specific coefficients of division polynomials to the curve's supersingularity, extending previous criteria.
Contribution
It proves a novel relationship between coefficients of division polynomials and supersingularity, strengthening prior results by Deuring.
Findings
Coefficient at x^{p(p-1)/2} in rac_p(x) equals the coefficient at x^{p-1} in (x^3 + Ax + B)^{(p-1)/2}
Zero coefficient condition characterizes supersingularity of E
Main result extends Deuring's criterion by linking division polynomial coefficients
Abstract
Let E: y^2 = x^3 + Ax + B be an elliptic curve defined over a finite field of characteristic p\geq 3. In this paper we prove that the coefficient at x^{p(p-1)/2} in the p-th division polynomial \psi_p(x) of E equals the coefficient at x^{p-1} in (x^3 + Ax + B)^{(p-1)/2}. The first coefficient is zero if and only if the division polynomial has no roots, which is equivalent to E being supersingular. Deuring (1941) proved that this supersingularity is also equivalent to the vanishing of the second coefficient. So the zero loci of the coefficients (as functions of A and B) are equal; the main result in this paper is clearly stronger than this last statement.
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
TopicsAlgebraic Geometry and Number Theory · Coding theory and cryptography · Cryptography and Residue Arithmetic
