Skip to main content
SpringerLink
Log in

Some remarks on strong fibonacci pseudoprimes

  • Published:
Applicable Algebra in Engineering, Communication and Computing Aims and scope

Abstract

Necessary and sufficient conditions are given for an odd composite integern to be a Fibonacci pseudoprime of them th kind for allm∈ℤ. One consequence of this characterization is that any such pseudoprime has to be a Carmichael number.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Baillie, R., Wagstaff Jr., S. S.: Lucas pseudoprimes. Math. Comp.35, 1391–1417 (1980)

    Google Scholar 

  2. Dickson, L.: The analytic representation of substitutions on a power of a prime number of letters with a discussion of the linear group I. Ann. Math.11, 65–120 (1896)

    Google Scholar 

  3. Di Porto, A., Filipponi, P.: A probabilistic primality test based on the properties of certain generalized Lucas numbers. In: Advances in Cryptology — Eucocrypt'88, Lecture Notes in Computer Science vol.330, pp. 211–223. Berlin, Heidelberg, New York: Springer 1988

    Google Scholar 

  4. Di Porto, A., Filipponi, P.: GeneratingM-strong Fibonacci pseudoprimes. Extended Abstract, Eurocrypt'89, Houthalen (Belgium), April 10–13, 1989

  5. Filipponi, P.: Table of Fibonacci pseudoprimes to 108. Note Recensioni Notizie37, 33–38 (1988)

    Google Scholar 

  6. Koblitz, N.: A course in number theory and cryptography. Berlin, Heidelberg, New York: Springer 1987

    Google Scholar 

  7. Lausch, H., Nöbauer, W.: Algebra of polynomials. North Holland: Amsterdam 1973

    Google Scholar 

  8. Lidl, R., Müller, W. B.: Generalizations of the Fibonacci pseudoprimes test. Submitted

  9. Lidl, R., Niederreiter, H.: Finite fields. Addison Wesley, Reading, 1983. (Now published by Cambridge University Press, Cambridge)

    Google Scholar 

  10. Müller, W. B.: Polynomial functions in modern cryptology. In: Contributions to General Algebra vol.3, pp. 7–32. Stuttgart: Teubner 1985

    Google Scholar 

  11. Müller, W. B.: Polynome und Einwegfunktionen. e&i (Elektrotechnik und Informationstechnik)105, 31–35 (1988)

    Google Scholar 

  12. Nöbauer, R.: Über die Fixpunkte einer Klasse von Dickson-Permutationen. Sb.d.Österr.Akad.d.Wiss., math.-nat.Kl., Abt.II,193, 521–547 (1984)

    Google Scholar 

  13. Nöbauer, W.: Über Permutationspolynome und Permutationsfunktionen für Primzahlpotenzen. Mh.Math.69, 230–238 (1965)

    Google Scholar 

  14. Rédei, L.: Algebra, Volume 1. Oxford, London, New York: Pergamon Press 1967

    Google Scholar 

  15. Ribenboim, P.: The book of prime number records. Berlin, Heidelberg, New York: Springer 1988

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Tasmania, 7001, Hobart, Tas., Australia

    Rudolf Lidl

  2. Institut für Mathematik, Universität Klagenfurt, A-9022, Klagenfurt, Austria

    Winfried B. Müller

  3. School of Information Engineering, Teesside Polytechnic, TS1 3BA, Middlesbrough, Clev., Great Britain

    Alan Oswald

Authors
  1. Rudolf Lidl
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Winfried B. Müller
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Alan Oswald
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This author expresses his special thanks to the School of Information Engineering at Teesside Polytechnic, Middlesbrough, England, for its support and hospitality during a visiting appoint of 3 months in 1989, when this paper was written

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lidl, R., Müller, W.B. & Oswald, A. Some remarks on strong fibonacci pseudoprimes. AAECC 1, 59–65 (1990). https://doi.org/10.1007/BF01810848

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01810848

Keywords

Search

Navigation