zbMATH — the first resource for mathematics

Multivariate encryption schemes based on the constrained MQ problem. (English) Zbl 1421.94081
Baek, Joonsang (ed.) et al., Provable security. 12th international conference, ProvSec 2018, Jeju, South Korea, October 25–28, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11192, 129-146 (2018).
Summary: The MQ problem is mathematical in nature and is related to the security of multivariate public key cryptography (MPKC). In this paper, we introduce the constrained MQ problem, which is a new mathematical problem derived from the MQ problem. We also propose an encryption scheme construction method in MPKC, the \(pq\)-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 the \(pq\)-method, and implement the practical schemes.
For the entire collection see [Zbl 1398.94007].
94A60 Cryptography
Full Text: DOI