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

	Graph-coloring ideals Nullstellensatz certificates, Gröbner bases for chordal graphs, and hardness of Gröbner bases David Rolnick DocID: 1r7Hx - 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
	RANDPOLY: A Random Polynomial Generator Francis J. Wright School of Mathematical Sciences Queen Mary and Westfield College University of London Mile End Road, London E1 4NS, UK. DocID: 1osMX - View Document
	Solving efficiently structured polynomial systems and Applications in Cryptology Jean-Charles Faugère Joint work with: L. Huot DocID: 1nzIp - View Document
	Radboud University Automatic Geometric Theorem Proving using Gr¨obner Bases Bachelor’s Thesis Mathematics DocID: 1kJR9 - View Document