Numeri primi: la certezza - Dipartimento di Matematica
Numeri primi: la certezza - Dipartimento di Matematica
Numeri primi: la certezza - Dipartimento di Matematica
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
<strong>Numeri</strong> <strong>primi</strong>: <strong>la</strong> <strong>certezza</strong> 24<br />
[26] S. Müller, On the combined Fermat/Lucas probable prime test, in<br />
Crypto&Co<strong>di</strong>ng ’99, Lecture Notes in Computer Science 1746, Springer-Ver<strong>la</strong>g<br />
1999, 222-235.<br />
[27] M. Nair, On Chebyshev-type inequalities for primes, The American<br />
Mathematical Monthly, 89, 1982, 126-129.<br />
[28] P. Pandey, R. Bhattacharjee, Primality testing, Thesis, April 2001, URL:<br />
http://www.cse.iitk.ac.in/research/btp2001/primality.ps.gz, 2001<br />
[29] V. R. Pratt, Every prime has a succinct certificate, SIAM Journal on<br />
Computing, 4, 1975, 214-220.<br />
[30] C. Rotel<strong>la</strong>, An Efficient Implementation of the AKS Polynomial-Time Primality<br />
Proving Algorithm, SCS Undergraduate Thesis (Advisor: K<strong>la</strong>us Sutner),<br />
Carnegie Mellon, May 2005.<br />
[31] R. Schoof, Elliptic curves over finite fields and the computation of square roots<br />
mod p, Math. Computation, 44, 1985, 483-494.<br />
[32] P. Serafini, Introduzione al<strong>la</strong> complessità computazionale, URL:http://<br />
www.<strong>di</strong>mi.uniud.it/ serafini/complcomp.pdf
Change language