Paper Info
Title
A fast optimal parallel algorithm for a short addition chain.
Abstract
Given a natural number , an addition chain for is a finite sequence of numbers having the following properties: (1) the first number is one, (2) every element is the sum of two earlier elements, and (3) the given number occurs at the end of the sequence. We introduce a fast optimal algorithm to generate a chain of short length for the number of -bits. The algorithm is based on the right–left binary strategy and barrel shifter circuit. The algorithm uses processors and runs in time under exclusive read exclusive write parallel random access machine.
Year
DOI
Venue
2018
https://doi.org/10.1007/s11227-017-2129-0
The Journal of Supercomputing
Keywords
Field
DocType
Short chain,Parallel algorithm,Binary method,Parallel random access machine
Natural number,Finite sequence,Parallel random-access machine,Computer science,Parallel algorithm,Parallel computing,Barrel shifter,e,Distributed computing,Addition chain,Binary number
Journal
Volume
Issue
ISSN
74
1
0920-8542
Citations 
PageRank 
References 
2
0.43
7
Authors
1
Name
Order
Citations
PageRank
Hazem M. Bahig1247.61