Singh, Rajesh P.; Saikia, A.; Sarma, B. K. Poly-dragon: an efficient multivariate public key cryptosystem. (English) Zbl 1235.94051 J. Math. Cryptol. 4, No. 4, 349-364 (2010). Summary: 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. Cited in 1 ReviewCited in 4 Documents MSC: 94A60 Cryptography 11T71 Algebraic coding theory; cryptography (number-theoretic aspects) 11T06 Polynomials over finite fields Keywords:permutation polynomial; multivariate cryptography; little dragon and big dragon cryptosystems Software:FGb; FLASH PDFBibTeX XMLCite \textit{R. P. Singh} et al., J. Math. Cryptol. 4, No. 4, 349--364 (2010; Zbl 1235.94051) Full Text: DOI References: [1] DOI: 10.1007/3-540-45539-6_27 · doi:10.1007/3-540-45539-6_27 [2] DOI: 10.1007/3-540-36563-X_10 · doi:10.1007/3-540-36563-X_10 [3] DOI: 10.1109/TSP.2006.877670 · Zbl 1373.94934 · doi:10.1109/TSP.2006.877670 [4] DOI: 10.1007/978-3-540-74143-5_1 · Zbl 1215.94043 · doi:10.1007/978-3-540-74143-5_1 [5] DOI: 10.1016/S0022-4049(99)00005-5 · Zbl 0930.68174 · doi:10.1016/S0022-4049(99)00005-5 [6] DOI: 10.1007/978-3-540-45146-4_3 · doi:10.1007/978-3-540-45146-4_3 [7] DOI: 10.1007/11426639_20 · Zbl 1137.94344 · doi:10.1007/11426639_20 [8] DOI: 10.1007/3-540-48405-1_2 · doi:10.1007/3-540-48405-1_2 [9] DOI: 10.1007/3-540-45961-8_39 · doi:10.1007/3-540-45961-8_39 [10] DOI: 10.1007/3-540-44750-4_20 · doi:10.1007/3-540-44750-4_20 [11] DOI: 10.1007/3-540-68339-9_4 · Zbl 1301.94125 · doi:10.1007/3-540-68339-9_4 [12] DOI: 10.1007/3-540-68697-5_4 · Zbl 1329.94075 · doi:10.1007/3-540-68697-5_4 [13] Patarin J., Lecture Notes in Computer Science pp 298– (2020) [14] DOI: 10.1137/S0097539795293172 · Zbl 1005.11065 · doi:10.1137/S0097539795293172 [15] DOI: 10.1007/11605805_9 · doi:10.1007/11605805_9 This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.