Finite field linear algebra subroutines
- 10 July 2002
- proceedings article
- Published by Association for Computing Machinery (ACM)
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- On Efficient Sparse Integer Matrix Smith Normal Form ComputationsJournal of Symbolic Computation, 2001
- Efficient Arithmetic in Finite Field Extensions with Application in Elliptic Curve CryptographyJournal of Cryptology, 2001
- Automated empirical optimizations of software and the ATLAS projectParallel Computing, 2001
- Lattices of Compatibly Embedded Finite FieldsJournal of Symbolic Computation, 1997
- Primitive polynomials over finite fieldsMathematics of Computation, 1992
- Some comments on Zech's logarithmsIEEE Transactions on Information Theory, 1990
- A set of level 3 basic linear algebra subprogramsACM Transactions on Mathematical Software, 1990
- A generalization of the fast LUP matrix decomposition algorithm and applicationsJournal of Algorithms, 1982
- Exact solution of linear equations usingP-adic expansionsNumerische Mathematik, 1982
- A remark on the Hensel factorization methodMathematics of Computation, 1978