Multivariate Polynomial System Solving Using Intersections of Eigenspaces
نویسندگان
چکیده
منابع مشابه
Solving multivariate polynomial systems using hyperplane arithmetic and linear programming
Solving polynomial systems of equations is an important problem in many fields such as computer-aided design and manufacturing [1] and robotics [2]. In recent years, subdivision-based solvers, which typically make use of the properties of the Bézier / B-spline representation, have proven successful in solving such systems of polynomial constraints [3, 4, 5]. A major drawback in using subdivisio...
متن کاملMutantXL: Solving Multivariate Polynomial Equations for Cryptanalysis
MutantXL is an algorithm for solving systems of polynomial equations that was proposed at SCC 2008 and improved in PQC 2008. This article gives an overview over the MutantXL algorithm. It also presents experimental results comparing the behavior of the MutantXL algorithm to the F4 algorithm on HFE and randomly generated multivariate systems. In both cases MutantXL is faster and uses less memory...
متن کاملEfficient Algorithms for Solving Overdefined Systems of Multivariate Polynomial Equations
The security of many recently proposed cryptosystems is based on the difficulty of solving large systems of quadratic multivariate polynomial equations. This problem is NP-hard over any field. When the number of equations m is the same as the number of unknowns n the best known algorithms are exhaustive search for small fields, and a Gröbner base algorithm for large fields. Gröbner base algorit...
متن کاملMatrix Eigenproblem Approach for A Class of Positive Dimensional Multivariate Polynomial System Solving
The matrix eigenproblem approach for zero-dimensional multivariate polynomial system solving has been studied. The purpose of this paper is to apply the approach to a class of positive dimensional multivariate polynomial system which is called pseudo zero-dimensional system. In this case we can decide its reducibility, and when it is reducible, a set of polynomial can be determined from the eig...
متن کاملSolving Multivariate Polynomial Systems and an Invariant from Commutative Algebra
The security of several post-quantum cryptosystems is based on the assumption that solving a system of multivariate (quadratic) polynomial equations p1 = · · · = pm = 0 over a finite field is hard. Such a system can be solved by computing a lexicographic Gröbner basis of the ideal (p1, . . . , pm). The most efficient algorithms for computing Gröbner bases, such as F4 and F5, transform the probl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 2001
ISSN: 0747-7171
DOI: 10.1006/jsco.2001.0476