Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Modular SIMD arithmetic in Mathemagix

Abstract : Modular integer arithmetic occurs in many algorithms for computer algebra, cryptography, and error correcting codes. Although recent microprocessors typically offer a wide range of highly optimized arithmetic functions, modular integer operations still require dedicated implementations. In this article, we survey existing algorithms for modular integer arithmetic, and present detailed vectorized counterparts. We also present several applications, such as fast modular Fourier transforms and multiplication of integer polynomials and matrices. The vectorized algorithms have been implemented in C++ inside the free computer algebra and analysis system Mathemagix. The performance of our implementation is illustrated by various benchmarks.
Complete list of metadata

Cited literature [54 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01022383
Contributor : Grégoire Lecerf <>
Submitted on : Thursday, July 10, 2014 - 12:32:57 PM
Last modification on : Wednesday, November 18, 2020 - 10:32:02 PM
Long-term archiving on: : Friday, October 10, 2014 - 11:38:01 AM

File

simd-2014-06-29.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01022383, version 1

Collections

Citation

Joris van der Hoeven, Grégoire Lecerf, Guillaume Quintin. Modular SIMD arithmetic in Mathemagix. 2014. ⟨hal-01022383⟩

Share

Metrics

Record views

669

Files downloads

603