Role of involutive criteria in computing Boolean Gröbner bases-Reference-Cited by-同舟云学术

Role of involutive criteria in computing Boolean Gröbner bases

Published:2009-03 Issue:2 Volume:35 Page:90-97
ISSN:0361-7688
Container-title:Programming and Computer Software
language:en
Short-container-title:Program Comput Soft

Author:

Gerdt V. P.,Zinin M. V.

Publisher

Pleiades Publishing Ltd

Subject

Software

Link

http://link.springer.com/content/pdf/10.1134/S0361768809020042.pdf

Reference19 articles.

1. Faugère, J.-C. and Joux, A., Algebraic Cryptanalysis of Hidden Field Equations (HFE) Using Gröbner Bases, LNCS, Springer, 2003, vol. 2729, pp. 44–60.

2. Faugère, J.-C., A New Efficient Algorithm for Computing Gröbner Bases without Reduction to Zero ( % MathType!MTEF!2!1!+- % feaafiart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn % hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr % 4rNCHbGeaGqiVu0Je9sqqrpepC0xbbL8F4rqqrFfpeea0xe9Lq-Jc9 % vqaqpepm0xbba9pwe9Q8fs0-yqaqpepae9pg0FirpepeKkFr0xfr-x % fr-xb9adbaqaaeGaciGaaiaabeqaamaabaabaaGcbaWefv3ySLgznf % gDOjdaryqr1ngBPrginfgDObcv39gaiuaacqWFfcVraaa!41D0! $$ \mathbb{F} $$ 5), Proc. of ISSAC 2002, New York: ACM, 2002, pp. 75–83.

3. http://magma.maths.usyd.edu.au/users/allan/gb/ .

4. Faugère, J.-C., A New Efficient Algorithm for Computing Gröbner Bases ( % MathType!MTEF!2!1!+- % feaafiart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn % hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr % 4rNCHbGeaGqiVu0Je9sqqrpepC0xbbL8F4rqqrFfpeea0xe9Lq-Jc9 % vqaqpepm0xbba9pwe9Q8fs0-yqaqpepae9pg0FirpepeKkFr0xfr-x % fr-xb9adbaqaaeGaciGaaiaabeqaamaabaabaaGcbaWefv3ySLgznf % gDOjdaryqr1ngBPrginfgDObcv39gaiuaacqWFfcVraaa!41D0! $$ \mathbb{F} $$ 4), Pure Applied Algebra, 1999, vol. 139, nos. 1–3, pp. 61–68.

5. Bardet, M., Faugère, J.-C., and Salvy, B., Complexity of Gröbner Basis Computation for Semi-regular Overdetermined Sequences over % MathType!MTEF!2!1!+- % feaafiart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn % hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr % 4rNCHbGeaGqiVu0Je9sqqrpepC0xbbL8F4rqqrFfpeea0xe9Lq-Jc9 % vqaqpepm0xbba9pwe9Q8fs0-yqaqpepae9pg0FirpepeKkFr0xfr-x % fr-xb9adbaqaaeGaciGaaiaabeqaamaabaabaaGcbaWefv3ySLgznf % gDOjdaryqr1ngBPrginfgDObcv39gaiuaacqWFfcVraaa!41D0! $$ \mathbb{F} $$ 2 with solutions in % MathType!MTEF!2!1!+- % feaafiart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn % hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr % 4rNCHbGeaGqiVu0Je9sqqrpepC0xbbL8F4rqqrFfpeea0xe9Lq-Jc9 % vqaqpepm0xbba9pwe9Q8fs0-yqaqpepae9pg0FirpepeKkFr0xfr-x % fr-xb9adbaqaaeGaciGaaiaabeqaamaabaabaaGcbaWefv3ySLgznf % gDOjdaryqr1ngBPrginfgDObcv39gaiuaacqWFfcVraaa!41D0! $$ \mathbb{F} $$ 2, INRIA report RR-5049, 2003.