eprint.iacr.org will be offline for approximately an hour
for routine maintenance at 11pm UTC on Tuesday, April 16. We lost some data between
April 12 and April 14, and some authors have been notified that they need to resubmit their papers.
You are looking at a specific version 20010607:112546 of this paper.
See the latest version.
Paper 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.
Metadata
- Available format(s)
- PS
- Category
- Public-key cryptography
- Publication info
- Published elsewhere. Not published yet
- Keywords
- XL cryptanalysis multivariate
- Contact author(s)
- ttm @ math purdue edu
- History
- 2001-06-07: received
- Short URL
- https://ia.cr/2001/047
- License
-
CC BY
