3 Proof of the complexity We shall show the second loop terminates early. Namely r can be taken in polynomial order.

First Page		Document Content
Date: 2011-07-06 20:43:50 Finite fields Integer sequences Prime number AKS primality test Miller–Rabin primality test Binary logarithm Primality certificate Prime gap Mathematics Primality tests Number theory		3 Proof of the complexity We shall show the second loop terminates early. Namely r can be taken in polynomial order. Add to Reading List Source URL: matha.e-one.uec.ac.jp Download Document from Source Website File Size: 47,40 KB Share Document on Facebook

	IMAPP MATHEMATICS RADBOUD UNIVERSITY NIJMEGEN The Netherlands Better paths for elliptic curve primality proofs DocID: 1kNR2 - View Document
	PDF Document DocID: 17o88 - View Document
	PRIMES is in P Manindra Agrawal, Neeraj Kayal and Nitin Saxena∗ Department of Computer Science & Engineering Indian Institute of Technology Kanpur Kanpur, INDIA August 6, 2002 DocID: 15Kbq - View Document
	PRIMES is in P Manindra Agrawal Neeraj Kayal ∗ Nitin Saxena Department of Computer Science & Engineering DocID: 138FI - View Document
	3 Proof of the complexity We shall show the second loop terminates early. Namely r can be taken in polynomial order. DocID: 11dhI - View Document