Minimal basis of the syzygies module of leading terms
Systems of polynomial equations are one of the most universal mathematical objects. Almost all the problems of cryptographic analysis can be reduced to finding solutions to systems of polynomial equations. The corresponding direction of research is called algebraic cryptanalysis. In terms of computa...
Main Author: | A. V. Sokurov |
---|---|
Format: | Article |
Language: | English |
Published: |
Ivannikov Institute for System Programming of the Russian Academy of Sciences
2019-02-01
|
Series: | Труды Института системного программирования РАН |
Subjects: | |
Online Access: | https://ispranproceedings.elpub.ru/jour/article/view/1133 |
Similar Items
-
On Solving The Systems of Algebraic Equations Using Gröbner Bases
by: Alexander Shokurov
Published: (2018-10-01) -
Comparing complexities of problems of determining of Grebner’s basis of ideal and solving this ideal
by: A. V. Shokurov
Published: (2018-10-01) -
ROOT-FINDING ALGORITHM FOR UNIVARIATE POLYNOMIALS WITH COEFFICIENTS FROM K[X,Y]
by: A.E. MAEVSKIY
Published: (2018-08-01) -
ROOT-FINDING ALGORITHM FOR UNIVARIATE POLYNOMIALS WITH COEFFICIENTS FROM K[X,Y]
by: A.E. MAEVSKIY
Published: (2007-09-01) -
THE INVESTIGATION OF ROTOR’S INFLOW AND MAIN ROTOR’S INDUCED VELOCITY AT HOVER AND AT STEEP DESCENTS
by: V. S. Krimskiy, et al.
Published: (2016-11-01)