Multivariate Cryptography with Mappings of Discrete Logarithms and Polynomials
This provides a general-purpose utility for encryption and digital signatures, but appears incremental as it builds on existing multivariate cryptography approaches.
The paper tackles the problem of secure data encryption and digital signatures by developing multivariate public key cryptography algorithms based on polynomial or exponential mappings, with security relying on the difficulty of solving systems of multivariate equations.
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.