Abstract
Several mathematical procedures require the provision of large “random” prime numbers. Fermat’s Little Theorem plays an important role in many primality tests and in motivating the concept of pseudoprimes. It tells us that for a prime number n and an integer b with gcd(b, n) = 1 the congruence b n −1 ≡ 1 mod n holds. An alternative formulation of Fermat’s Little Theorem states that for any prime n and an arbitrary integer b one has
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alford, W.R., Granville, A. and Pomerance, C. “There are infinitely many Carmichael numbers.” Preprint (April 1992).
Baillie, R. and Wagstaff Jr., S.S. “Lucas pseudoprimes.” Math. Comp., Vol. 35 (1980): pp. 1391–1417.
Di Porto, A. and Filipponi, P. “A Probabilistic Primality Test Based on the Properties of Certain Generalized Lucas Numbers.” Advances in Cryptology — Eurocrypt’88, LectureNotes in Computer Science, Vol. 330, Springer-Verlag, New York-Berlin-Heidelberg, (1988): pp. 211–223.
Di Porto, A. and Filipponi, P. “Generating M-strong Fibonacci Pseudoprimes.” The Fibonacci Quarterly, Vol. 30 (1992): pp. 339–343.
Filipponi, P. “Table of Fibonacci Pseudoprimes to 108.” Note Recensioni Notizie Vol. 37 (1988): pp. 1–2.
Filipponi, P. “Table of Fibonacci Pseudoprimes to 108.” Note Recensioni Notizie Vol. 37 (1988): pp. 33–38.
Kowol, G. “On Strong Dickson Pseudoprimes.” Applicable Algebra in Engineering, Communication and Computing (AAECC), Vol. 3 (1992): pp. 129–138.
Lidl, R and Müller, W.B. “Generalizations of the Fibonacci Pseudoprimes Test.” Discrete Mathematics, Vol. 92 (1991): pp. 211–220.
Lidl, R., Müller, W.B. and Oswald, A. “Some Remarks on Strong Fibonacci Pseudoprimes.” Applicable Algebra in Engineering, Communication and Computing (AAECC), Vol. 1 (1990): pp. 59–65.
Lidl, R and Niederreiter, H. Finite Fields. Addison Wesley, Reading, 1983. (Now published by Cambridge University Press, Cambridge.).
Müller, W.B. and Oswald A. “Dickson Pseudoprimes and Primality Testing.” Advances in Cryptology — Eurocrypt’91, Lecture Notes in Computer Science. Vol. 547 Springer-Verlag, New York-Berlin-Heidelberg (1991): pp. 512–516.
Pinch, R.G.E. “The Carmichael Numbers up to 1015.” Preprint (April 1992).
Singmaster, D. “Some Lucas pseudoprimes.” Abstracts Amer.Math.Soc., Vol. 4 No. 83T-10-146, (1983): pp. 197.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Müller, W.B., Oswald, A. (1993). Generalized Fibonacci Pseudoprimes and Probable Primes. In: Bergum, G.E., Philippou, A.N., Horadam, A.F. (eds) Applications of Fibonacci Numbers. Springer, Dordrecht. https://doi.org/10.1007/978-94-011-2058-6_45
Download citation
DOI: https://doi.org/10.1007/978-94-011-2058-6_45
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-010-4912-2
Online ISBN: 978-94-011-2058-6
eBook Packages: Springer Book Archive