10.12.2012 Views

Prime Numbers

Prime Numbers

Prime Numbers

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

REFERENCES 555<br />

[De Win et al. 1998] E. De Win, S. Mister, B. Preneel, and M. Wiener. On the<br />

performance of signature schemes based on elliptic curves. In<br />

[Buhler 1998], pages 252–266.<br />

[Deléglise and Rivat 1996] M. Deléglise and J. Rivat. Computing π(x): the<br />

Meissel, Lehmer, Lagarias, Miller, Odlyzko method. Math. Comp.,<br />

65:235–245, 1996.<br />

[Deléglise and Rivat 1998] M. Deléglise and J. Rivat. Computing ψ(x). Math.<br />

Comp., 67:1691–1696, 1998.<br />

[Deshouillers et al. 1998] J.-M. Deshouillers, H. te Riele, and Y. Saouter. New<br />

experimental results concerning the Goldbach conjecture. In<br />

[Buhler 1998], pages 204–215.<br />

[Deuring 1941] M. Deuring. Die Typen der Multiplikatorenringe elliptischer<br />

Funktionenkörper. Abh. Math. Sem. Hansischen Univ., 14:197–272, 1941.<br />

[Deutsch 1982] D. Deutsch. Is there a fundamental bound on the rate at which<br />

information can be processed? Phys. Rev. Lett., 42:286–288, 1982.<br />

[Deutsch 1985] D. Deutsch. Quantum theory, the Church–Turing principle, and<br />

the universal quantum computer. Proc. Roy. Soc. London Ser. A,<br />

400:97–117, 1985.<br />

[Dickson 1904] L. Dickson. A new extension of Dirichlet’s theorem on prime<br />

numbers. Messenger of Math., 33:155–161, 1904.<br />

[Diffie and Hellman 1976] W. Diffie and M. Hellman. New directions in<br />

cryptography. IEEE Trans. Inform. Theory, 22:644–654, 1976.<br />

[Dilcher 1999] K. Dilcher. Nested squares and evaluation of integer products, 1999.<br />

http://www.mscs.dal.ca/˜dilcher/Preprints/nested.ps.<br />

[Dimitrov et al. 1995] V. Dimitrov, T. Cooklev, and B. Donevsky. Number<br />

theoretic transforms over the golden section quadratic field. IEEE Trans.<br />

Sig. Proc., 43:1790–1797, 1995.<br />

[Dimitrov et al. 1998] V. Dimitrov, G. Jullien, and W. Miller. A residue number<br />

system implementation of real orthogonal transforms. IEEE Trans. Sig.<br />

Proc., 46:563–570, 1998.<br />

[Ding et al. 1996] C. Ding, D. Pei, and A. Salomaa. Chinese Remainder Theorem:<br />

Applications in Computing, Coding, Cryptography. World Scientific, 1996.<br />

[Dixon 1981] J. Dixon. Asymptotically fast factorization of integers. Math. Comp.,<br />

36:255–260, 1981.<br />

[Dress and Olivier 1999] F. Dress and M. Olivier. Polynômes prenant des valeurs<br />

premières. Experiment. Math., 8:319–338, 1999.<br />

[Dubner et al. 1998] H. Dubner, T. Forbes, N. Lygeros, M. Mizony, and<br />

P. Zimmermann. Ten consecutive primes in arithmetic progression, 1998.<br />

http://listserv.nodak.edu/archives/nmbrthry.html.<br />

[Dubner and Gallot 2002] H. Dubner and Y. Gallot. Distribution of generalized<br />

Fermat numbers. Math. Comp. 71:825–832, 2002.

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

Saved successfully!

Ooh no, something went wrong!