Compressed Modular Matrix Multiplication

Jean-Guillaume Dumas 1, * Laurent Fousse 1 Bruno Salvy 2
* Corresponding author
2 ALGORITHMS - Algorithms
Inria Paris-Rocquencourt
Abstract : We propose to store several integers modulo a small prime into a single machine word. Modular addition is performed by addition and possibly subtraction of a word containing several times the modulo. Modular Multiplication is not directly accessible but modular dot product can be performed by an integer multiplication by the reverse integer. Modular multiplication by a word containing a single residue is a also possible. Therefore matrix multiplication can be performed on such a compressed storage. We here give bounds on the sizes of primes and matrices for which such a compression is possible. We also explicit the details of the required compressed arithmetic routines.
Document type :
Conference papers
Complete list of metadatas

Cited literature [10 references]  Display  Hide  Download
Contributor : Jean-Guillaume Dumas <>
Submitted on : Thursday, March 13, 2008 - 5:56:32 PM
Last modification on : Thursday, July 4, 2019 - 9:54:02 AM
Long-term archiving on : Friday, November 25, 2016 - 10:53:10 PM


Files produced by the author(s)


  • HAL Id : hal-00259950, version 2
  • ARXIV : 0803.1975



Jean-Guillaume Dumas, Laurent Fousse, Bruno Salvy. Compressed Modular Matrix Multiplication. MICA'2008 - Milestones in Computer Algebra, May 2008, Tobago, Trinidad and Tobago. pp.133-140. ⟨hal-00259950v2⟩



Record views


Files downloads