Multivariate Encryption Schemes Based on the Constrained MQ Problem
Multivariate Encryption Schemes Based on the Constrained MQ Problem
复制标题
DOI：
10.1007/978-3-030-01446-9_8
复制
发表时间：
2018-10
期刊：
影响因子：
--
通讯作者：
T. Yasuda
中科院分区：
文献类型：
--
作者：
T. Yasuda
MQ问题本质上是数学问题，与多变量公钥密码（MPKC）的安全性有关。本文介绍了约束MQ问题，它是由MQ问题衍生出来的一个新的数学问题。我们还提出了一种MPKC中的加密方案构造方法--pq-方法，其安全性主要基于求解受限MQ问题的难度。我们分析了求解约束MQ问题的困难程度，包括与通常求解MQ问题的不同方法。在分析约束MQ问题的基础上，给出了pq方法的安全参数，并实现了实用方案。
The MQ problem is mathematical in nature and is related to the security of Multivariate Public Key Cryptography (MPKC). In this paper, we introducethe constrained MQ problem, which is a new mathematical problem derived from the MQ problem. We also propose an encryption scheme construction method in MPKC, thepq-method, whose security is mainly based on the difficulty of solving the constrained MQ problem. We analyze the difficulty level of solving the constrained MQ problem, including different approach from the usual for solving the MQ problem. Furthermore, based on the analysis of the constrained MQ problem, we present secure parameters for thepq-method, and implement the practical schemes.