1. Sakai, K. and Sato, Y., Boolean Gröbner Bases, ICOT Tech. Memorandum 448, 1988. Sakai, K., Sato, Y., and Menju, S., Boolean Gröbner Bases (Revised), ICOT Tech. Report 613, 1991. http://www.icot.or.jp/ARCHIVE/Museum/TRTM/tr-list-E.html .
2. Faugère, J.-C. and Joux, A., Algebraic Cryptanalysis of Hidden Field Equations (HFE) Using Gröbner Bases, Lecture Notes in Computer Science, Springer, 2003, vol. 2729, pp. 44–60.
3. Faugère, J.-C., Gianni, P., Lazard, D., and Mora, T., Efficient Computation of Zero-Dimensional Gröbner Bases by Change of Ordering, J. Symbol. Computations, 1993, vol. 16, no. 4, pp. 329–344.
4. von zur Ghaten, J. and Gerhard, J., Modern Computer Algebra, Cambridge: Cambridge Univ. Press, 2003, 2nd edition.
5. Chistov, A.L., Two Times Exponential Lower Bound on the Degree of System of Generators for a Polynomial Prime Ideal, Algebra I Analiz, 2008, vol. 20, no. 6, pp. 186–213.