Multivariate Cryptography with Mappings of Discrete Logarithms and Polynomials

2016/08/23 by Duggirala Meher Krishna, Krishna, Duggirala Meher, Duggirala Ravi +1
Computer Science · #Chaos-based Image/Signal Encryption #Coding theory and cryptography #Cryptography and Security (cs.CR) #FOS: Computer and information sciences #Polynomial and algebraic computation

paper · pdf · doi:10.48550/arxiv.1608.06472

openalex publication_date 2016/08/23 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Citations

• Elliptic curve cryptosystems

Related

• Multivariate Public Key Cryptography and Digital Signature
• Constructing Cryptographic Multilinear Maps Using Affine Automorphisms
• A New Primitive for a Diffie-Hellman-like Key Exchange Protocol Based on Multivariate Ore Polynomials
• The complexity of solving a random polynomial system
• A Somewhat Homomorphic Encryption Scheme based on Multivariate Polynomial Evaluation