A time-memory tradeoff in Faugère''s algorithm for computing Gröbner bases
碩士 === 國立臺灣大學 === 數學研究所 === 98 === Solving multivariate systems of polynomial equations is an important problem both as a subroutine in algebraic cryptanalysis and in its own right. Currently, the most efficient solvers are the Gröbner-basis solvers, which include the XL algorithm, as well as Faugèr...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2010
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/57104162310089008559 |