Research articles
ScienceAsia (): 103-106 |doi:
10.2306/scienceasia1513-1874...103
Numerical analysis of parallel modular exponentiation for RSA using interconnection networks
Masumeh Damrudi*, Norafida Ithnin
ABSTRACT: Security is important for transferring confidential information such as passwords through unreliable networks. The prominent way to overcome this issue is cryptographic algorithms. While a longer key consumes more time in cryptosystem operations for attackers, the RSA as a public key is more secure and uses a longer key. This paper focuses on the numerical analysis of using parallel processing as well as interconnection networks for RSA cryptographic algorithms to achieve suitable results in terms of speed. Numerical results are employed to show that the analysed approach is faster than accepted approach which is the binary method.
Download PDF
4 Downloads 1676 Views
| Department of Computer System and Communication, Faculty of Computing, Universiti Teknologi Malaysia, 81310, UTM, Skudai, Johor Darultakzim, Malaysia |
* Corresponding author, E-mail: m.damrudi@gmail.com
Received 7 Jan 2013, Accepted 5 Apr 2013
|
