Pseudoprimes, Poker and Remote Coin Tossing
In this chapter we take a closer look at numbers that are not primes, but are tantalizingly close to primes in some respects. Of course, a given number n > 1 is either prime or composite — in other words, n is either “pregnant” with factors or not; there is no third alternative. But nevertheless, it makes sense to define and, as we do in this chapter, discuss such odd entities as pseudoprimes, absolute (or universal) pseudoprimes and strong pseudoprimes. When talking about extremely large numbers, pseudoprimality is sometimes the only evidence we can go by.
KeywordsGreat Common Divisor Primality Test Chinese Remainder Theorem Fermat Number Sporadic Simple Group
Unable to display preview. Download preview PDF.
- 19.1R. Morris: On the converse of Fermat’s theorem. Comp. Sci. Tech. Rep. to be published.Google Scholar
- 19.5S. Goldwasser, S. Micali: “Probabilistic Encryption and How To Play Mental Poker,” in Proceedings of the 4th ACM Symposium on the Theory of Computing (Assoc. Comp. Machinery, New York 1982 ) pp. 365–377Google Scholar
- 19.6S. Micali (personal communication)Google Scholar
- 19.7A. Shamir, R. L. Rivest, L. M. Adleman: “Mental Poker,” in The MathematicalGardener,ed. by D. Klarner (Prindle Weber Schmidt, Boston 1981) pp. 37–43Google Scholar
- 19.9M. O. Rabin: Probabilistic algorithm for testing primality. J. Number Theory 12,128–138 (1980)sGoogle Scholar
- 19.10C. F. Gauss: Disquisitiones Arithmeticae [English transi. by A. A. Clarke, Yale University Press, New Haven 1966 ]Google Scholar
- 19.14L. M. Adleman, C. Pomerance, R. S. Rumely: On distinguishing prime numbers from composite numbers (to appear)Google Scholar