Prime Numbers

566 REFERENCES
[Oesterlé 1985] J. Oesterlé. Nombres de classes des corps quadratiques
imaginaires. In Seminar Bourbaki (1983/84), Astérisque No. 121-122,
pages 309–323, 1985.
[Ohi 2003] H. Oki, 2003. Private communication.
[Okeya and Sakurai 2001] K. Okeya and K. Sakurai. Efficient Elliptic Curve
Cryptosystems from a Scalar Multiplication Algorithm with Recovery of
the y-Coordinate on a Montgomery-Form Elliptic Curve. In C. K. Koc,
D. Naccache, C. Paar (Eds.). Third International Workshop on
Cryptographic Hardware and Embedded Systems—CHES 2001. LNCS
2162:126, Springer–Verlag, Paris, France, May 14-16, 2001.
[Owen 1995] A. Owen. Randomly permuted (t, m, s)-nets and (t, m, s)-sequences.
In Monte Carlo and Quasi-Monte Carlo Methods in Scientific Computing,
volume 106 of Lecture Notes in Statistics, pages 299–317.
Springer–Verlag, 1995.
[Owen 1997a] A. Owen. Monte Carlo variance of scrambled net quadrature. SIAM
J. Numer. Anal., 34:1884–1910, 1997.
[Owen 1997b] A. Owen. Scrambled net variance for integrals of smooth functions.
Ann. Statist., 25:1541–1562, 1997.
[Padma and Venkataraman 1996] R. Padma and S. Venkataraman. Elliptic curves
with complex multiplication and a character sum. J. Number Theory,
61:274–282, 1996.
[Papadopoulos 1999] J. Papadopoulos, 1999. Private communication.
[Papageorgiu and Traub 1997] A. Papageorgiu and J. Traub. Faster evaluation of
multidimensional integrals, 1997.
http://arxiv.org/find/physics/1/au:+Traub/0/1/0/2000/0/1.
[Parberry 1970] E. Parberry. On primes and pseudo-primes related to the
Fibonacci sequence. Fibonacci Quart., 8:49–60, 1970.
[Park and Miller 1988] S. Park and K. Miller. Random number generators: good
ones are hard to find. Comm. ACM, 31:1192–1201, 1988.
[Paskov and Traub 1995] S. Paskov and J. Traub. Faster valuation of financial
derivatives. J. Portfolio Management, 22:113–120, 1995.
[Patel and Sundaram 1998] S. Patel and G. Sundaram. An efficient discrete log
pseudo random generator. In H. Krawczyk, editor, Advances in
Cryptology, Proc. Crypto ’98, volume 1462 of Lecture Notes in Computer
Science, pages 304–317. Springer–Verlag, 1998.
[Paulos 1995] J. Paulos. High 5 jive. Forbes, 156:102, October 1995.
[Paun et al. 1998] G. Paun, G. Rozenberg, and A. Salomaa. DNA Computing:
New Computing Paradigms. Springer–Verlag, 1998.
[Peralta 1993] R. Peralta. A quadratic sieve on the n-dimensional hypercube. In
Advances in Cryptology, Proc. Crypto ’92, volume 740 of Lecture Notes in
Computer Science. Springer–Verlag, 1993.