Fast evaluation of Rédei functions | Applicable Algebra in Engineering, Communication and Computing Skip to main content
Springer Nature Link
Log in

Fast evaluation of Rédei functions

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

Abstract

We introduce a fast evaluation algorithm for Rédei functions of complexityO(log2 n). Rédei functions are of interest in cryptographic applications and primality testing.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (Japan)

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Lidl, R., Mullen, G. L., Turnwald, G.: Dickson Polynomials. Pitman Monographs and Surveys in Pure and Applied Mathematics vol.65. Harlow: Longman 1993

    Google Scholar 

  2. Lidl, R., Müller, W. B.: Permutation polynomials in RSA-cryptosystems. In: Advances in Cryptology. Proceedings of the Crypto '83, pp. 293–301. New York: Plenum Press 1984

    Google Scholar 

  3. Lidl, R., Müller, W. B.: Generalization of the Fibonacci pseudoprime test. Discrete Math.92, 211–220 (1991)

    Google Scholar 

  4. More, W.: Rasches Auswerten von Rédei-Funktionen. Anz. Österreich. Akad. Wiss. Math.-Natur. Kl.128, 69–72 (1991)

    Google Scholar 

  5. Nöbauer, R.: Cryptoanalysis of the Rédei-scheme. In: Contributions to General Algebra vol.3, pp. 255–264. Vienna: Hölder-Pichler-Tempsky 1985

    Google Scholar 

  6. Nöbauer, R.: Rédei-Funktionen und ihre Anwendungen in der Kryptographie. Acta Sci. Math. (Szeged)50, 287–298 (1986)

    Google Scholar 

  7. Nöbauer, R.: Key distribution systems, based on polynomial functions and Rédei functions. Problems Control Inform. Theory15, 91–100 (1986)

    Google Scholar 

  8. Nöbauer, R.: Rédei-Permutationen endlicher Körper. In: Contributions to General Algebra vol. 5, pp. 235–246. Vienna: Hölder-Pichier-Tempsky 1987

    Google Scholar 

  9. Nöbauer, R.: Rédei-Permutationen auf RestklassenringenZ/(m). Monatshefle. Math.106, 41–56 (1988)

    Google Scholar 

  10. Nöbauer, W.: Über die Zyklenlänge der Rédei-Permutationen. Anz. Österreich. Akad. Wiss. Math.-Natur. Kl.121, 121–123 (1984)

    Google Scholar 

  11. Nöbauer, W.: Rèdei-Funktionen für Zweierpotenzen. Period. Math. Hungar.17, 37–44 (1986)

    Google Scholar 

  12. Pieper, R.: Kryptoanalytische Untersuchungen rationaler Permutationen von kommutativen unitären Ringen. Dissertation, Universität Dortmund 1990

  13. Pieper, R.: Cryptanalysis of Rédei- and Dickson Permutations on Arbitrary Finite Rings. AAECC4, 59–76 (1993)

    Google Scholar 

  14. Rédei, L.: Über eindeutig umkehrbare Polynome in endlichen Körpern. Acta Sci. Math. (Szeged)11, 85–92(1946)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Klagenfurt, A-9020, Klagenfurt, Austria

    Willi More

Authors
  1. Willi More
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This paper was partially supported by theÖsterreichischen Fonds zur Förderung der wissenschaftlichen Forschung under FWF project P9272

Rights and permissions

Reprints and permissions

About this article

Cite this article

More, W. Fast evaluation of Rédei functions. AAECC 6, 171–173 (1995). https://doi.org/10.1007/BF01195335

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation