Design Issues of Multivariate Quadratic Public Key Cryptosystems
Date Issued
2008
Date
2008
Author(s)
Hu, Yuh-Hua
Abstract
Many public key cryptosystems are based on univariate polynomials with low degree but the inverse of the polynomials are high degree polynomials. Thus it is time consuming to compute the inverse of the polynomials. Multivariate Quadratic Public Key Cryptosystem (MQPKC) can overcome this problem.he first MQPKC was proposed by Fell and Diffie [33]. Until now, there have been dozens of MQPKCs proposed. However most of them were broken. How to design a secure and practical MQPKC is still unknown. In order to study how to design a MQPKC, we survey the multivariate public key cryptosystems and the attacks against these cryptosystems. By studying the two algorithms for equations solving, we develop a more efficient algorithm for equations solving. Moreover, this algorithm can be used for examining the possible defects of MQPKCs.e also propose the attack against Multi-Sets UOV, e.g. TRMS, TTS, and Rainbow, and study the more efficient algorithm, XFLT , for solving the quadratic equations. Consequently, the minimum numbers of equations and variables for the security level 280 are 30 over GF(256) and 34 over GF(16).inally we deduce and study criteria for building MQPKCs such that the new MQPKCs are examined systematically and are not attacked by the previous methods.
Subjects
multivariate quadratic
cryptosystem signature
Multi-Sets
UOV
Type
thesis
File(s)![Thumbnail Image]()
Loading...
Name
ntu-97-D92922015-1.pdf
Size
23.32 KB
Format
Adobe PDF
Checksum
(MD5):001e5b97fea8175269de5c65458543eb