On enumeration of polynomial equivalence classes and their application to MPKC

详细信息    查看全文

• 作者：Dongdai Lin^a ; ^{d_d_lin@yahoo.com.cn} ; Jean-Charles Faug&egrave ; re^b ; ^c ; Ludovic Perret^b ; ^c ; Tianze Wang^a ; ^d
• 关键词：94A60 ; 05B25 ; 11T55 ; 14G50 ; 11T71
• 刊名：Finite Fields and Their Applications
• 出版年：2012
• 出版时间：March 2012
• 年：2012
• 卷：18
• 期：2
• 页码：283-302
• 全文大小：245 K

文摘

The Isomorphism of Polynomials (IP) is one of the most fundamental problems in multivariate public key cryptography (MPKC). In this paper, we introduce a new framework to study the counting problem associated to IP. Namely, we present tools of finite geometry allowing to investigate the counting problem associated to IP. Precisely, we focus on enumerating or estimating the number of isomorphism equivalence classes of homogeneous quadratic polynomial systems. These problems are equivalent to finding the scale of the key space of a multivariate cryptosystem and the total number of different multivariate cryptographic schemes respectively, which might impact the security and the potential capability of MPKC. We also consider their applications in the analysis of a specific multivariate public key cryptosystem. Our results not only answer how many cryptographic schemes can be derived from monomials and how big the key space is for a fixed scheme, but also show that quite many HFE cryptosystems are equivalent to a Matsumoto-Imai scheme.