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. For security protocols of the application layer level in the OSI model, the methods described in this paper are useful.

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

Date: received 24 Aug 2016, last revised 15 Jul 2019

Contact author: ravi at gvpce ac in

Available format(s): PDF | BibTeX Citation

Note: This article is distributed as e-print on arXive server maintained by Carnell University Library

Version: 20190715:125148 (All versions of this report)

Short URL: ia.cr/2016/821


[ Cryptology ePrint archive ]