On Division Polynomial PIT and Supersingularity [article]

Javad Doliskani
2018 arXiv   pre-print
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.
arXiv:1801.02664v2 fatcat:bmawsa4z7zhbtlnuw5poxwel7m