Cryptosystems Based on Permutation Polynomials

V. Varadharajan*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)


This paper investigates the role of permutation polynomials in the design of public key cryptosystems and public key distribution systems. Several permutation polynomials for which the computation of the inverse is easy are examined and their suitability to constructing secure public key systems are discussed. A method of designing highly secure public key systems using permutation polynomials under the law of composition is also considered.

Original languageEnglish
Pages (from-to)237-250
Number of pages14
JournalInternational Journal of Computer Mathematics
Issue number3-4
Publication statusPublished - 1988
Externally publishedYes


  • computation in finite fields
  • cryptography
  • data encryption
  • Dlckson polynomials
  • factorization
  • permutation polynomials
  • prime numbers
  • privacy
  • Public key cryptosystems
  • public key distribution
  • Riidei functions
  • security
  • trapdoor systems


Dive into the research topics of 'Cryptosystems Based on Permutation Polynomials'. Together they form a unique fingerprint.

Cite this