Paper Info
Title
A Method For Counting The Number Of Polynomial Equivalence Classes
Abstract
As one of the most fundamental problems in multivariate public key cryptosystems (MPKC), Isomorphism of Polynomial (IP) induces an equivalence relation on the polynomials systems. The enumeration problem associated to IP consists of counting the number of equivalence classes and the cardinality of each class. The two problems correspond exactly to the study of the total number of different cryptographic schemes and the size of "equivalent keys". In this paper we give an algorithm using a divide-and-conquer method to count the number of equivalence classes according to the linear equivalence relation induced by the IP1S problem when char(F-q) = 2. Then by giving the complexity gain of this algorithm compared with the exhaustive search algorithm and the experimental results, we show the high efficiency of this new algorithm.
Year
DOI
Venue
2013
10.1515/jmc-2012-0017
JOURNAL OF MATHEMATICAL CRYPTOLOGY
Keywords
DocType
Volume
Enumerative problem, isomorphism of polynomials, equivalence class, multivariate public key cryptosystem
Journal
7
Issue
ISSN
Citations 
1
1862-2976
0
PageRank 
References 
Authors
0.34
0
2
Name
Order
Citations
PageRank
Tianze Wang1152.55
Dongdai Lin276298.54