Parallel Gaussian elimination for Gröbner bases computations in finite fields

PASCO'2010 - Proceedings of the 2010 International Workshop on Parallel Symbolic Computation

Volumn , Issue , 2010, Pages 89-97

  Faugère, Jean Charles ^a,b,c   Lachartre, Sylvain ^d  

^a INRIA   (France)

^b SORBONNE UNIVERSITÉ   (France)

^c UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

^d THALES COMMUNICATIONS   (France)

Author keywords

Cryptography; Gaussian elimination; Gr bner bases; High performance linear Algebra; Multi core programming; Polynomial systems solving

Indexed keywords

COMPUTATIONAL RESULTS; COMPUTER ALGEBRA; CRYPTOLOGY; EFFICIENT ALGORITHM; FINITE FIELDS; GAUSSIAN ELIMINATION; HIGH PERFORMANCE LINEAR ALGEBRA; INTERNAL REPRESENTATION; LINEAR ALGEBRA PACKAGE; MEDIUM SIZE; MULTI CORE; POLYNOMIAL SYSTEM SOLVING; POLYNOMIAL SYSTEMS SOLVING; RECTANGULAR BLOCK;

ALGORITHMS; COMPUTATIONAL GEOMETRY; CRYPTOGRAPHY; POLYNOMIALS;

GAUSSIAN DISTRIBUTION;

EID: 77956261219     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1837210.1837225     Document Type: Conference Paper

References (13)

1. M. Albrecht and G. Bard. The M4RI Library - Version 20090409. The M4RI Team, 2009.
2. B. Buchberger. An Algorithmical Criterion for the Solvability of Algebraic Systems. Aequationes Mathematicae, 4(3):374-383, 1970. (German).
3. D. Cox, J. Little, and D. O'Shea. Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra. Springer, 7 1997.
4. J.-G. Dumas, T Gautier, M. Giesbrecht, P. Giorgi, B. Hovinen, E. Kaltofen, B. Saunders, W. J. Turner, and G. Villard. Linbox: A Generic Library For Exact Linear Algebra, 2002.
5. J.-G. Dumas, P. Giorgi, and C. Pernet. Dense Linear Algebra over Word-Size Prime Fields: the FFLAS and FFPACK Packages. ACM Trans. Math. Softw., 35(3):1-42, 2008.
6. 4). Journal of Pure and Applied Algebra, 139(l-3):61-88, 1999.
7. 5. In Proceedings of the ACM SIGSAM International Symposium on Symbolic and Algebraic Computation, 2002.
8. J.-C. Faugère, F. Levy-dit Vehel, and L. Perret. Cryptanalysis of Minrank. In D. Wagner, editor, Advances in Cryptology CRYPTO 2008, volume 5157 of Lecture Notes in Computer Science, pages 280-296, Santa-Barbara, USA, 2008. Springer-Verlag.
9. J.-C. Faugère, M. Safey El Din, and P.-J. Spaenlehauer. Computing Loci of Rank Defects of Linear Matrices using Gröbner Bases and Applications to Cryptology. In S. Watt, editor, ISSAC '10: Proceedings of the 2010 international symposium on Symbolic and algebraic computation, New York, NY, USA, 2010. ACM.
10. K. Katsura. Theory of spin glass by the method of the distribution function of an effective field. Progress of Theoretical Physics, 87:139-154, 1986. Supplement.
11. S. Lachartre. Algèbre linéaire dans la résolution de systèmes polynomiaux Applications en cryptologie. PhD thesis, Université Paris 6, 2008.
12. W. Stein et al. Sage Mathematics Software (Version 3.3). The Sage Group, 2009. http://www.sagemath.org.
13. R. C. Whaley, A. Petitet, and J. J. Dongarra. Automated Empirical Optimization of Software and the ATLAS Project. Parallel Computing, 27(l-2):3-35, 2001. Also available as University of Tennessee LAPACK Working Note #147, UT-CS-00-448, 2000 (www.netlib.org/lapack/lawns/lawnl47.ps).