10.12.2012 Views

Prime Numbers

Prime Numbers

Prime Numbers

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

554 REFERENCES<br />

[Crandall 1997b] R. Crandall. Integer convolution via split-radix fast Galois<br />

transform, 1997. http://www.perfsci.com.<br />

[Crandall 1998] R. Crandall. Recycled (simultaneous) evaluations of the Riemann<br />

zeta function. Unpublished manuscript, 1998.<br />

[Crandall 1999a] R. Crandall. Applications of space-filling curves. Unpublished<br />

manuscript, 1999.<br />

[Crandall 1999b] R. Crandall. Fast algorithms for elliptic curve cryptography.<br />

Unpublished manuscript, 1999.<br />

[Crandall 1999c] R Crandall. Alternatives to the Riemann–Siegel formula.<br />

Unpublished manuscript, 1999.<br />

[Crandall 1999d] R. Crandall. Parallelization of Pollard-rho factorization, 1999.<br />

http://www.perfsci.com.<br />

[Crandall et al. 1997] R. Crandall, K. Dilcher, and C. Pomerance. A search for<br />

Wieferich and Wilson primes. Math. Comp., 66:433–449, 1997.<br />

[Crandall et al. 1995] R. Crandall, J. Doenias, C. Norrie, and J. Young. The<br />

twenty-second Fermat number is composite. Math. Comp., 64<br />

210:863–868, 1995.<br />

[Crandall and Fagin 1994] R. Crandall and B. Fagin. Discrete weighted transforms<br />

and large integer arithmetic. Math. Comp., 62:305–324, 1994.<br />

[Crandall et al. 2003] R. Crandall, E. Mayer, and J. Papadopoulos. The<br />

twenty-fourth Fermat number is composite. Math. Comp., 72:1555-1572,<br />

2003.<br />

[Crandall and Garst 2001] R. Crandall, Method and apparatus for fast elliptic<br />

encryption with direct embedding, U. S. Patent #6307935, 2001.<br />

[Crandall et al. 2004] R. Crandall, E. Jones, J. Klivington, and D. Kramer.<br />

Gigaelement FFTs on Apple G5 clusters. http://www.apple.com/acg.<br />

[Crandall and Papadopoulos 2003] R. Crandall and J. Papadopoulos. On the<br />

Implementation of AKS-class Primality Tests.<br />

http://www.apple.com/acg.<br />

[Creutzburg and Tasche 1989] R. Creutzburg and M. Tasche. Parameter<br />

determination for complex number-theoretic transforms using cyclotomic<br />

polynomials. Math. Comp., 52:189–200, 1989.<br />

[Damg˚ard et al. 1993] I. Damg˚ard, P. Landrock, and C. Pomerance. Average case<br />

error estimates for the strong probable prime test. Math. Comp.,<br />

61:177–194, 1993.<br />

[Darmon and Granville 1995] H. Darmon and A. Granville. On the equations<br />

z m = F (x, y) and Ax p + By q = Cz r . Bull. London Math. Soc.,<br />

27:513–543, 1995.<br />

[Davenport 1980] H. Davenport. Multiplicative Number Theory (second edition).<br />

Springer–Verlag, 1980.<br />

[Davis 1973] M. Davis. Hilbert’s tenth problem is unsolvable. Amer. Math.<br />

Monthly, 80:233–269, 1973.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!