Paper 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.

Metadata
Available format(s)
PDF
Category
Public-key cryptography
Publication info
Published elsewhere. Unknown where it was published
Keywords
Multivariate CryptographyLittle Dragon CryptosystemBig-Dragon Cryptosystem.
Contact author(s)
r pratap @ iitg ernet in
History
2009-12-04: received
Short URL
https://ia.cr/2009/587
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2009/587,
      author = {Rajesh P.  Singh and A.  Saikia and B. K.  Sarma},
      title = {Poly-Dragon: An efficient Multivariate Public Key Cryptosystem},
      howpublished = {Cryptology ePrint Archive, Paper 2009/587},
      year = {2009},
      note = {\url{https://eprint.iacr.org/2009/587}},
      url = {https://eprint.iacr.org/2009/587}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.