Parallel Modular Multiplication on Multi-core Processors

Author

Giorgi, P. ; Imbert, L. ; Izard, T.

Author_Institution

UM2, LIRMM, Montpellier, France

fYear

2013

fDate

7-10 April 2013

Firstpage

135

Lastpage

142

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.

Keywords

digital arithmetic; microprocessor chips; multiprocessing systems; parallel processing; Barrett; Montgomery; k-ary multipartite multiplication; low level arithmetic operations; multicore processors; parallel modular multiplications; software parallelism; Algorithm design and analysis; Complexity theory; Parallel processing; Program processors; Software algorithms; Synchronization; Modular multiplication; bipartite; k-ary multipartite algorithms; multi-core; parallel arithmetic; tripartite;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer Arithmetic (ARITH), 2013 21st IEEE Symposium on

Conference_Location

Austin, TX

ISSN

1063-6889

Print_ISBN

978-1-4673-5644-2

Type

conf

DOI

10.1109/ARITH.2013.20

Filename

6545901