Welcome to the resource topic for
**2009/208**

**Title:**

PUBLIC KEY CRYPTOGRAPHY USING PERMUTATION P-POLYNOMIALS OVER FINITE FIELDS

**Authors:**
Rajesh P Singh, B. K. Sarma, A. Saikia

**Abstract:**

In this paper we propose an efficient multivariate public key cryptosystem based on permutation p-polynomials over finite fields. We first characterize a class of permutation p-polynomials over finite fields F_{q^{m}} and then construct a trapdoor function using this class of permutation p-polynomials. The complexity of encryption in our public key cryptosystem is O(m^{3}) multiplication which is equivalent to other multivariate public key cryptosystems. However the decryption is much faster than other multivariate public key cryptosystems. In decryption we need O(m^{2}) left cyclic shifts and O(m^{2}) xor operations.

**ePrint:**
https://eprint.iacr.org/2009/208

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

**Example resources include:**
implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .