Date Added: Dec 2009
In this paper the authors propose an efficient multivariate public key cryptosystem. Public key of the 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 the public key cryptosystem is O(n3), where n is bit size, which is equivalent to other multivariate public key cryptosystems. For decryption they need only four exponentiations in the binary field. The Public key algorithm is objective and can be used for encryption as well as for signatures.