Academic
Publications
Parallel modular exponentiation using load balancing without precomputation

Parallel modular exponentiation using load balancing without precomputation,10.1016/j.jcss.2011.07.002,Journal of Computer and System Sciences,Pedro L

Parallel modular exponentiation using load balancing without precomputation  
BibTex | RIS | RefWorks Download
The modular exponentiation operation of the current algorithms for asymmetric cryptography is the most expensive part in terms of computational cost. The RSA algorithm, for example, uses the modular exponentiation algorithm in encryption and decryption procedure. Thus, the overall performance of those asymmetric cryptosystems depends heavily on the performance of the specific algorithm used for modular exponentiation. This work proposes new parallel algorithms to perform this arithmetical operation and determines the optimal number of processors that yields the greatest speedup. The optimal number is obtained by balancing the processing load evenly among the processors. Practical implementations are also performed to evaluate the theoretical proposals.
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.