1. [SW Rel.] Allombert, B., Belabas, K.: PARI/GP version 2.15.4 (2024). lic: GPL-2-or-later. url: https://pari.math.u-bordeaux.fr/, swhid: $$\langle $$swh:1:dir:8e76e2daa122f03e6a9206e18a62aa7ab48efb93;origin=https://pari.math.u-bordeaux.fr/git/pari.git;visit=swh:1:snp:cd7a1ce7663980b27dfdfc3e96c97fb073271c02;anchor=swh:1:rel:68863db68dd3d346ce5685ad767360c01dfca26a$$\rangle $$
2. Atkin, A.O.L., Morain, F.: Elliptic curves and primality proving. Math. Comput. 61(203), 29–68 (1993)
3. Bernstein, D.J.: How to find smooth parts of integers (2004). Preprint. https://cr.yp.to/factorization/smoothparts-20040510.pdf
4. Bernstein, D.J.: Proving primality in essentially quartic random time. Math. Comput. 76(257), 389–403 (2007)
5. [SW Rel.] Enge, A.: CM version 0.4.3, Feb. 2024. lic: GPL-3-or-later. url: https://www.multiprecision.org/cm/, swhid: $$\langle $$swh:1:dir:056f ba450fbd9406efd86a5db93895fa63d212df;origin=https://gitlab.inria.fr/enge/cm;visit=swh:1:snp:d0a38ff75431aab4c91e1a50a51b26 a573e17784;anchor=swh:1:rev:7a6567cf2d98aa9a37166b2c4c99f7dfcecfea58$$\rangle $$