Elliptic curve primality proving, abbreviated ECPP, is class of algorithms that provide certificates of primality using sophisticated results from the theory of elliptic curves. A detailed description and list of references are given by Atkin and Morain (1990, 1993). Adleman and Huang designed an independent algorithm using hyperelliptic curves of genus two.
We guarantee you’ll find the right tutor, or we’ll cover the first hour of your lesson.