Paper 2009/208

PUBLIC KEY CRYPTOGRAPHY USING PERMUTATION P-POLYNOMIALS OVER FINITE FIELDS

Rajesh P Singh, B. K. Sarma, and 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 Fqm and then construct a trapdoor function using this class of permutation p-polynomials. The complexity of encryption in our public key cryptosystem is 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 left cyclic shifts and xor operations.

Note: Some modifications related to Latex formatting has been done.

Metadata
Available format(s)
PDF PS
Publication info
Published elsewhere. Unpublished
Keywords
Public Key CryptographyMultivariate CryptographyPermutation PolynomialsLinearized Polynomials
Contact author(s)
r pratap @ iitg ernet in
History
2009-06-24: last of 2 revisions
2009-05-26: received
See all versions
Short URL
https://ia.cr/2009/208
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2009/208,
      author = {Rajesh P Singh and B. K. Sarma and A. Saikia},
      title = {{PUBLIC} {KEY} {CRYPTOGRAPHY} {USING} {PERMUTATION} P-{POLYNOMIALS} {OVER} {FINITE} {FIELDS}},
      howpublished = {Cryptology {ePrint} Archive, Paper 2009/208},
      year = {2009},
      url = {https://eprint.iacr.org/2009/208}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.