Cryptology ePrint Archive: Report 2016/821

Multivariate Cryptography with Mappings of Discrete Logarithms and Polynomials

Duggirala Meher Krishna and Duggirala Ravi

Abstract: In this paper, algorithms for multivariate public key cryptography and digital signature are described. Plain messages and encrypted messages are arrays, consisting of elements from a fixed finite ring or field. The encryption and decryption algorithms are based on multivariate mappings. The security of the private key depends on the difficulty of solving a system of parametric simultaneous multivariate equations involving polynomial or exponential mappings. The method is a general purpose utility for most data encryption, digital certificate or digital signature applications.

Category / Keywords: Public key cryptography and digital signature; Digital certificates; Multivariate analysis

Date: received 24 Aug 2016, last revised 22 Sep 2018

Contact author: ravi at gvpce ac in

Available format(s): PDF | BibTeX Citation

Note: This article is (1) distributed as e-print on arXive server maintained by Carnell University Library, and (1) under review at Journal of Mathematical Cryptology with manuscript ID JMC.2016.0047

Version: 20180922:155135 (All versions of this report)

Short URL:

[ Cryptology ePrint archive ]