COMPLEX MULTIPLICATION TESTS FOR ELLIPTIC CURVES DENIS XAVIER CHARLES Abstract. We consider the problem of checking whether an elliptic curve defined over a given number field has complex multiplication. We study two pol - Supersingular prime - Document - PDFSEARCH.IO

First Page	Meta Content
	COMPLEX MULTIPLICATION TESTS FOR ELLIPTIC CURVES DENIS XAVIER CHARLES Abstract. We consider the problem of checking whether an elliptic curve defined over a given number field has complex multiplication. We study two pol Add to Reading List Document Date: 2005-01-31 13:27:04 Open Document File Size: 189,58 KB Share Result on Facebook IndustryTerm randomized polynomial time algorithm / polynomial time algorithms / polynomial time algorithm / error probabilistic polynomial time algorithm / similar algorithm / / Organization National Science Foundation / / Person Noam Elkies / DENIS XAVIER CHARLES / / Position mP / / Product Canon GL2 Camcorder / / Technology similar algorithm / polynomial time algorithm / two-sided error probabilistic polynomial time algorithm / cryptography / randomized polynomial time algorithm / two polynomial time algorithms / aPi / randomized algorithm / / SocialTag Algebraic number theory Finite fields Elliptic curves Group theory Analytic number theory Supersingular elliptic curve Supersingular prime Prime number Algebraic number field Abstract algebra

COMPLEX MULTIPLICATION TESTS FOR ELLIPTIC CURVES DENIS XAVIER CHARLES Abstract. We consider the problem of checking whether an elliptic curve defined over a given number field has complex multiplication. We study two polAdd to Reading List