Solving efficiently structured polynomial systems and Applications in Cryptology Jean-Charles Faugère Joint work with: L. Huot

First Page		Document Content
Date: 2011-09-30 12:40:03 Computer algebra Algebraic geometry Polynomials Algebra Commutative algebra Grbner basis Monomial order System of polynomial equations Resultant Monomial Lexicographical order Jean-Charles Faugre		Solving efficiently structured polynomial systems and Applications in Cryptology Jean-Charles Faugère Joint work with: L. Huot Add to Reading List Source URL: ecc2011.loria.fr Download Document from Source Website File Size: 1,67 MB Share Document on Facebook

	MIMS Technical Report No) On finite generation of symbolic Rees rings of space monomial curves in characteristic positive –existence of negative curves in characteristic zero– Kazuhiko Kurano and Na DocID: 1s26B - View Document
	Graph-coloring ideals Nullstellensatz certificates, Gröbner bases for chordal graphs, and hardness of Gröbner bases David Rolnick DocID: 1r7Hx - View Document
	Computation of the (n-1)-st Koszul Homology of Monomial Ideals and Related Algorithms Anna M. Bigatti ´ ´ DocID: 1qvWN - View Document
	GROEBNER: A Package for Calculating Gr¨obner Bases, Version 3.0 H. Melenk & W. Neun Konrad–Zuse–Zentrum f¨ ur Informationstechnik Berlin DocID: 1pPiY - View Document