Practical complexities of probabilistic algorithms for solving Boolean polynomial systems

2022 ◽  
Vol 309 ◽  
pp. 13-31
Author(s):  
Stefano Barbero ◽  
Emanuele Bellini ◽  
Carlo Sanna ◽  
Javier Verbel
2019 ◽  
Vol 16 (2) ◽  
pp. 1
Author(s):  
Shamsatun Nahar Ahmad ◽  
Nor’Aini Aris ◽  
Azlina Jumadi

Concepts from algebraic geometry such as cones and fans are related to toric varieties and can be applied to determine the convex polytopes and homogeneous coordinate rings of multivariate polynomial systems. The homogeneous coordinates of a system in its projective vector space can be associated with the entries of the resultant matrix of the system under consideration. This paper presents some conditions for the homogeneous coordinates of a certain system of bivariate polynomials through the construction and implementation of the Sylvester-Bèzout hybrid resultant matrix formulation. This basis of the implementation of the Bèzout block applies a combinatorial approach on a set of linear inequalities, named 5-rule. The inequalities involved the set of exponent vectors of the monomials of the system and the entries of the matrix are determined from the coefficients of facets variable known as brackets. The approach can determine the homogeneous coordinates of the given system and the entries of the Bèzout block. Conditions for determining the homogeneous coordinates are also given and proven.


2010 ◽  
Vol 43 (3/4) ◽  
pp. 77-78
Author(s):  
C. Bertone ◽  
G. Chéze ◽  
A. Galligo

2019 ◽  
Vol 13 (3-4) ◽  
pp. 229-237
Author(s):  
Stavros Kousidis ◽  
Andreas Wiemers

Abstract We improve on the first fall degree bound of polynomial systems that arise from a Weil descent along Semaev’s summation polynomials relevant to the solution of the Elliptic Curve Discrete Logarithm Problem via Gröbner basis algorithms.


Sign in / Sign up

Export Citation Format

Share Document