Multivariate Cryptography with Mappings of Discrete Logarithms and Polynomials

TL;DR

This paper introduces multivariate cryptographic algorithms utilizing mappings of discrete logarithms and polynomials, providing a versatile approach for encryption and digital signatures based on solving complex multivariate equations.

Contribution

It presents new multivariate cryptography algorithms based on polynomial and exponential mappings, enhancing security and utility for various data encryption and signature applications.

Findings

Algorithms based on multivariate mappings are effective for encryption and signatures.

Security relies on the difficulty of solving parametric multivariate equations.

The method is adaptable for general data security applications.

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.