Cryptology ePrint Archive: Report 2011/055

On Enumeration of Polynomial Equivalence Classes and Their Application to MPKC

Dongdai Lin and Jean-Charles Faugere and Ludovic Perret and Tianze Wang

Abstract: 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.

Category / Keywords: public-key cryptography / multivariate public key cryptography, polynomial isomorphism, finite geometry, equivalence classes, superfluous keys

Date: received 30 Jan 2011

Contact author: d_d_lin at yahoo com cn

Available format(s): PDF | BibTeX Citation

Version: 20110130:160756 (All versions of this report)

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]