Cryptology ePrint Archive: Report 2009/587

Poly-Dragon: An efficient Multivariate Public Key Cryptosystem

Rajesh P. Singh, A. Saikia and B.K. Sarma

Abstract: In this paper we propose an efficient multivariate public key cryptosystem. Public key of our cryptosystem contains polynomials of total degree three in plaintext and ciphertext variables, two in plaintext variables and one in ciphertext variables. However, it is possible to reduce the public key size by writing it as two sets of quadratic multivariate polynomials. The complexity of encryption in our public key cryptosystem is $O(n^{3})$, where $n$ is bit size, which is equivalent to other multivariate public key cryptosystems. For decryption we need only four exponentiations in the binary field. Our Public key algorithm is bijective and can be used for encryption as well as for signatures.

Category / Keywords: public-key cryptography / Multivariate Cryptography, Little Dragon Cryptosystem, Big-Dragon Cryptosystem.

Date: received 1 Dec 2009

Contact author: r pratap at iitg ernet in

Available format(s): PDF | BibTeX Citation

Version: 20091204:080608 (All versions of this report)

Short URL: ia.cr/2009/587

Discussion forum: Show discussion | Start new discussion