Introduction to finite fields and their applications
Introduction to finite fields and their applications
A set of level 3 basic linear algebra subprograms
ACM Transactions on Mathematical Software (TOMS)
Lattices of compatibly embedded finite fields
Journal of Symbolic Computation - Special issue on computational algebra and number theory: proceedings of the first MAGMA conference
Modern computer algebra
Discrete Logarithms: The Past and the Future
Designs, Codes and Cryptography - Special issue on towards a quarter-century of public key cryptography
Implementation of Strassen's algorithm for matrix multiplication
Supercomputing '96 Proceedings of the 1996 ACM/IEEE conference on Supercomputing
A parallel block algorithm for exact triangularization of rectangular matrices
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
On efficient sparse integer matrix Smith normal form computations
Journal of Symbolic Computation - Special issue on computer algebra and mechanized reasoning: selected St. Andrews' ISSAC/Calculemus 2000 contributions
Recursive Blocked Data Formats and BLAS's for Dense Linear Algebra Algorithms
PARA '98 Proceedings of the 4th International Workshop on Applied Parallel Computing, Large Scale Scientific and Industrial Problems
A block Lanczos algorithm for finding dependencies over GF(2)
EUROCRYPT'95 Proceedings of the 14th annual international conference on Theory and application of cryptographic techniques
On parallel block algorithms for exact triangularizations
Parallel Computing
Polynomial time algorithms for network information flow
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
LU based algorithms for characteristic polynomial over a finite field
ACM SIGSAM Bulletin
FFPACK: finite field linear algebra package
ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
Smith normal form of dense integer matrices fast algorithms into practice
ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
A BLAS based C library for exact linear algebra on integer matrices
Proceedings of the 2005 international symposium on Symbolic and algebraic computation
Efficient computation of the characteristic polynomial
Proceedings of the 2005 international symposium on Symbolic and algebraic computation
Half-GCD and fast rational recovery
Proceedings of the 2005 international symposium on Symbolic and algebraic computation
Algorithms for symbolic/numeric control of affine dynamical systems
Proceedings of the 2005 international symposium on Symbolic and algebraic computation
Solving sparse rational linear systems
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Implementation techniques for fast polynomial arithmetic in a high-level programming environment
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Communication-efficient parallel generic pairwise elimination
Future Generation Computer Systems - Special section: Information engineering and enterprise architecture in distributed computing environments
Solving toeplitz- and vandermonde-like linear systems with large displacement rank
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
Efficient matrix rank computation with application to the study of strongly regular graphs
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
Faster algorithms for the characteristic polynomial
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
Proceedings of the twenty-first international symposium on Symbolic and algebraic computation
Dense Linear Algebra over Word-Size Prime Fields: the FFLAS and FFPACK Packages
ACM Transactions on Mathematical Software (TOMS)
Solving structured linear systems with large displacement rank
Theoretical Computer Science
Memory efficient scheduling of Strassen-Winograd's matrix multiplication algorithm
Proceedings of the 2009 international symposium on Symbolic and algebraic computation
An algorithm to solve integer linear systems exactly using numerical methods
Journal of Symbolic Computation
Exact sparse matrix-vector multiplication on GPU's and multicore architectures
Proceedings of the 4th International Workshop on Parallel and Symbolic Computation
Optimization of triangular matrix functions in BLAS library on Loongson2F
NPC'10 Proceedings of the 2010 IFIP international conference on Network and parallel computing
Algebraic and numerical algorithms
Algorithms and theory of computation handbook
Nullspace computation over rational function fields for symbolic summation
ACM Communications in Computer Algebra
Simultaneous modular reduction and Kronecker substitution for small finite fields
Journal of Symbolic Computation
Faster arithmetic for number-theoretic transforms
Journal of Symbolic Computation
| Hi-index | 0.00 |
In this paper we study different implementations of finite field arithmetic, essential foundation of computer algebra. We focus on Galois fields of word size cardinality at most, with any characteristic. Classical representations as machine integers, floating point numbers, polynomials and Zech logarithms are compared. Furthermore, very efficient implementations of finite field dot products, matrix-vector products and matrix-matrix products (namely the symbolic equivalent of level 1, 2 and 3 BLAS) are presented. Our implementations have many symbolic linear algebra applications: symbolic triangularization, system solving, exact determinant computation, matrix normal form are such examples.