p

POLSYS's Biblio 2007 - 2015 (last update: Jan 2015)

Journal Papers

[1] Jean-Charles Faugère, Ayoub Otmani, Ludovic Perret, Frédéric De Portzamparc, and Jean-Pierre Tillich. Structural Cryptanalysis of McEliece Schemes with Compact Keys. Designs, Codes and Cryptography, page 26, January 2015. [ bib | http | http ]
[2] Jérémy Berthomieu, Jean-Charles Faugère, and Ludovic Perret. Polynomial-Time Algorithms for Quadratic Isomorphism of Polynomials: The Regular Case. Journal of Complexity, (1-39):39, 2015. [ bib | http | Download PDF ]
[3] Magali Bardet, Jean-Charles Faugère, and Bruno Salvy. On the complexity of the F5 Gröbner basis algorithm. Journal of Symbolic Computation, pages 1-24, September 2014. [ bib | DOI | http | http ]
[4] Aurélien Greuet and Mohab Safey El Din. Probabilistic Algorithm for Polynomial Optimization over a Real Algebraic Set. SIAM Journal on Optimization, 24(3):1313-1343, August 2014. [ bib | DOI | http | http ]
[5] Bernd Bank, Marc Giusti, Joos Heintz, and Mohab Safey El Din. Intrinsic complexity estimates in polynomial optimization. Journal of Complexity, 30(4):430-443, February 2014. [ bib | DOI | http | http ]
[6] Saugata Basu, Marie-Françoise Roy, Mohab Safey El Din, and Eric Schost. A Baby Step-Giant Step Roadmap Algorithm for General Algebraic Sets. Foundations of Computational Mathematics, 14(6):1117 - 1172, 2014. [ bib | DOI | http | http ]
[7] Xiaoliang Li and Dongming Wang. Computing equilibria of semi-algebraic economies using triangular decomposition and real solution classification. Journal of Mathematical Economics, 54:48-58, 2014. [ bib | DOI | http ]
[8] Jérémy Berthomieu, Grégoire Lecerf, and Guillaume Quintin. Polynomial root finding over local rings and application to error correcting codes. Applicable Algebra in Engineering, Communication and Computing, 24(6):413-443, December 2013. [ bib | DOI | http | Download PDF ]
[9] Aurobrata Ghosh, Elias Tsigaridas, Bernard Mourrain, and Rachid Deriche. A polynomial approach for extracting the extrema of a spherical function and its application in diffusion mri. Medical Image Analysis, 17(5):503-514, July 2013. [ bib | DOI | http ]
[10] Martin Albrecht, Carlos Cid, Jean-Charles Faugère, Robert Fitzpatrick, and Ludovic Perret. On the complexity of the bkw algorithm on lwe. Designs, Codes and Cryptography, July 2013. [ bib | DOI | http | Download PDF ]
[11] Jean-Charles Faugère, Ayoub Gauthier-Umaña, Valérie Otmani, Ludovic Perret, and Jean-Pierre Tillich. A Distinguisher for High Rate McEliece Cryptosystems. IEEE Transactions on Information Theory, pages 1-22, June 2013. [ bib | DOI | http | Download PDF ]
[12] Jean-Charles Faugère, Pierrick Gaudry, Louise Huot, and Guénaël Renault. Using Symmetries in the Index Calculus for Elliptic Curves Discrete Logarithm. Journal of Cryptology, pages 1-40, May 2013. [ bib | DOI | http | Download PDF ]
[13] Jean-Charles Faugère, Mohab Safey El Din, and Pierre-Jean Spaenlehauer. On the Complexity of the Generalized MinRank Problem. Journal of Symbolic Computation, 55(0):30-58, March 2013. [ bib | DOI | http | Download PDF ]
[14] Magali Bardet, Jean-Charles Faugère, Bruno Salvy, and Pierre-Jean Spaenlehauer. On the complexity of solving quadratic boolean systems. Journal of Complexity, 29(1):53-75, February 2013. [ bib | DOI | http ]
[15] Gabriella Jeronimo, Daniel Perrucci, and Elias Tsigaridas. On the minimum of a polynomial function on a basic closed semialgebraic set and applications. SIAM Journal on Optimization, 23(1):241-255, 2013. [ bib | http | Download PDF ]
[16] Luk Bettale, Jean-Charles Faugère, and Ludovic Perret. Cryptanalysis of hfe, multi-hfe and variants for odd and even characteristic. Designs, Codes and Cryptography, 69(1):1 - 52, 2013. [ bib | DOI | http | Download PDF ]
[17] Meng Jin, Xiaoliang Li, and Dongming Wang. A new algorithmic scheme for computing characteristic sets. Journal of Symbolic Computation, 50:431-449, 2013. [ bib | DOI | http ]
[18] Ioannis Emiris, Elias Tsigaridas, and George Tzoumas. Exact voronoi diagram of smooth convex pseudo-circles: General predicates, and implementation for ellipses. Computer Aided Geometric Design, 2013. [ bib | DOI | http | Download PDF ]
[19] Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, Vladimir V. Podolskii, and Elias Tsigaridas. Patience of matrix games. Discrete Applied Mathematics, 2013. [ bib | DOI | http | Download PDF ]
[20] Jing Yang, Dongming Wang, and Hoon Hong. Improving angular speed uniformity by reparameterization. Computer Aided Geometric Design, 30(7):636-652, 2013. [ bib | DOI | http ]
[21] Hoon Hong, Dongming Wang, and Jing Yang. A framework for improving uniformity of parameterizations of curves. Science China Information Sciences, 56(10):108101:1-108101:22, 2013. [ bib | DOI | http ]
[22] Xiaoyu Chen and Dongming Wang. Formalization and specification of geometric knowledge objects. Mathematics in Computer Science, 7(4), 2013. [ bib | DOI | http ]
[23] Christian Eder. An analysis of inhomogeneous signature-based grobner basis computations. Journal of Symbolic Computation, 59:21-35, 2013. [ bib | DOI | http ]
[24] Christian Eder. Improving incremental signature-based gröbner basis algorithms. ACM Communications in Computer Algebra, 47(1):1-13, 2013. [ bib | DOI | http ]
[25] Chenqi Mou, Dongming Wang, and Xiaoliang Li. Decomposing polynomial sets into simple sets over finite fields: The positive-dimensional case. Theoretical Computer Science, page XX, November 2012. [ bib | DOI | http ]
[26] Sébastien Orange, Guénaël Renault, and Kazuhiro Yokoyama. Efficient Arithmetic in Successive Algebraic Extension Fields Using Symmetries. Mathematics in Computer Science, 6(3):217-233, September 2012. [ bib | DOI | http | Download PDF ]
[27] Claude Carlet, Jean-Charles Faugère, Christopher Goyet, and Guénaël Renault. Analysis of the Algebraic Side Channel Attack. Journal of Cryptographic Engineering, 2:45-62, May 2012. [ bib | DOI | http | Download PDF ]
[28] Jean-Charles Faugère, Dongdai Lin, Ludovic Perret, and Tianze Wang. On enumeration of polynomial equivalence classes and their application to MPKC. Finite Fields and Their Applications, 18(2):283 - 302, 2012. [ bib | DOI | http | Download PDF ]
[29] Aurélien Greuet, Feng Guo, Mohab Safey El Din, and Lihong Zhi. Global optimization of polynomials restricted to a smooth variety using sums of squares. Journal of Symbolic Computation, 47(7):503-518, 2012. [ bib | DOI | http ]
[30] Xiaoliang Li and Dongming Wang. Simple Decomposition of Polynomial Sets over Finite Fields (in Chinese). Journal of Systems Science and Mathematical Sciences, 32(1):15-26, 2012. [ bib ]
[31] Xiaoyu Chen and Dongming Wang. Management of Geometric Knowledge in Textbooks. Data and Knowledge Engineering, 73:43-57, 2012. [ bib | DOI | http ]
[32] Martin Albrecht, Carlos Cid, Jean-Charles Faugère, and Ludovic Perret. On the relation between the MXL family of algorithms and Gröbner basis algorithms. Journal of Symbolic Computation, 47:926-941, 2012. in press. [ bib | DOI | Download PDF ]
[33] Dongming Wang. Algebraic Stability Criteria and Symbolic Derivation of Stability Conditions for Feedback Control Systems. International Journal of Control, 85(10):1414-1421, 2012. In press. [ bib | DOI | http ]
[34] Meng Jin, Xiaoliang Li, and Dongming Wang. A New Algorithmic Scheme for Computing Characteristic Sets. Journal of Symbolic Computation, pages 1-26, 2012. In press. [ bib | DOI ]
[35] Wei Niu and Dongming Wang. Algebraic Analysis of Stability and Bifurcation of a Self-assembling Micelle System. Applied Mathematics and Computation, 219(1):108-121, 2012. In press. [ bib | DOI ]
[36] Hoon Hong and Mohab Safey El Din. Variant Quantifier Elimination. Journal of Symbolic Computation, 47(7):883-901, 2012. [ bib | DOI | http | Download PDF ]
[37] Elias Tsigaridas. Improved bounds for the CF algorithm. Theoretical Computer Science, pages 1-12, Oct 2012. [ bib | http | Download PDF ]
[38] Xiaoliang Li and Dongming Wang. Simple Decomposition of Polynomial Sets over Finite Fields. Journal of Systems Science and Mathematical Sciences, 32(1):15-26, 2012. [ bib | http ]
[39] Jean-Charles Faugère, Mohab Safey El Din, and Pierre-Jean Spaenlehauer. Gröbner Bases of Bihomogeneous Ideals Generated by Polynomials of Bidegree (1,1): Algorithms and Complexity. Journal of Symbolic Computation, 46(4):406-437, 2011. Available online 4 November 2010. [ bib | DOI | Download PDF ]
[40] Jean-Charles Faugère and Ye Liang. Artificial discontinuities of single-parametric Gröbner bases. Journal of Symbolic Computation, 46(4):459-466, 2011. [ bib | DOI | Download PDF ]
[41] Guillaume Moroz. Properness defects of projection and minimal discriminant variety. Journal of Symbolic Computation, 46(10):1139 - 1157, 2011. [ bib | DOI | http ]
[42] André Galligo and Adrien Poteaux. Computing monodromy via continuation methods on random Riemann surfaces. Theoretical Computer Science, 412(16):1492-1507, 2011. Symbolic and Numerical Algorithms. [ bib | DOI | http ]
[43] Mohab Safey El Din and Éric Schost. A Baby Steps/Giant Steps Probabilistic Algorithm for Computing Roadmaps in Smooth Bounded Real Hypersurface. Discrete and Computational Geometry, 45(1):181-220, 2011. [ bib | DOI | Download PDF ]
[44] Amir Hashemi and Daniel Lazard. Sharper complexity bounds for zero-dimensional Gröbner bases and polynomial system solving. International Journal of Algebra and Computation (IJAC), 21(5):703-713, 2011. [ bib | DOI ]
[45] Dongming Wang. Algebraic analysis of stability and bifurcation for nonlinear flight dynamics. The Aeronautical Journal, 115(1168):345-349, 2011. [ bib ]
[46] Ting Zhao, Dongming Wang, and Hoon Hong. Solution formulas for cubic equations without or with constraints. Journal of Symbolic Computation, 46(8):904-918, 2011. [ bib | DOI ]
[47] Adrien Poteaux and Marc Rybowicz. Complexity bounds for the rational Newton-Puiseux algorithm over finite fields. Applicable Algebra in Engineering, Communication and Computing, 22:187-217, 2011. [ bib | DOI ]
[48] Jean-Charles Faugère, David Lubicz, and Damien Robert. Computing modular correspondences for abelian varieties. Journal Of Algebra, 343(1):248-277, 2011. [ bib | DOI | Download PDF ]
[49] Jean-Charles Faugère and Ye Liang. Pivoting in Extended Rings for Computing Approximate Gröbner Bases. Mathematics in Computer Science, 5:179-194, 2011. [ bib | DOI | Download PDF ]
[50] Yanli Huang and Dongming Wang. Computing Intersection and Self-intersection Loci of Parametrized Surfaces Using Regular Systems and Gröbner Bases. Computer Aided Geometric Design, 28(9):566-581, 2011. [ bib | DOI ]
[51] Xiaoliang Li, Chenqi Mou, Wei Niu, and Dongming Wang. Stability analysis for discrete biological models using algebraic methods. Mathematics in Computer Science, 5(3):247-262, 2011. [ bib | DOI ]
[52] Pierre-Vincent Koseleff, Daniel Pecker, and Fabrice Rouillier. The first rational chebyshev knots. Journal of Symbolic Computation, 45:1341-1358, 2010. [ bib | DOI ]
[53] Françoise Levy-dit Vehel and Ludovic Perret. Security analysis of word problem-based cryptosystems. Des. Codes Cryptography, 54(1):29-41, 2010. [ bib | DOI ]
[54] Mohab Safey El Din and Lihong Zhi. Computing rational points in convex semi-algebraic sets and sums of squares decompositions. SIAM Journal on Optimization, 20(6):2876-2889, 2010. [ bib | DOI | Download PDF ]
[55] Luk Bettale, Jean-Charles Faugère, and Ludovic Perret. Hybrid approach for solving multivariate systems over finite fields. Journal of Mathematical Cryptology, 3(3):177-197, 2010. [ bib | DOI | Download PDF ]
[56] Gérald Bourgeois and Jean-Charles Faugère. Algebraic Attack on NTRU using Witt Vectors and Gröbner bases. Journal of Mathematical Cryptology, 3(3):205-214, 2010. [ bib | DOI | Download PDF ]
[57] Berlin Bank, Marc Giusti, Joos Heintz, Mohab Safey El Din, and Éric Schost. On the geometry of polar varieties. Applicable Algebra in Engineering, Communication and Computing, 21(1):33-83, 2010. [ bib | DOI | Download PDF ]
[58] Daniel Lazard. Cad and topology of semi-algebraic sets. Mathematics in Computer Science, 4:93-112, 2010. Special issue Computational Geometry and Computer-aided Geometric Design. [ bib | DOI ]
[59] Marc Pouget, Sylvain Lazard, Elias Tsigaridas, Fabrice Rouillier, Luis Penarnda, and Jinsan Cheng. On the topology of planar algebraic curves. Mathematics in Computer Science, pages 1-1, 2010. [ bib ]
[60] Guillaume Moroz, Damien Chablat, Philippe Wenger, and Fabrice Rouillier. On the determination of cusp points of 3-rpr parallel manipulators. Journal of Mechanism and Machine Theory, 45(11):1555-1567, 2010. [ bib | DOI | http ]
[61] Pierre-Vincent Koseleff and Daniel Pecker. Chebyshev diagrams for two-bridge knots. Geometricae Dedicata, pages 1-1, 2010. [ bib | DOI ]
[62] Pierre-Vincent Koseleff and Daniel Pecker. Chebyshev knots. Journal of Knot Theory and Ramifications, pages 1-1, 2010. [ bib ]
[63] Pierre-Vincent Koseleff and Daniel Pecker. On fibonacci knots. Fibonacci Quarterly, 48(2):137-143, 2010. [ bib ]
[64] Xiaoliang Li, Chenqi Mou, and Dongming Wang. Decomposing polynomial sets into simple sets over finite fields: The zero-dimensional case. Computers and Mathematics with Applications, 60(11):2983-2997, 2010. [ bib | DOI ]
[65] Amir Hashemi. Nullstellensätze for zerodimensional gröbner bases. Computational Complexity, 18(1):155-168, April 2009. [ bib | DOI ]
[66] Daniel Augot, Magali Bardet, and Jean-Charles Faugère. On the decoding of binary cyclic codes with the Newton identities. Journal of Symbolic Computation, 44(12):1608-1625, 2009. [ bib | DOI | Download PDF ]
[67] Jean-Charles Faugère and Ludovic Perret. An efficient algorithm for decomposing multivariate polynomials and its applications to cryptography. Journal of Symbolic Computation, 44(12):1676-1689, 2009. [ bib | DOI | Download PDF ]
[68] Daniel Lazard. Thirty years of polynomial system solving, and now? Journal of Symbolic Computation, 44(3):222-231, 2009. [ bib | DOI ]
[69] Daniel Lazard and Scott McCallum. Iterated discriminants. Journal of Symbolic Computation, 44(9):1176-1193, 2009. [ bib | DOI ]
[70] François Boulier, Daniel Lazard, François Ollivier, and Michel Petitot. Computing representations for radicals of finitely generated differential ideals. Appl. Algebra Engrg. Comm. Comput., 20(1):5-6 and 73-121, 2009. [ bib | DOI ]
[71] Masanari Kida, Guénaël Renault, and Kazuhiro Yokoyama. Quintic Polynomials of Hashimoto-Tsunogai, Brumer, and Kummer. International Journal of Number Theory, 5(4):555-571, 2009. [ bib | DOI | Download PDF ]
[72] Hazel Everett, Daniel Lazard, Sylvain Lazard, and Mohab Safey El Din. The Voronoi diagram of three lines in r3. Discrete and Computational Geometry, 42(1):94-130, 2009. [ bib | DOI ]
[73] Pierre-Vincent Koseleff and Daniel Pecker. A construction of polynomial torus knots. Journal of Applicable Algebra in Engineering, Communication and Computing, 20(5-6):361-377, 2009. [ bib ]
[74] Laurent Dupont, Daniel Lazard, Sylvain Lazard, and Sylvain Petitjean. Near-optimal parameterization of the intersection of quadrics : I. The generic algorithm. Journal of Symbolic Computation, 43(3):168-191, 2008. [ bib | DOI ]
[75] Laurent Dupont, Daniel Lazard, Sylvain Lazard, and Sylvain Petitjean. Near-optimal parameterization of the intersection of quadrics : II. A classification of pencils. Journal of Symbolic Computation, 43(3):192-215, 2008. [ bib | DOI ]
[76] Laurent Dupont, Daniel Lazard, Sylvain Lazard, and Sylvain Petitjean. Near-optimal parameterization of the intersection of quadrics : III. Parameterizing singular intersections. Journal of Symbolic Computation, 43(3):216-232, 2008. [ bib | DOI ]
[77] Wei Niu and Dongming Wang. Algebraic approaches to stability analysis of biological systems. Mathematics in Computer Science, 1(3):507-539, 2008. [ bib | DOI ]
[78] Mohab Safey El Din. Testing sign conditions on a multivariate polynomial and applications. Mathematics in Computer Science, 1(1):177-207, December 2007. [ bib ]
[79] Gu Nong, Daniel Lazard, Fabrice Rouillier, and Xiang yong. Using computer algebra to certify the global convergence of a numerical optimization process. Mathematics in Computer Science, 1(2):291-304, 2007. [ bib ]
[80] Richard Cameron, Jean-Charles Faugère, Fabrice Rouillier, and Fabien Seyfert. Exhaustive approach to the coupling matrix synthesis problem and application to the design of high degree asymmetric filters. Int J RF and Microwave Comp Aid Eng, 17(1):4-12, January 2007. [ bib | DOI | Download PDF ]
[81] Gu Nong, Xiang Yong, Fabrice Rouillier, and Zhiqiang Cao. Comments on a blind signal separation method for multiuser communications. IEEE Transactions on Signal Processing, 55(5):2355-2356, 2007. [ bib | DOI ]
[82] Daniel Lazard and Fabrice Rouillier. Solving parametric polynomial systems. Journal of Symbolic Computation, 42:636-667, 2007. [ bib ]
[83] Amir Hashemi. Polynomial complexity for hilbert series of borel type ideals. Albanian Journal of Mathematics, 1(3):145-155, 2007. [ bib ]

Fully Refereed International Conferences Papers

[1] Marta Conde Pena, Jean-Charles Faugère, and Ludovic Perret. Algebraic Cryptanalysis of a Quantum Money Scheme The Noise-Free Case. In IACR International Conference on Practice and Theory of Public-Key Cryptography (PKC'15), Maryland, United States, March 2015. [ bib | http | http ]
[2] Jean-Charles Faugère, Danilo Gligoroski, Ludovic Perret, Samardjiska Simona, and Enrico Thomae. A Polynomial-Time Key-Recovery Attack on MQQ Cryptosystems. In IACR International Conference on Practice and Theory of Public-Key Cryptography (PKC'15), Maryland, United States, March 2015. [ bib | http | http ]
[3] Jing Yang, Dongming Wang, and Hoon Hong. ImUp: A Maple Package for Uniformity-Improved Reparameterization of Plane Curves. In 10th Asian Symposium on Computer Mathematics, Computer Mathematics, pages 437-451, Beijing, China, October 2014. Springer. [ bib | DOI | http ]
[4] Jean-Charles Faugère, Ludovic Perret, and Frédéric De Portzamparc. Algebraic Attack against Variants of McEliece with Goppa Polynomial of a Special Form. In Advances in Cryptology Asiacrypt 2014, Kaohsiung, Taïwan, September 2014. [ bib | http | Download PDF ]
[5] Jean-Charles Faugère, Pierrick Gaudry, Louise Huot, and Guénaël Renault. Sub-cubic Change of Ordering for Gröbner Basis: A Probabilistic Approach. In Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation, pages 170-177, Kobe, Japon, July 2014. ACM. [ bib | DOI | http | Download PDF ]
[6] Victor Y. Pan and Elias Tsigaridas. Accelerated Approximation of the Complex Roots of a Univariate Polynomial (Extended Abstract). In Proceedings of the 2014 Symposium on Symbolic-Numeric Computation, pages 132-134, Shanghai, China, July 2014. ACM. [ bib | DOI | http | http ]
[7] Victor Y. Pan and Elias Tsigaridas. Nearly Optimal Computations with Structured Matrices. In Proceedings of the 2014 Symposium on Symbolic-Numeric Computation, pages 21-30, Shanghai, China, July 2014. [ bib | DOI | http | http ]
[8] Alin Bostan, Thierry Combot, and Mohab Safey El Din. Computing necessary integrability conditions for planar parametrized homogeneous potentials. In ISSAC'14 - International Symposium on Symbolic and Algebraic Computation, Kobe, Japan, July 2014. ACM Press. [ bib | DOI | http | http ]
[9] Jean-Charles Faugère, Ludovic Perret, Frédéric De Portzamparc, Ayoub Otmani, and Jean-Pierre Tillich. Structural weakness of compact variants of the McEliece cryptosystem. In IEEE International Symposium on Information Theory - ISIT 2014, pages 1717-1721, Honolulu, United States, June 2014. [ bib | http ]
[10] Jean-Charles Faugère, Pierre-Jean Spaenlehauer, and Jules Svartz. Sparse Gröbner Bases: the Unmixed Case. In Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation (ISSAC 2014), pages 178-185, Kobe, Japon, May 2014. [ bib | DOI | http | Download PDF ]
[11] Martin Albrecht, Jean-Charles Faugère, Robert Fitzpatrick, and Ludovic Perret. Lazy modulus switching for the bkw algorithm on lwe. In Hugo Krawczyk, editor, Public-Key Cryptography PKC 2014, volume 8383 of Lecture Notes in Computer Science, pages 429-445, Buenos Aires, Argentina, March 2014. Springer Berlin Heidelberg. [ bib | DOI | http | Download PDF ]
[12] Martin Albrecht, Jean-Charles Faugère, Robert Fitzpatrick, Ludovic Perret, Yosuke Todo, and Keita Xagawa. Practical cryptanalysis of a public-key encryption scheme based on new multivariate quadratic assumptions. In Hugo Krawczyk, editor, Public-Key Cryptography PKC 2014, volume 8383 of Lecture Notes in Computer Science, pages 446-464, Buenos Aires, Argentina, March 2014. Springer Berlin Heidelberg. [ bib | DOI | http | Download PDF ]
[13] Jingguo Bi, Jean-Sébastien Coron, Jean-Charles Faugère, Phong Q. Nguyen, Guénaël Renault, and Rina Zeitoun. Rounding and chaining lll: Finding faster small roots of univariate polynomial congruences. In Hugo Krawczyk, editor, Public-Key Cryptography PKC 2014, volume 8383 of Lecture Notes in Computer Science, pages 185-202, Buenos Aires, Argentina, 2014. Springer Berlin Heidelberg. [ bib | DOI | http | Download PDF ]
[14] Jean-Charles Faugère, Louise Huot, Antoine Joux, Guénaël Renault, and Vanessa Vitse. Symmetrized summation polynomials: Using small order torsion points to speed up elliptic curve index calculus. In Advances in Cryptology EUROCRYPT 2014, volume 8441 of Lecture Notes in Computer Science, pages 40-57, Copenhagen, Denmark, 2014. Springer Berlin Heidelberg. [ bib | DOI | http ]
[15] Martin R. Albrecht and Gregor Leander. An All-In-One Approach to Differential Cryptanalysis for Small Block Ciphers. In Selected Areas in Cryptography 19th International Conference, SAC 2012, pages 1 - 15, Windsor, Canada, August 2013. [ bib | DOI | http | http ]
[16] Victor Pan, Y. and Elias Tsigaridas. On the boolean complexity of real root refinement. In Manuel Kauers, editor, ISSAC 2013 - International Symposium on Symbolic and Algebraic Computation, Boston, United States, April 2013. ACM. [ bib | DOI | http | Download PDF ]
[17] Jean-Charles Faugère and Jules Svartz. Gröbner Bases of ideals invariant under a Commutative group : the Non-modular Case. In Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation, ISSAC '13, pages 347-354, New York, NY, USA, 2013. ACM. [ bib | DOI | http | Download PDF ]
[18] Jean-Charles Faugère, Mohab Safey El Din, and Thibaut Verron. On the complexity of Computing Gröbner Bases for Quasi-homogeneous Systems. In Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation, ISSAC '13, pages 189-196, New York, NY, USA, 2013. ACM. [ bib | DOI | http | Download PDF ]
[19] Guillaume Barbu, Alberto Battistelllo, Guillaume Dabosville, Christophe Giraud, Guénaël Renault, Soline Renner, and Rina Zeitoun. Combined attack on crt-rsa. why public verification must not be public? In Kaoru Kurosawa and Goichiro Hanaoka, editors, PKC 2013 - Public-Key Cryptography, volume 7778 of Lecture Notes in Computer Science, pages 1-17, Nara, Japan, 2013. Springer. [ bib | DOI | http | Download PDF ]
[20] Qingdong Guo, Mohab Safey El Din, and Lihong Zhi. Computing rational solutions of linear matrix inequalities. In ISSAC 2013 - International Symposium on Symbolic and Algebraic Computation, Boston, United States, 2013. [ bib | http | Download PDF ]
[21] Jing Yang, Dongming Wang, and Hoon Hong. Improving angular speed uniformity by c¹ piecewise reparameterization. In Tetsuo Ida and Jacques Fleuriot, editors, ADG 2012 - 9th International Workshop Automated Deduction in Geometry, volume 7993 of Lecture Notes in Computer Science, pages 33-47, Edinburgh, United Kingdom, 2013. Springer. [ bib | DOI | http ]
[22] Christian Eder and Bjarke Hammersholt Roune. Signature rewriting in grobner basis computation. In Manuel Kauers, editor, ISSAC 2013 - International Symposium on Symbolic and Algebraic Computation, pages 331-338, Boston, United States, 2013. ACM. [ bib | DOI | http | Download PDF ]
[23] Dongming Wang. Automation of geometry - theorem proving, diagram generation, and knowledge management. In Tetsuo Ida and Jacques Fleuriot, editors, ADG 2012 - 9th International Workshop Automated Deduction in Geometry, volume 7993 of Lecture Notes in Computer Science, pages 31-32, Edinburgh, United Kingdom, 2013. Springer. [ bib | DOI | http ]
[24] Mohab Safey El Din. Critical point methods and effective real algebraic geometry: New results and trends. In Manuel Kauers, editor, ISSAC 2013 - 38th International Symposium on Symbolic and Algebraic Computation, pages 5-6, Boston, United States, 2013. [ bib | DOI | http | Download PDF ]
[25] Jinsan Cheng, Jia Li, and Elias Tsigaridas. Local generic position for root isolation of zero-dimensional triangular polynomial systems. In W. Koepf and E.Vorozhtsov, editors, Proc. Computer Algebra in Scientific Computing (CASC), volume XXXX of Lecture Notes in Computer Science, pages 186-197. Springer, September 2012. [ bib | DOI | http | Download PDF ]
[26] Martin Albrecht, Carlos Cid, Jean-Charles Faugère, Robert Fitzpatrick, and Ludovic Perret. On the complexity of the arora-ge algorithm against lwe. In SCC '12: Proceedings of the 3nd International Conference on Symbolic Computation and Cryptography, pages 93-99, Castro-Urdiales, July 2012. [ bib ]
[27] Martin Albrecht, Carlos Cid, Jean-Charles Faugère, Robert Fitzpatrick, and Ludovic Perret. On the complexity of bkw algorithm against lwe. In SCC'12: Proceedings of the 3nd International Conference on Symbolic Computation and Cryptography, pages 100-107, Castro-Urdiales, July 2012. [ bib ]
[28] Jean-Charles Faugère, Pierrick Gaudry, Louise Huot, and Guénaël Renault. Using symmetries and fast change of ordering in the index calculus for elliptic curves discrete logarithm. In SCC'12: Proceedings of the 3nd International Conference on Symbolic Computation and Cryptography, pages 113-118, Castro-Urdiales, July 2012. [ bib ]
[29] Adam Strzebonski and Elias Tsigaridas. Univariate Real Root Isolation in Multiple Extension Fields. In ISSAC - Proceedings of the 37th ACM International Symposium on Symbolic and Algebraic Computation, pages 343-350, Grenoble, France, July 2012. [ bib | http | http ]
[30] Martin R. Albrecht. The M4RIE library for dense linear algebra over small fields with even characteristic. In ISSAC '12: Proceedings of the 2012 international symposium on Symbolic and algebraic computation, pages 28 - 34, Grenoble, France, July 2012. [ bib | DOI | http | http ]
[31] Ting Zhao, Dongming Wang, Hoon Hong, and Philippe Aubry. Real Solution Formulas of Cubic and Quartic Equations Applied to Generate Dynamic Diagrams with Inequality Constraints. In SAC 2012: Proceedings of the 27th ACM Symposium on Applied Computing, pages 94-101, Riva del Garda, Italy, March 2012. ACM Press. [ bib | DOI ]
[32] Jean-Charles Faugère, Danilo Gligoroski, Erlend Jensen, Rune Odegard, Ludovic Perret, Svein Johan Knapskog, and Smile Markovski. MQQ-SIG. In Liqun Chen, Moti Yung, and Liehuang Zhu, editors, Trusted Systems - The Third International Conference on Trusted Systems - INTRUST 2011, volume 7222 of Lecture Notes in Computer Science, pages 184-203. Springer Verlag, 2012. [ bib | DOI ]
[33] Jean-Charles Faugère, Ludovic Perret, Christophe Petit, and Guénaël Renault. Improving the Complexity of Index Calculus Algorithms in Elliptic Curves over Binary Fields. In David Pointcheval and Thomas Johansson, editors, Advances in Cryptology EUROCRYPT 2012, volume 7237 of Lecture Notes in Computer Science, pages 27-44. Springer Berlin / Heidelberg, 2012. [ bib | DOI | Download PDF ]
[34] Jean-Charles Faugère and Jules Svartz. Solving Polynomial Systems Globally Invariant Under an Action of the Symmetric Group and Application to the Equilibria of N vortices in the Plane. In Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation, ISSAC '12, pages 170-178, New York, NY, USA, 2012. ACM. [ bib | DOI | Download PDF ]
[35] Luk Bettale, Jean-Charles Faugère, and Ludovic Perret. Solving Polynomial Systems over Finite Fields: Improved Analysis of the Hybrid Approach. In Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation, ISSAC '12, pages 67-74, New York, NY, USA, 2012. ACM. [ bib | DOI | Download PDF ]
[36] Jean-Charles Faugère, Mohab Safey El Din, and Pierre-Jean Spaenlehauer. Critical Points and Gröbner Bases: the Unmixed Case. In Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation, ISSAC '12, pages 162-169, New York, NY, USA, 2012. ACM. [ bib | DOI | Download PDF ]
[37] Martin Albrecht. The M4RIE library for dense linear algebra over small fields with even characteristic. In ISSAC'12: Proceedings of the 2012 international symposium on Symbolic and algebraic computation, ISSAC '12, pages 28-34, New York, NY, USA, 2012. ACM. [ bib | DOI ]
[38] Adam Strzebonski and Elias Tsigaridas. Univariate Real Root Isolation in Multiple Extension Fields. In ISSAC '12: Proceedings of the 2012 international symposium on Symbolic and algebraic computation, ISSAC '12, pages 343-350, New York, NY, USA, 2012. ACM. [ bib | DOI | http | Download PDF ]
[39] Jing Yang, Dongming Wang, and Hoon Hong. Improving Angular Speed Uniformity by Optimal C0 Piecewise Reparameterization. In 14th International Workshop on Computer Algebra in Scientific Computing, volume 7442 of Lecture Notes in Computer Science, pages 349-360, Maribor, Slovénie, 2012. Springer. [ bib | DOI | http ]
[40] Alexandre Benoit, Alin Bostan, and Joris van der Hoeven. Quasi-Optimal Multiplication of Linear Differential Operators. In Foundations of Computer Science (FOCS), 2012 IEEE 53rd Annual Symposium on, FOCS '12, pages 524 -530, Los Alamitos, CA, USA, oct. 2012. IEEE Computer Society. [ bib | DOI | http ]
[41] Jean-Charles Faugère, Christopher Goyet, and Guénaël Renault. Attacking (ec)dsa given only an implicit hint. In LarsR. Knudsen and Huapeng Wu, editors, Selected Areas in Cryptography - SAC 2012, volume 7707 of Lecture Notes in Computer Science, pages 252-274, Ontario, 2012. Springer Berlin Heidelberg. [ bib | DOI | http | Download PDF ]
[42] Martin Albrecht and Gregor Leander. An All-in-one approach to Differential Cryptanalysis for small block ciphers. In Conference on Selected Areas of Cryptography, Lecture Notes in Computer Science, pages 1-12, Ontario, 2012. Springer Berlin / Heidelberg. [ bib ]
[43] Xiaoyu Chen, Wei Li, Jie Luo, and Dongming Wang. Open Geometry Textbook: A Case Study of Knowledge Acquisition via Collective Intelligence (project description). In Intelligent Computer Mathematics, volume 7362 of Lecture Notes in Computer Science, pages 432-437, Bremen, Allemagne, 2012. Springer. [ bib | DOI | http ]
[44] Martin Albrecht, Carlos Cid, Thomas Dulien, Jean-Charles Faugère, and Ludovic Perret. Algebraic Precomputations in Differential Cryptanalysis. In Xuejia Lai, Moti Yung, and Dongdai Lin, editors, Information Security and Cryptology: 6th International Conference, Inscrypt 2010, Revised Selected Papers, volume 6584, pages 387-403. Springer Berlin / Heidelberg, October 2011. [ bib | DOI | Download PDF ]
[45] Jean-Charles Faugère, Ayoub Gauthier-Umaña, Valérie Otmani, Ludovic Perret, and Jean-Pierre Tillich. A Distinguisher for High Rate McEliece Cryptosystems. In Information Theory Workshop (ITW), 2011 IEEE, pages 282-286, October 2011. [ bib | DOI | Download PDF ]
[46] Jean-Charles Faugère, Valérie Gauthier-Umana, Ayoub Otmani, Ludovic Perret, and Jean-Pierre Tillich. A distinguisher for high rate McEliece cryptosystems. In ITW 2011- IEEE Information Theory Workshop, pages 282-286, Paraty, Brazil, October 2011. IEEE. [ bib | DOI | http ]
[47] Xiaoyu Chen, Ying Huang, and Dongming Wang. On the design and implementation of a geometric knowledge base. In T. Sturm and C. Zengler, editors, Automated Deduction in Geometry, volume 6301 of Lecture Notes in Artificial Intelligence, pages 22-41, Berlin Heidelberg, 2011. Springer Berlin / Heidelberg. [ bib | DOI ]
[48] Charles Bouillaguet, Jean-Charles Faugère, Pierre-Alain Fouque, and Ludovic Perret. Practical Cryptanalysis of the Identification Scheme Based on the Isomorphism of Polynomial with One Secret Problem. In D. Catalano, N. Fazio, R. Gennaro, and A. Nicolosi, editors, Public Key Cryptography - PKC 2011, volume 6571 of Lecture Notes in Computer Science, pages 473-493. Springer Berlin / Heidelberg, 2011. [ bib | DOI | Download PDF ]
[49] Luk Bettale, Jean-Charles Faugère, and Ludovic Perret. Cryptanalysis of Multivariate and Odd-Characteristic HFE Variants. In D. Catalano, N. Fazio, R. Gennaro, and A. Nicolosi, editors, Public Key Cryptography - PKC 2011, volume 6571 of Lecture Notes in Computer Science, pages 441-458. Springer Berlin / Heidelberg, 2011. [ bib | DOI | Download PDF ]
[50] Jean-Charles Faugère, Christopher Goyet, and Guénaël Renault. Algebraic side channel analysis. In COSADE'11: The 2nd International Workshop on Constructive Side-Channel Analysis and Secure Design, pages 1-6, Fraunhofer SIT, 2011. [ bib ]
[51] Martin Albrecht, Pooya Farshim, Kenneth Paterson, and Gaven Watson. On Cipher-Dependent Related-Key Attacks in the Ideal Cipher Model. In Fast Software Encryption 2011, FSE, Lecture Notes in Computer Science, pages 1-20. Springer, 2011. [ bib ]
[52] Aurélien Greuet and Mohab Safey El Din. Deciding reachability of the infimum of a multivariate polynomial. In ISSAC '11: Proceedings of the 2011 international symposium on Symbolic and algebraic computation, ISSAC '11, pages 131-138, New York, NY, USA, 2011. ACM. [ bib | DOI ]
[53] Jean-Charles Faugère and Chenqi Mou. Fast Algorithm for Change of Ordering of Zero-dimensional Gröbner Bases with Sparse Multiplication Matrices. In Proceedings of the 36th international symposium on Symbolic and algebraic computation, ISSAC '11, pages 115-122, New York, NY, USA, 2011. ACM. [ bib | DOI | Download PDF ]
[54] Martin Albrecht, Jean-Charles Faugère, Pooya Farshim, and Ludovic Perret. Polly cracker, revisited. In D.H. Lee and X. Wang, editors, Advances in Cryptology Asiacrypt 2011, volume 7073 of Lecture Notes in Computer Science, pages 179-196. Springer Berlin / Heidelberg, 2011. [ bib | DOI | Download PDF ]
[55] Frederik Armknecht, Daniel Augot, Ludovic Perret, and Ahmad-Reza Sadeghi. On constructing homomorphic encryption schemes from coding theory. In IMA Int. Conf., pages 23-40, 2011. [ bib | DOI ]
[56] Jean-Charles Faugère. Solving efficiently structured polynomial systems and applications in cryptology. In The 15th workshop on Elliptic Curve Cryptography ECC 2011, pages 1-1, 2011. [ bib ]
[57] Jean-Charles Faugère, Rune Odegard, Ludovic Perret, and Danilo Gligoroski. Analysis of the MQQ Public Key Cryptosystem. In Swee-Huay Heng, Rebecca Wright, and Bok-Min Goi, editors, Cryptology and Network Security, volume 6467 of Lecture Notes in Computer Science, pages 169-183. Springer Berlin / Heidelberg, December 2010. [ bib | DOI | Download PDF ]
[58] Jean-Charles Faugère. FGb: A Library for Computing Gröbner Bases. In Komei Fukuda, Joris Hoeven, Michael Joswig, and Nobuki Takayama, editors, Mathematical Software - ICMS 2010, volume 6327 of Lecture Notes in Computer Science, pages 84-87, Berlin, Heidelberg, September 2010. Springer Berlin / Heidelberg. [ bib | DOI | Download PDF ]
[59] Mate Soos. Enhanced gaussian elimination in DPLL-based SAT solvers. In Pragmatics of SAT, pages 1-1, Edinburgh, Scotland, GB, July 2010. [ bib ]
[60] Jean-Charles Faugère and Sylvain Lachartre. Parallel Gaussian Elimination for Gröbner bases computations in finite fields. In M. Moreno-Maza and J.L. Roch, editors, Proceedings of the 4th International Workshop on Parallel and Symbolic Computation, PASCO '10, pages 89-97, New York, NY, USA, July 2010. ACM. [ bib | DOI | Download PDF ]
[61] Jean-Charles Faugère, Ayoub Otmani, Ludovic Perret, and Jean-Pierre Tillich. Algebraic Cryptanalysis of McEliece variants with compact keys - toward a complexity analysis. In SCC '10: Proceedings of the 2nd International Conference on Symbolic Computation and Cryptography, pages 45-55, RHUL, June 2010. [ bib | Download PDF ]
[62] Jean-Charles Faugère, Rune Odegard, Ludovic Perret, and Danilo Gligoroski. Analysis of the MQQ Public Key Cryptosystem. In SCC'10: Proceedings of the 2nd International Conference on Symbolic Computation and Cryptography, pages 101-116, RHUL, June 2010. [ bib | Download PDF ]
[63] Luk Bettale, Jean-Charles Faugère, and Ludovic Perret. Hybrid Approach : a Tool for Multivariate Cryptography. In Tools'10: Proceedings of the Workshop on Tools for Cryptanalysis 2010, pages 1-2, RHUL, June 2010. Ecrypt II. [ bib | Download PDF ]
[64] Martin Albrecht, Carlos Cid, Thomas Dulien, Jean-Charles Faugère, and Ludovic Perret. Algebraic Precomputations in Differential Cryptanalysis. In Tools'10: Proceedings of the Workshop on Tools for Cryptanalysis 2010, pages 1-14, RHUL, June 2010. Ecrypt II. [ bib | Download PDF ]
[65] Jean-Charles Faugère, Joachim von zur Gathen, and Ludovic Perret. Decomposition of Generic Multivariate Polynomials. In ISSAC '10: Proceedings of the 2010 international symposium on Symbolic and algebraic computation, ISSAC '10, pages 131-137, New York, NY, USA, 2010. ACM. isbn: 0747-7171 (updated version). [ bib | DOI | Download PDF ]
[66] Feng Guo, Mohab Safey El Din, and Lihong Zhi. Global optimization of polynomials using generalized critical values and sums of squares. In ISSAC '10: Proceedings of the 2010 international symposium on Symbolic and algebraic computation, pages 107-114, New York, NY, USA, 2010. ACM. [ bib | DOI | Download PDF ]
[67] Jean-Charles Faugère, Mohab Safey El Din, and Pierre-Jean Spaenlehauer. Computing Loci of Rank Defects of Linear Matrices using Grobner Bases and Applications to Cryptology. In ISSAC '10: Proceedings of the 2010 international symposium on Symbolic and algebraic computation, ISSAC '10, pages 257-264, New York, NY, USA, 2010. ACM. Best Student Paper Award. [ bib | DOI | Download PDF ]
[68] Jean-Charles Faugère, Ayoub Otmani, Ludovic Perret, and Jean-Pierre Tillich. Algebraic Cryptanalysis of McEliece variants with compact keys. In Proceedings of Eurocrypt 2010, volume 6110 of Lecture Notes in Computer Science, pages 279-298. Springer Verlag, 2010. [ bib | DOI | Download PDF ]
[69] Jean-Charles Faugère and Ludovic Perret. Algebraic Cryptanalysis of Curry and Flurry using Correlated Messages. In M. Yung and F. Bao, editors, Information Security and Cryptology: 5th International Conference, Inscrypt 2009, Beijing, China, December, 2009, Revised Selected Papers, volume 6151, pages 266-277, Berlin, Heidelberg, 2010. Springer-Verlag. [ bib | DOI | Download PDF ]
[70] Jean-Charles Faugère, Antoine Joux, Ludovic Perret, and Joana Treger. Cryptanalysis of the Hidden Matrix Cryptosystem. In Michel Abdalla and Paulo Barreto, editors, Progress in Cryptology - LATINCRYPT 2010, volume 6212 of Lecture Notes in Computer Science, pages 241-254. Springer Berlin / Heidelberg, 2010. [ bib | DOI | Download PDF ]
[71] Mohab Safey El Din. Stability analysis of numerical schemes with a variant quantifier elimination algorithm over the reals. In Hybrid Methodologies for Symbolic-Numeric Computation, pages 1-1. Mathematical Sciences Research Institute, 2010. [ bib ]
[72] Mohab Safey El Din. Fast algorithms for real solving polynomial systems of inequalities/inequations. In SIAM Conference on Parallel Processing and Scientific Computing - High Performance Symbolic Computing, pages 1-1. SIAM, 2010. [ bib ]
[73] Jean-Charles Faugère and Pierre-Jean Spaenlehauer. Algebraic Cryptanalysis of the PKC'09 Algebraic Surface Cryptosystem. In P.Q. Nguyen and D. Poincheval, editors, Public Key Cryptography PKC 2010, volume 6056 of Lecture Notes in Computer Science, pages 35-52. Springer-Verlag, 2010. [ bib | DOI | Download PDF ]
[74] Jean-Charles Faugère, Raphaël Marinier, and Guénaël Renault. Implicit Factoring with Shared Most Significant and Middle Bits. In P.Q. Nguyen and D. Poincheval, editors, in 13th International Conference on Practice and Theory in Public Key Cryptography - PKC 2010, volume 6056 of Lecture Notes in Computer Science, pages 70-87. Springer-Verlag, 2010. [ bib | DOI | Download PDF ]
[75] Jean-Charles Faugère, Raphaël Marinier, and Guénaël Renault. Implicit Factoring with Shared Most Significant and Middle Bits. In SCC '10: Proceedings of the 2nd International Conference on Symbolic Computation and Cryptography, pages 197-201, RHUL, 2010. [ bib | Download PDF ]
[76] Jean-Gabriel Kammerer, Reynald Lercier, and Guénaël Renault. Encoding points on hyperelliptic curves over finite fields in deterministic polynomial time. In Atsuko Miyaji Marc Joye and Akira Otsuka, editors, PAIRING-BASED CRYPTOGRAPHY - PAIRING 2010, volume 6487 of Lecture Notes in Computer Science, pages 278-297. Springer-Verlag, 2010. [ bib | DOI | http ]
[77] Guillaume Moroz, Damien Chablat, Philippe Wenger, and Fabrice Rouillier. Cusp points in the parameter space of rpr-2prr parallel manipulators. In Doina Pisla, editor, EuroComs'2010 - 3-rd European Conference on Mechanism Science, New Trends in Mechanism Science: Analysis and Design, pages 29-27. Springer, 2010. [ bib ]
[78] Fabrice Rouillier. Solving algebraic systems and applications to geometric computations. In International Congress on Mathematical Software, pages 1-1. Springer, 2010. [ bib ]
[79] Mohab Safey El Din. Fast algorithms for real solving polynomial systems of inequalities/inequations. In SIAM Conference on Parallel Processing and Scientific Computing - High Performance Symbolic Computing, pages 1-1. SIAM, 2010. [ bib ]
[80] Mate Soos. Grain of salt - an automated way to test stream ciphers through sat solvers. In Tools'10: Proceedings of the Workshop on Tools for Cryptanalysis 2010, pages 1-2, RHUL, 2010. [ bib ]
[81] Jean-Charles Faugère, Ayoub Otmani, Ludovic Perret, and Jean-Pierre Tillich. A Distinguisher for High Rate McEliece Cryptosystem - Extended Abstract. In P. Véron, editor, Yet Another Conference on Cryptography, YACC 2010, pages 1-4, Toulon, 2010. [ bib | Download PDF ]
[82] Jean-Charles Faugère, Ayoub Otmani, Ludovic Perret, and Jean-Pierre Tillich. Algebraic Cryptanalysis of McEliece variants with compact keys - toward a complexity analysis. In P. Véron, editor, Yet Another Conference on Cryptography, YACC 2010, pages 1-4, Toulon, 2010. [ bib | Download PDF ]
[83] Jean-Charles Faugère. Structured Polynomial Systems and Algebraic Cryptanalysis of McEliece Variants with Compact Keys. In DSO National Labs, pages 1-1, January 2010. [ bib ]
[84] Dongming Wang, Xiao-Shan Gao, Zhuojun Liu, and Ziming Li. A Review of the Development of Mathematics Mechanization (in Chinese). In Boju Jiang, Banghe Li, Xiao-Shan Gao, and Wenlin Li, editors, Wen-tsün Wu and Chinese Mathematics, pages 221-233. Global Publishing, 2010. [ bib ]
[85] Luk Bettale, Jean-Charles Faugère, and Ludovic Perret. Security Analysis of Multivariate Polynomials for Hashing. In Moti Yung, Dongdai Lin, and Peng Liu, editors, Information Security and Cryptology: 4th International Conference, Inscrypt 2008, Revised Selected Papers, volume 5487, pages 115-124, Berlin, Heidelberg, December 2009. Springer-Verlag. [ bib | DOI | Download PDF ]
[86] Daniel Lazard. Algebraic points in geometry and application to CAD. In International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS), volume 22 of COE Lecture Note, pages 1-1. Kyushu University, Japan, December 2009. [ bib ]
[87] Xiaoliang Li, Chenqi Mou, Wei Niu, and Dongming Wang. Stability analysis for discrete biological models using algebraic methods. In M. Suzuki, H. Hong, H. Anai, C. Yap, Y. Sato, and H. Yoshida, editors, Proceedings of the Joint Conference of ASCM 2009 and MACIS 2009, volume 22 of COE Lecture Note Series, pages 382-385, Fukuoka, Japan, December 2009. Kyushu University. [ bib ]
[88] Dongming Wang. Basic elements of computer geometry. In A. Bouhoula and T. Ida, editors, SCSS 2009: Proceedings of the Tunisia-Japan Workshop on Symbolic Computation in Software Science, pages 2-12. EasyChair, September 2009. [ bib ]
[89] Yanli Huang and Dongming Wang. Computing self-intersection loci of parametrized surfaces using regular systems and Gröbner bases. In SYNASC 2009: Proceedings of the 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, pages 28-36, Timisoara, Romania, September 2009. IEEE Computer Society. [ bib | DOI ]
[90] Jean-Charles Faugère, Ludovic Perret, and Pierre-Jean Spaenlehauer. Algebraic-Differential Cryptanalysis of DES. In Western European Workshop on Research in Cryptology - WEWoRC 2009, pages 1-5, July 2009. [ bib | DOI | Download PDF ]
[91] Daniel Lazard. Theorem proving in geometry and tools for polynomial system solving. In International Conference on Mathematics Mechanization (ICMM) in honor of professor Wen-Tsun Wu's nineties birthday, pages 1-1, May 2009. [ bib ]
[92] Jean-Charles Faugère. Efficient algorithms to compute Groebner Bases and applications in Cryptology. In Polynomial Computer Algebra'09, pages 1-1, April 2009. [ bib ]
[93] Dongming Wang. Formalization and specification of geometric knowledge objects. In Z. Hu and J. Zhang, editors, AWFS 2009: Proceedings of the Sixth Asian Workshop on Foundations of Software, pages 86-98, Tokyo, Japan, April 2009. National Institute of Informatics. [ bib ]
[94] Hazel Everett, Christian Gillot, Daniel Lazard, Sylvain Lazard, and Marc Pouget. The Voronoi diagram of three arbitrary lines in r3. In 25th European Workshop on Computational Geometry - EuroCG'09, pages 297-300, March 2009. [ bib | Download PDF ]
[95] Hoon Hong and Mohab Safey El Din. Variant real quantifier elimination: algorithm and application. In ISSAC '09: Proceedings of the 2009 international symposium on Symbolic and algebraic computation, pages 183-190, New York, NY, USA, 2009. ACM. isbn: ? [ bib | DOI ]
[96] Jean-Charles Faugère. Interactions between computer algebra (Gröbner bases) and cryptology. In ISSAC '09: Proceedings of the 2009 international symposium on Symbolic and algebraic computation, ISSAC '09, pages 383-384, New York, NY, USA, 2009. ACM. [ bib | DOI | Download PDF ]
[97] Jean-Charles Faugère and Ludovic Perret. High order derivatives and decomposition of multivariate polynomials. In ISSAC '09: Proceedings of the 2009 international symposium on Symbolic and algebraic computation, ISSAC '09, pages 207-214, New York, NY, USA, 2009. ACM. [ bib | DOI | Download PDF ]
[98] Jean-Charles Faugère and Sajjad Rahmany. Solving systems of polynomial equations with symmetries using SAGBI-Gröbner bases. In ISSAC '09: Proceedings of the 2009 international symposium on Symbolic and algebraic computation, ISSAC '09, pages 151-158, New York, NY, USA, 2009. ACM. [ bib | DOI | Download PDF ]
[99] Sébastien Orange, Guénaël Renault, and Kazuhiro Yokoyama. Computation schemes for splitting fields of polynomials. In ISSAC '09: Proceedings of the 2009 international symposium on Symbolic and algebraic computation, pages 279-286, New York, NY, USA, 2009. ACM. [ bib | DOI ]
[100] Jean-Charles Faugère. Solving Structured Polynomial Systems and Applications to Cryptology. In Vladimir Gerdt, Ernst Mayr, and Evgenii Vorozhtsov, editors, Computer Algebra in Scientific Computing - CASC'09, volume 5743 of Lecture Notes in Computer Science, pages 79-80. Springer Berlin / Heidelberg, 2009. [ bib | DOI | Download PDF ]
[101] Fabrice Rouillier and Rong Xiao. On using triangular decomposition for solving parametric polynomial systems. In MACIS'09, pages 1-1, 2009. [ bib ]
[102] Jinsan Cheng, Sylvain Lazard, Luis Penarnda, Marc Pouget, Fabrice Rouillier, and Elias Tsigaridas. On the topology of planar algebraic curves. In J. Hershberger and E. Fogel, editors, Proceedings of the 25th annual symposium on Computational geometry, SCG '09, pages 361-370. ACM, 2009. [ bib | DOI | http ]
[103] Guillaume Moroz. Regular decompositions. In Computer Mathematics: 8th Asian Symposium, ASCM 2007, Revised and Invited Papers, pages 263-277, Berlin, Heidelberg, December 2008. Springer-Verlag. [ bib | DOI ]
[104] Mohab Safey El Din. Practical and theoretical issues for the computation of generalized critical values of a polynomial mapping. In Computer Mathematics: 8th Asian Symposium, ASCM 2007. Revised and Invited Papers, pages 42-56, Berlin, Heidelberg, December 2008. Springer-Verlag. [ bib | DOI ]
[105] Jean-Charles Faugère. On the complexity of the Minrank problem. In Second Workshop on Mathematical Cryptology, pages 2-3, Santander, Spain, October 2008. [ bib ]
[106] Jean-Charles Faugère and Ludovic Perret. High order derivatives and decomposition of multivariate polynomials. In Second Workshop on Mathematical Cryptology, pages 15-19, Santander (Spain), October 2008. [ bib ]
[107] Guénaël Renault. Introduction à la théorie de galois effective. In JNCF'08: Journées Nationales du Calcul Formel (online), pages 141-197, October 2008. [ bib | Download PDF ]
[108] Xiaoyu Chen, Ying Huang, and Dongming Wang. On the design and implementation of a geometric knowledge base. In M. Kauers, M. Wu, and Z. Zeng, editors, Proceedings of ADG 2008 - Seventh International Workshop on Automated Deduction in Geometry, pages 62-78, Shanghai, China, September 2008. East China Normal University. Chinese version in Journal of Computer Applications. [ bib ]
[109] Daniel Lazard. Can Exact Computation Help Optimization ? In T. Ueta, editor, Proceedings of the 2008 International Symposium on Nonlinear Theory and its Applications (NOLTA 08), pages 672-675. IEICE Japan, September 2008. [ bib ]
[110] Jean-Charles Faugère, Françoise Levy-dit Vehel, and Ludovic Perret. Cryptanalysis of minrank. In David Wagner, editor, Advances in Cryptology CRYPTO 2008, volume 5157 of Lecture Notes in Computer Science, pages 280-296, Berlin, Heidelberg, August 2008. Springer-Verlag. [ bib | DOI | Download PDF ]
[111] Wei Niu and Dongming Wang. Algebraic analysis of bifurcation and limit cycles for biological systems. In AB 2008: Proceedings of the Third International Conference on Algebraic Biology, volume 5147 of Lecture Notes in Computer Science, pages 156-171, Hagenberg, Austria, July/August 2008. Springer-Verlag. [ bib | DOI ]
[112] Jean-Charles Faugère and Ludovic Perret. On the Security of UOV. In First International Conference on Symbolic Computation and Cryptography, SCC 08, LMIB, pages 103-109, Beijing, China, April 2008. [ bib | Download PDF ]
[113] Ilaria Simonetti, Jean-Charles Faugère, and Ludovic Perret. Algebraic Attack Against Trivium. In First International Conference on Symbolic Computation and Cryptography, SCC 08, LMIB, pages 95-102, Beijing, China, April 2008. [ bib | Download PDF ]
[114] Jean-Charles Faugère, Guillaume Moroz, Fabrice Rouillier, and Mohab Safey El Din. Classification of the Perspective-Three-Point problem, discriminant variety and real solving polynomial systems of inequalities. In D. Jeffrey, editor, ISSAC '08: Proceedings of the twenty-first international symposium on Symbolic and algebraic computation, pages 79-86, New York, NY, USA, 2008. ACM. [ bib | DOI | Download PDF ]
[115] Guénaël Renault and Kazuhiro Yokoyama. Multi-modular algorithm for computing the splitting field of a polynomial. In D. Jeffrey, editor, ISSAC'08: Proceedings of the 2008 international symposium on Symbolic and algebraic computation, pages 247-254. ACM, 2008. [ bib | DOI ]
[116] Mohab Safey El Din. Computing the global optimum of a multivariate polynomial over the reals. In D. Jeffrey, editor, ISSAC '08: Proceedings of the twenty-first international symposium on Symbolic and algebraic computation, pages 71-78, New York, NY, USA, 2008. ACM. [ bib ]
[117] Luk Bettale, Jean-Charles Faugère, and Ludovic Perret. Cryptanalysis of the TRMS Cryptosystem of PKC'05. In Serge Vaudenay, editor, AfricaCrypt 2008, volume 5023 of Lecture Notes in Computer Science, pages 143-155, Casablanca, Morocco, 2008. Springer. [ bib | DOI | Download PDF ]
[118] Yann Laigle-Chapuy. A note on a class of quadratic permutations over f(2n). In Proceedings of the 17th international conference on Applied algebra, algebraic algorithms and error-correcting codes, AAECC'07, pages 130-137, Berlin, Heidelberg, 2008. Springer-Verlag. [ bib | http ]
[119] Guillaume Moroz and Fabrice Rouillier. Explicit classification of the 9 first haas parametric systems. In T. Sturm, editor, Proceedings of ADG 2008 - Seventh International Workshop on Automated Deduction in Geometry, pages 1-1, 2008. [ bib ]
[120] Marc Pouget, Sylvain Lazard, Fabrice Rouillier, Elias Tsigaridas, and Luis Penarndas. On the topology of planar algebraic curves. In European Workshop on Computational Geometry, pages 1-1, 2008. [ bib ]
[121] Pierre-Alain Fouque, Gilles Macariorat, Ludovic Perret, and Jacques Stern. On the security of the l-ic signature scheme. In Public Key Cryptography, 4th International Workshop on Practice and Theory in Public Key Cryptography, PKC 2008, volume 4939 of Lecture Notes in Computer Science, pages 1-17. Springer, 2008. [ bib ]
[122] Mohab Safey El Din. Real solving polynomial systems of inequalities: the case of bounded sets of solutions. In Mathematical Aspects of Computer and Information Sciences 2007. Online, December 2007. [ bib | .html ]
[123] Gwenolé Ars and Amir Hashemi. Efficient computation of syzygies by Faugere's F5 algorithm. In MACIS 2007: Mathematical Aspects of Computer and Information Sciences, December 2007. [ bib ]
[124] Amir Hashemi. Efficient algorithms for computing noether normalization. In ASCM 2007: The 8th ASian Symposium on Computer Mathematics, December 2007. [ bib ]
[125] Jean-Charles Faugère and Ye Liang. Numerical computation of grobner bases for zero-dimensional polynomial ideals. In Mathematical Aspects of Computer and Information Sciences 2007, Paris, France, December 2007. [ bib | .html ]
[126] Amir Hashemi. Polynomial-time algorithm for hilbert series of borel type ideals. In SNC'07: Symbolic-Numeric Computation'07, pages 97-102, July 2007. [ bib ]
[127] Hazel Everett, Daniel Lazard, Sylvain Lazard, and Mohab Safey El Din. The Voronoi diagram of three lines in R3. In SoCG '07: Proceedings of the twenty-third annual symposium on Computational geometry, pages 255-264, June 2007. [ bib ]
[128] Daniel Lazard and Scott McCallum. Iterated discriminants. In MEGA 2007: Effective Methods in Algebraic Geometry, June 2007. [ bib ]
[129] Daniel Augot, Magali Bardet, and Jean-Charles Faugère. On formulas for decoding binary cyclic codes. In Goldsmith, Medard, Shokrollahi, and Zamir, editors, IEEE International Symposium on Information Theory, 2007. ISIT 2007, pages 2646 -2650, June 2007. [ bib | DOI | Download PDF ]
[130] Mohab Safey El Din and Philippe Trébuchet. Posix threads polynomials(ptpol): a scalable implementation of univariate arithmetic operations. In PASCO '07: Proceedings of the 2007 international workshop on Parallel symbolic computation, pages 104-106, New York, NY, USA, 2007. ACM. [ bib | http ]
[131] Makoto Sugita, Mitsuru Kawazoe, Ludovic Perret, and Hideki Imai. Algebraic cryptanalysis of 58-round sha-1. In Alex Biryukov, editor, Fast Software Encryption, 14th International Workshop, FSE, volume 4593 of Lecture Notes in Computer Science, pages 349-365. Springer, 2007. [ bib | DOI ]

Book Chapter

[1] Ioannis Z. Emiris, Elias Tsigaridas, and Antonios Varvitsiotis. Mixed volume and distance geometry techniques for counting Euclidean embeddings of rigid graphs, chapter XX, pages 1-23. Springer-Verlag, (to appear) edition, 2012. [ bib | http | Download PDF ]
[2] Ioannis Z. Emiris, Victor Y. Pan, and Elias Tsigaridas. Algebraic and numerical algorithms, chapter 17, pages 1-40. CRC Press Inc., Boca Raton, Florida, 3nd edition, 2012. [ bib ]
[3] Françoise Levy-dit Vehel, Maria-Grazia Marinari, Ludovic Perret, and Carlo Traverso. Gröbner Bases, Coding, and Cryptography, chapter A Survey on Polly Cracker Systems, pages 143-155. Springer, 2009. isbn: 9783540938057. [ bib ]
[4] Jean-Charles Faugère and Mohab Safey El Din. Mathématiques Appliquées (L3), chapter De l'algèbre linéaire à la résolution des systèmes polynomiaux, pages 331-388. Pearson, 2009. isbn: 978-2-7440-7352-6. [ bib ]
[5] Frédéric Cazals, Jean-Charles Faugère, Marc Pouget, and Fabrice Rouillier. Ridges and Umbilics of Polynomial Parametric Surfaces, pages 141-159. Springer Berlin Heidelberg, 2008. isbn: 978-3-540-72184-0. [ bib | DOI | Download PDF ]

Books or Special Issues

[1] Jean-Charles Faugere, Jaime Gutierrez, Domingo Gómez-Pérez, and Ludovic Perret. Mathematical and computer algebra techniques in cryptology, volume 64. Elsevier, November 2013. [ bib | DOI | http | Download PDF ]
[2] Dongming Wang, Viorel Negru, Tetsuo Ida, Tudor Jebelean, Dana Petcu, Stephen M. Watt, and Daniela Zaharie, editors. Proceedings of the 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2011), Timisoara, Romania, September 2011. IEEE Computer Society. [ bib ]
[3] Dongming Wang, Chenqi Mou, Xiaoliang Li, Jing Yang, Meng Jin, and Yanli Huang. Polynomial Algebra (in Chinese). Higher Education Press, 2011. isbn: 9787040316988. [ bib ]
[4] Jean-Charles Faugère and Ludovic Perret. Symbolic Computation and Cryptography, volume 3. Birkhäuser and Springer, Mathematics in Computer Science, 2010. isbn: 1661-8270. [ bib | DOI | Download PDF ]
[5] Jean-Charles Faugère and Carlos Cid, editors. Proceedings of the 2nd International Conference on Symbolic Computation and Cryptography (SCC 2010), Royal Holloway, University of London, Egham, June, 2010. Royal Holloway, University of London, 2010. isbn: 0000-0000. [ bib | Download PDF ]
[6] Jean-Charles Faugère and Fabrice Rouillier. Polynomial system solving, volume 44. Academic Press, Inc., Journal of Symbolic Computation, 2009. isbn: 0747-7171. [ bib | DOI | Download PDF ]
[7] Daniel Augot, Jean-Charles Faugère, and Ludovic Perret. Gröbner Bases Techniques in Coding Theory and Cryptography, volume 44. Academic Press, Inc., Journal of Symbolic Computation, 2009. isbn: 0747-7171. [ bib | DOI | Download PDF ]
[8] Max Sala, Teo Mora, Ludovic Perret, Shojiro Sakata, and Carlo Traverso. Gröbner Bases, Coding, and Cryptography. Springer, 2009. isbn: 9783540938057. [ bib ]
[9] Jean-Charles Faugère and Dongming Wang, editors. Proceedings of the First International Conference on Symbolic Computation and Cryptography (SCC 2008), Beijing, China, April 2008. Beihang University, China. isbn: 0000-0000. [ bib ]
[10] Tetsuo Ida, Qingshan Jiang, and Dongming Wang, editors. Foundations of Software - Special focus of Frontiers of Computer Science in China, volume 2. Higher Education Press and Springer, 2008. ISSN: 1673-7350. [ bib ]

Ph.D. Thesis - Habilitation

[1] Jules Svartz. Résolution de Systèmes Polynomiaux Structurés de Dimension Zéro. PhD thesis, Université Paris 6, 2014. [ bib ]
[2] Aurélien Greuet. Optimisation polynomiale et variétés polaires : théorie, algorithmes, et implantations. PhD thesis, Université de Versailles-Saint Quentin en Yvelines, December 2013. [ bib | http | Download PDF ]
[3] Louise Huot. Résolution de systèmes polynomiaux et cryptologie sur les courbes elliptiques. PhD thesis, Université Pierre et Marie Curie - Paris VI, December 2013. [ bib | http | Download PDF ]
[4] Chenqi Mou. Solving Polynomial Systems over Finite Fields: Algorithms, Implementation and Applications. Theses, Université Pierre et Marie Curie, May 2013. [ bib | http | http ]
[5] Christopher Goyet. Cryptanalyse algébrique par canaux auxiliaires. PhD thesis, Université Paris 6, 2012. [ bib ]
[6] Pierre-Jean Spaenlehauer. Résolution de systèmes multi-homogènes et déterminantiels: algorithmes, complexités et applications. PhD thesis, Université Paris 6, 2012. [ bib ]
[7] Ye Liang. Approximate Gröbner Bases. PhD thesis, Université Paris 6 and Beihang University, 2011. [ bib ]
[8] Wei Niu. Analyse Qualitative des Systèmes Biologiques par des Méthodes Algébriques. PhD thesis, Université Paris 6, 2011. [ bib ]
[9] Luk Bettale. Cryptanalyse algébrique : outils et applications. PhD thesis, Université Paris 6, 2011. [ bib ]
[10] Mohab Safey El Din. Polynomial System Solving over the Reals: Algorithms, Complexity, Implementations and Applications. PhD thesis, University Pierre and Marie Curie, 2010. Habilitation Thesis. [ bib ]
[11] Sajjad Rahmany. Utilisation des bases de Gröbner SAGBI pour la résolution des systèmes polynômiaux invariants par symétries. PhD thesis, Université Paris 6, 2009. [ bib ]
[12] Sylvain Lachartre. Algèbre linéaire dans la résolution de systèmes polynomiaux Applications en cryptologie. PhD thesis, Université Paris 6, 2008. [ bib ]
[13] Guillaume Moroz. Sur la décomposition réelle et algébrique des systèmes dépendant de paramètres. PhD thesis, Université Paris 6, 2008. [ bib ]
[14] Fabrice Rouillier. Algorithmes pour l'étude des solutions réelles des systèmes polynomiaux. Habilitation à diriger des recherches, Université Pierre et Marie Curie - Paris VI, 2007. [ bib ]
[15] Jean-Charles Faugère. Calcul efficace des bases de Gröbner et Applications. Habilitation à diriger des recherches, Université Pierre et Marie Curie - Paris VI, 2007. [ bib ]