Cryptosystems based on permutation polynomials

Abstract

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.

Keywords:

• Public key cryptosystems
• public key distribution
• security
• privacy
• cryptography
• data encryption
• trapdoor systems
• factorization
• permutation polynomials
• computation in finite fields
• prime numbers
• Dickson polynomials
• Rédei functions

C.R. Categories:

• C.2.0.
• D.4.6.
• E.3.
• F.2.1.
• I.1.2.