Poly-Dragon: an efficient multivariate public key cryptosystem

Journal of mathematical cryptology

article

Rajesh P. Singh¹  A. Saikia¹  B. K. Sarma¹ 

[1] Department of Mathematics, Indian Institute of Technology Guwahati

关键词: Permutation polynomial;    multivariate cryptography;    Little Dragon and Big Dragon cryptosystems;   

DOI  :  10.1515/jmc.2011.002

学科分类：社会科学、人文和艺术（综合）

来源: De Gruyter

【 摘 要 】

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.

【 授权许可】

CC BY|CC BY-NC-ND