Prime Numbers

560 REFERENCES
[Joe 1999] S. Joe. An average L2 discrepancy for number-theoretic rules. SIAM J.
Numer. Anal., 36:1949–1961, 1999.
[Johnson et al. 2001] D. Johnson, A. Menezes, and S. Vanstone. The elliptic curve
digital signature algorithm (ECDSA). International Journal of
Information Security, 1:36–63, 2001.
[Juriˇsić and Menezes 1997] A. Juriˇsić and A. Menezes. Elliptic curves and
cryptography. Dr. Dobb’s Journal, pages 26–36, April 1997.
[Kaczorowski 1984] J. Kaczorowski. On sign changes in the remainder-term of the
prime-number formula. I. Acta Arith., 44:365–377, 1984.
[Kaliski 1988] B. Kaliski, Jr. Elliptic Curves and Cryptography: a Pseudorandom
Bit Generator and other Tools. PhD thesis, Massachusetts Institute of
Technology, 1988.
[Kaliski 1991] B. Kaliski, Jr. One-way permutations on elliptic curves. J.
Cryptology, 3:187–199, 1991.
[Keller 1999] W. Keller. Prime factors k.2 n + 1 of Fermat numbers Fm and
complete factoring status, 1999.
http://www.prothsearch.net/fermat.html.
[Knuth 1971] D. Knuth. The analysis of algorithms. In Actes du Congrès
International des Mathématiciens (Nice 1970), Volume 3, pages 269–274.
Gauthier-Villars, 1971.
[Knuth 1981] D. Knuth. Seminumerical Algorithms (Second edition), volume 2 of
The Art of Computer Programming. Addison-Wesley, 1981.
[Knuth and Trabb Pardo 1976] D. Knuth and L. Trabb Pardo. Analysis of a
simple factorization algorithm. Theoret. Comput. Sci., 3:321–348,
1976-77.
[Koblitz 1987] N. Koblitz. Elliptic curve cryptosystems. Math. Comp., 48:203–209,
1987.
[Koblitz 1994] N. Koblitz. A Course in Number Theory and Cryptography.
Springer—Verlag, 1994.
[Koç et al. 1996] Ç. Koç, T. Acar, and B. Kaliski, Jr. Analyzing and comparing
Montgomery multiplication algorithms. IEEE Micro, 16:26-33, 1996.
[Koç and Hung 1997] Ç. Koç and C. Hung. Fast algorithm for modular reduction.
IEEE Proc.: Computers and Digital Techniques, 145(4), 1998.
[Kocis and White 1997] L. Kocis and W. Whiten. Computational investigations of
low-discrepancy sequences. ACM Trans. Math. Soft., 23:266–294, 1997.
[Konyagin and Pomerance 1997] S. Konyagin and C. Pomerance. On primes
recognizable in deterministic polynomial time. In The Mathematics of
Paul Erdős, I, volume 13 of Algorithms and Combinatorics, pages
176–198. Springer—Verlag, 1997.
[Korobov 1992] N. Korobov, Exponential Sums and their Applications, Kluwer
Academic Publishers, 1992.