Supersingularity and Superspeciality Verification of Abelian Surfaces
This work develops efficient algorithms to verify if an abelian surface over a finite field is supersingular or superspecial. It introduces Monte Carlo tests running in O(log p) time for general supersingularity and conclusive methods based on sampling points or checking twists for specific cases like Jacobians, providing fast verification tools crucial for cryptography.