Editing Primality test (section)

== Sources ==
{{Refbegin}}
* {{cite book |last1=Crandall |first1=Richard |author1-link=Richard Crandall |last2=Pomerance |first2=Carl |author2-link=Carl Pomerance |year=2005 |title=Prime Numbers: A Computational Perspective |publisher=Springer |edition=2nd |isbn=0-387-25282-7}} Chapter 3: Recognizing Primes and Composites, pp.&nbsp;109–158. Chapter 4: Primality Proving, pp.&nbsp;159–190. Section 7.6: Elliptic curve primality proving (ECPP), pp.&nbsp;334–340.
* {{cite book |first=Donald |last=Knuth |author-link=Donald Knuth |title=[[The Art of Computer Programming]] |volume=2: ''Seminumerical Algorithms'' |edition=3rd |publisher=Addison–Wesley |year=1997 |isbn=0-201-89684-2 |pages=391–396 |chapter=section 4.5.4}}
* {{cite book |last1=Cormen |first1=Thomas H. |author1-link=Thomas H. Cormen |last2=Leiserson |first2=Charles E. |author2-link=Charles E. Leiserson |last3=Rivest |first3=Ronald L. |author3-link=Ron Rivest |last4=Stein |first4=Clifford |author4-link=Clifford Stein |year=2001 |title=[[Introduction to Algorithms]] |edition=Second |publisher=MIT Press, McGraw–Hill |isbn=0-262-03293-7 |chapter=Section 31.8: Primality testing |pages=887–896}}
* {{cite book |first=Christos H. |last=Papadimitriou |author-link=Christos Papadimitriou |year=1993 |title=Computational Complexity |url=https://archive.org/details/computationalcom00papa |url-access=limited |publisher=Addison Wesley |edition=1st |isbn=0-201-53082-1 |chapter=Section 10.2: Primality |zbl=0833.68049 |pages=[https://archive.org/details/computationalcom00papa/page/n230 222]–227}}
* {{cite book |first=Hans |last=Riesel |author-link=Hans Riesel |year=1994 |title=Prime Numbers and Computer Methods for Factorization |edition=second |publisher=Birkhäuser |isbn=0-8176-3743-5 |zbl=0821.11001 |series=Progress in Mathematics |volume=126 |location=Boston, Massachusetts}}
{{Refend}}