Paper 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.

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

Metadata
Available format(s)
PDF
Publication info
Preprint.
Keywords
Digital certificatesMultivariate analysis
Contact author(s)
ravi @ gvpce ac in
History
2019-07-15: last of 7 revisions
2016-08-28: received
See all versions
Short URL
https://ia.cr/2016/821
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2016/821,
      author = {Duggirala Meher Krishna and Duggirala Ravi},
      title = {Multivariate Cryptography with Mappings of Discrete Logarithms and Polynomials},
      howpublished = {Cryptology ePrint Archive, Paper 2016/821},
      year = {2016},
      note = {\url{https://eprint.iacr.org/2016/821}},
      url = {https://eprint.iacr.org/2016/821}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.