Permutation polynomials and a new public-key encryption

Abstract

In this paper a new public key encryption system based on permutation polynomials is developed. The permutation polynomial P(x) is declared to be a public polynomial for encryption. A public key encryption of given m(x) is the evaluation of polynomial P(x) at point m(x) where the result of evaluation is calculated via so called White box reduction, which does not reveal the underlying secret polynomial g(x). It is shown that for the new system to achieve a comparable security with conventional public key systems based on either Discrete logarithm or Integer factorization problems, substantially less processing length n is required resulting in a significant acceleration of public key operations.