Advertisement

On the Combined Fermat/Lucas Probable Prime Test⋆

  • Siguna Müller
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1746)

Abstract

Based on the well-known Baillie/Wagstaff suggestion [2] we introduce a rapid pseudoprimality test with high confidence. The test is extremely fast and only requires evaluation of power polynomials and the Lucas V -sequence. This is in contrast to the original version, where usually the more cumbersome evaluation of the Lucas U-sequence is required as well. We analyze the underlying properties of the proposed test and give a characterization of the pseudoprimes. Software and hardware evaluation methods for both modular exponentiation and evaluation of recursion sequences are widely employed and very efficient. Therefore the test can be run at low cost for varieties of different bases/parameters. The number of those that pass the test are of great interest. We exhibit the exact number of these “liars”.

Keywords

Prime Divisor Prime Basis Combine Test Modular Exponentiation Recurrence Sequence 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Arnault, F.: Rabin-Miller primality test: Composite numbers which pass it. Math. Comp. 64(209), 355–361 (1995)zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Baillie, R., Wagstaff, S., Jr.: Lucas pseudoprimes. Math. Comp. 35, 1391–1417 (1980)zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Bleichenbacher, D.: Efficiency and Security of Cryptosystems based on Number Theory. Dissertation ETH Zürich 1996.Google Scholar
  4. 4.
    Carmichael, R.D.: On Sequences of Integers Defined by Recurrence Relations. Quart. J. Pure Appl. Math. Vol. 48, 343–372 (1920)Google Scholar
  5. 5.
    Grantham, J.: A Probable Prime Test with High Confidence. J. Number Theory 72, 32–47 (1998)zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Guillaume, D., Morain, F.: Building pseudoprimes with a large number of prime factors. AAECC 7(4), 263–277 (1996)zbMATHMathSciNetGoogle Scholar
  7. 7.
    Jaeschke, G.: On strong pseudoprimes to several bases. Math. Comp. 61, 915–926 (1993)zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Kowol, G.: On strong Dickson pseudoprimes. AAECC 3, 129–138 (1992)zbMATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Lidl, R., Müller, W.B., Oswald, A.: Some remarks on strong Fibonacci pseudoprimes. AAECC 1, 59–65 (1990)zbMATHCrossRefGoogle Scholar
  10. 10.
    More, W.: The LD Probable Prime Test. In: Mullin, R.C., Mullen, G. (eds.) Contemporary Mathematics 225, 185–191 (1999)Google Scholar
  11. 11.
    Müller, S.: On Strong Lucas Pseudoprimes. In: Dorninger, D., Eigenthaler, G., Kaiser, H.K., Kautschitsch, H., More, W., Müller, W.B. (eds.) Contribution to General Algebra, 10, 237–249 (1998).Google Scholar
  12. 12.
    Müller, S.: Carmichael Numbers and Lucas Tests. In: Mullin, R.C., Mullen, G. (eds.) Contemporary Mathematics 225, 193–202 (1999)Google Scholar
  13. 13.
    Müller, S: On the rank of appearance of Lucas sequences. To appear in the Proceedings of the 8th International Conference on Fibonacci Numbers and Their Applications, June 22–26, 1998, Rochester, New York.Google Scholar
  14. 14.
    Müller, W.B., Oswald, A.: Dickson pseudoprimes and primality testing. In: Davies, D.W. (ed.) Advances in Cryptology-EUROCRYPT’91, 512–516. Lecture Notes in Computer Science, Vol. 547. Berlin Heidelberg New York: Springer 1991Google Scholar
  15. 15.
    Pinch, R.G.E.: The Carmichael numbers up to 1015. Math. Comp. 61, 381–391 (1993)zbMATHCrossRefMathSciNetGoogle Scholar
  16. 16.
  17. 17.
    Postl, H.: Fast evaluation of Dickson polynomials. In: Dorninger, D., Eigenthaler, G., Kaiser H., Müller, W.B. (eds.) Contributions to General Algebra 6, 223–225. B.G.Teubner: Stuttgart 1988Google Scholar
  18. 18.
    Ribenboim, P.: The New Book of Prime Number Records. Berlin: Springer 1996zbMATHGoogle Scholar
  19. 19.
    Somer, L.: On Lucas d-Pseudoprimes. In: Bergum, G., Philippou, A., Horadam, A. (eds.) Applications of Fibonacci Numbers, Vol. 7, Kluwer, 369–375 (1998)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Siguna Müller
    • 1
  1. 1.Dept. of Math.University of KlagenfurtKlagenfurtEurope

Personalised recommendations