How to solve a multivariate quadratic polynomial equation system is believed to be one of the key points to beark AES. But to solve the MQE problem is NP-hard, so it's very important to develop a good algorithm to solve it. In such a situation, the XL algorithm is claimed to be the method to solve the MQE problem, and the cryptographers pay a lot of attetion to it. But the XL algorithm works only when the equation system is overdefined, for this reason cryptographers are looking for some ways, such as BES, to increase the numbers of equations. In practice we know that the process of solving MQE, the system will extend very fast, therefore if we input too many equations and variates, we usually using out of memory before finding out the solution. In the paper we use multiple plaintext-ciphertext to increase the number of equations and try to do some pre-computing work to reduce the size of a problem, and make it work better in pratice.
| Identifer | oai:union.ndltd.org:NSYSU/oai:NSYSU:etd-0828106-155008 |
| Date | 28 August 2006 |
| Creators | Chen, Ching-kuo |
| Contributors | Jiun-Ming Chen, D.J. Guan, Chun-Hung Lin, Chun-I Fan |
| Publisher | NSYSU |
| Source Sets | NSYSU Electronic Thesis and Dissertation Archive |
| Language | Cholon |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0828106-155008 |
| Rights | not_available, Copyright information available at source archive |
Page generated in 0.0024 seconds