Today, with the advent of internet technology, we are looking for e-mechanisms such as e-voting, e-commerce, e-learning, etc., where electronic information are transferred between the entities via the public network. However, e-mechanisms require the support of integrity, authenticity and non-repudiability of the transmitted electronic information. The digital signature is a technique that allows users to attain these parameters during the transmission of information via the public channel. The existing number-theoretic assumption based digital signature schemes is vulnerable to quantum attacks due to the development in a quantum computer. Thus, there is a necessity of quantum computer resistant digital signature scheme, i.e., post-quantum digital signature. Multivariate Public Key Cryptography (MPKC) is one of the most promising candidates of post-quantum cryptography as the MPKC based constructions are computationally fast and need only modest computational resources. In the literature, there are few multivariate digital signature schemes based on Multivariate Quadratic (MQ) problem. However, the design of efficient constructions of digital signature schemes based on higher degree ( > 2) multivariate polynomials is still an open problem. Generally, the question relating to the multivariate polynomials of degree > 2 is expected to be equally or harder than the quadratic one. In this paper, we have designed a digital signature framework based on Multivariate Cubic (MC) problem to address the issue. The signature size in our scheme is less than all the existing MPKC based signature schemes under the same security assumptions.

如今，随着互联网技术的出现，我们正在寻找电子机制，例如电子投票，电子商务，电子学习等，其中电子信息通过公共网络在实体之间传输。但是，电子机制需要所传输的电子信息的完整性，真实性和不可否认性的支持。数字签名是一种技术，它允许用户在通过公共信道传输信息期间获得这些参数。由于量子计算机的发展，现有的基于数论假设的数字签名方案容易受到量子攻击。因此，需要量子计算机抗数字签名方案，即后量子数字签名。多元公钥密码术（MPKC）是后量子密码学最有前途的候选者之一，因为基于MPKC的构造计算速度很快，仅需要适度的计算资源。在文献中，很少有基于多元二次方（MQ）问题的多元数字签名方案。但是，基于较高阶（> 2）多元多项式的数字签名方案的有效构造设计仍然是一个未解决的问题。通常，期望与次数> 2的多元多项式有关的问题与二次多项式相等或更难。在本文中，我们设计了一个基于 基于多元二次方（MQ）问题的多元数字签名方案很少。但是，基于较高阶（> 2）多元多项式的数字签名方案的有效构造设计仍然是一个未解决的问题。通常，期望与次数> 2的多元多项式有关的问题与二次多项式相等或更难。在本文中，我们设计了一个基于 基于多元二次方（MQ）问题的多元数字签名方案很少。但是，基于较高阶（> 2）多元多项式的数字签名方案的有效构造设计仍然是一个未解决的问题。通常，期望与次数> 2的多元多项式有关的问题与二次多项式相等或更难。在本文中，我们设计了一个基于 2应该比二次方相等或更难。在本文中，我们设计了一个基于 2应该比二次方相等或更难。在本文中，我们设计了一个基于多变量三次（MC）问题可解决该问题。在相同的安全性假设下，我们方案中的签名大小小于所有现有的基于MPKC的签名方案。