ECPP in PARI/GP

The elliptic curve primality proving (ECPP) algorithm not only proves (or disproves) the primality of an integer $N$ but also provides, if $N$ is prime, a primality certificate which one can verify quickly. In this talk, we recall the steps of ECPP and discuss its implementation in PARI/GP.