Parallel modular multiplication on multi-core processors - Archive ouverte HAL Access content directly
Conference Papers Year : 2013

Parallel modular multiplication on multi-core processors

Pascal Giorgi
Laurent Imbert
Thomas Izard
  • Function : Author
  • PersonId : 938633

Abstract

Current processors typically embed many cores running at high speed. The main goal of this paper is to assess the efficiency of software parallelism for low level arithmetic operations by providing a thorough comparison of several parallel modular multiplications. Famous methods such as Barrett, Montgomery as well as more recent algorithms are compared together with a novel k-ary multipartite multiplication which allows to split the computations into independent processes. Our experiments show that this new algorithm is well suited to software parallelism.
Fichier principal
Vignette du fichier
multipartite.pdf (316.58 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00805242 , version 1 (03-04-2013)

Identifiers

Cite

Pascal Giorgi, Laurent Imbert, Thomas Izard. Parallel modular multiplication on multi-core processors. IEEE Symposium on Computer Arithmetic, Apr 2013, Austin, TX, United States. pp.135-142, ⟨10.1109/ARITH.2013.20⟩. ⟨hal-00805242⟩
266 View
622 Download

Altmetric

Share

Gmail Facebook X LinkedIn More