Abstract : In this work, we present the M4RIE library which implements efficient algorithms for linear algebra with dense matrices over GF(2^e) for 2 <= 2 <= 10. As the name of the library indicates, it makes heavy use of the M4RI library both directly (i.e., by calling it) and indirectly (i.e., by using its concepts). We provide an open-source GPLv2+ C library for efficient linear algebra over GF(2^e) for e small. In this library we implemented an idea due to Bradshaw and Boothby which reduces matrix multiplication over GF(p^k) to a series of matrix multiplications over GF(p). Furthermore, we propose a caching technique - Newton-John tables - to avoid finite field multiplications which is inspired by Kronrod's method ("M4RM") for matrix multiplication over GF(2). Using these two techniques we provide asymptotically fast triangular solving with matrices (TRSM) and PLE-based Gaussian elimination. As a result, we are able to significantly improve upon the state of the art in dense linear algebra over GF(2^e) with 2 <= e <= 10.
Contributeur : Martin Albrecht <>
Soumis le : jeudi 5 février 2015 - 11:21:43
Dernière modification le : mercredi 14 décembre 2016 - 01:07:20
Document(s) archivé(s) le : mercredi 6 mai 2015 - 10:11:33
Martin R. Albrecht. The M4RIE library for dense linear algebra over small fields with even characteristic. ISSAC '12: Proceedings of the 2012 international symposium on Symbolic and algebraic computation, Jul 2012, Grenoble, France. pp.28 - 34, 2012, <10.1145/2442829.2442838>. <hal-01113282>