Multivariate Cryptography with Mappings of Discrete Logarithms and Polynomials
Cryptography and Security
2018-09-25 v8
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.
Cite
@article{arxiv.1608.06472,
title = {Multivariate Cryptography with Mappings of Discrete Logarithms and Polynomials},
author = {Duggirala Meher Krishna and Duggirala Ravi},
journal= {arXiv preprint arXiv:1608.06472},
year = {2018}
}