Cryptology ePrint Archive: Report 2001/047

ON THE METHOD OF "XL" AND ITS INEFFICIENCY TO TTM

T.MOH

Abstract: We will show that the paper "Efficient Algorithm for solving over- defined systems of multivariate polynomials equations" published in Eurocrypt 2000 by N. Courtois, A. Shamir, J. Patarin and A.Klimov ignors the intersection property at infinity of the system and the program proposed by them can not achieve their desired results. In fact, we produce very simple example to show that in some cases, their program always fails.

Category / Keywords: public-key cryptography / XL cryptanalysis multivariate

Publication Info: Not published yet

Date: received 6 Jun 2001

Contact author: ttm at math purdue edu

Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | BibTeX Citation

Version: 20010607:112546 (All versions of this report)

Short URL: ia.cr/2001/047

Discussion forum: Show discussion | Start new discussion