Skip to main content
SpringerLink
Log in

Pseudoprimes, Poker and Remote Coin Tossing

  • Chapter
Number Theory in Science and Communication

Part of the book series: Springer Series in Information Sciences ((SSINF,volume 7))

  • 378 Accesses

Abstract

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.

1 Indeed, every Fermat number, prime or not, obeys (19.1) (see Sect. 19.5).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. P. Ribenboim: The New Book of Prime Number Records (Springer, New York 1996)

    Book  MATH  Google Scholar 

  2. C Pomerance: Recent developments in primality testing. Math. Intelligencer 3, 97–105 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  3. A. J. van der Poorten, A. Rotkiewicz: On strong pseudoprimes in arithmetic progressions. J. Austral. Math. Soc. 29, 316–321 (1980)

    Article  MATH  Google Scholar 

  4. A. Rotkiewicz: On Euler-Lehmer pseudoprimes and strong pseudoprimes with parameters L, Q in arithmetic progressions. Math. Comp. 39, 239–247 (1982)

    MathSciNet  MATH  Google Scholar 

  5. S. 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–377

    Google Scholar 

  6. S. Micali (personal communication)

    Google Scholar 

  7. A. Shamir, R.L. Rivest, L. M. Adleman: “Mental Poker,” in The Mathematical Gardener, ed. by D. Klarner (Prindle Weber Schmidt, Boston 1981) pp. 37–43

    Chapter  Google Scholar 

  8. S. S. Wagstaff: Large Carmichael numbers. Math. J. Okayama Univ. 22, 33–41 (1980)

    MathSciNet  MATH  Google Scholar 

  9. M. O. Rabin: Probabilistic algorithm for testing primality. J. Number Theory 12, 128–138 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  10. C.F. Gauss: Disquisitiones Arithmeticae [English transl. by A.A. Clarke, Yale University Press, New Haven 1966]

    MATH  Google Scholar 

  11. J.D. Dixon: Asymptotically fast factorization of integers. Math. Comp. 36, 255–260 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  12. E. Lucas: Théorie des Nombres (Blanchard, Paris 1961)

    MATH  Google Scholar 

  13. J. Brillhart, D.H. Lehmer, J.L. Selfridge: New primality criteria and factorizations of 2m ± 1. Math Comp. 29, 620–647 (1975)

    MathSciNet  MATH  Google Scholar 

  14. L. M. Adleman, C. Pomerance, R. S. Rumely: On distinguishing prime numbers from composite numbers. Ann. Math. (2) 117, 173–206 (1983). See also: M. J. Coster, B. A. LaMacchia, C. P. Schnorr, J. Stern: Improved low-density subset sum algorithms. J. Computational Complexity 2, 111–128 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  15. I. L. Chuang, R. Laflamme, P. W. Shor, W. H. Zurek: Science 270, 1633 (1995)

    Article  MathSciNet  ADS  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Drittes Physikalisches Institut, Universität Göttingen, Bürgerstraße 42-44, D-37073, Göttingen, Germany

    Professor Dr. Manfred R. Schroeder (Direktor, Past Director)

  2. Bell Laboratories, Acoustics Speech and Mechanics Research, Murray Hill, NJ, 07974, USA

    Professor Dr. Manfred R. Schroeder (Direktor, Past Director)

Authors
  1. Professor Dr. Manfred R. Schroeder
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Schroeder, M.R. (1997). Pseudoprimes, Poker and Remote Coin Tossing. In: Number Theory in Science and Communication. Springer Series in Information Sciences, vol 7. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-03430-9_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-03430-9_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-62006-8

  • Online ISBN: 978-3-662-03430-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation