A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
RSA cryptosystem design based on the Chinese remainder theorem
Proceedings of the 2001 Asia and South Pacific Design Automation Conference
High-Radix Montgomery Modular Exponentiation on Reconfigurable Hardware
IEEE Transactions on Computers
Handbook of Applied Cryptography
Handbook of Applied Cryptography
Cryptography and Network Security: Principles and Practice
Cryptography and Network Security: Principles and Practice
Modern Cryptography: Theory and Practice
Modern Cryptography: Theory and Practice
An Excellent Resource for Parallel Computing
IEEE Distributed Systems Online
On performance analysis of heterogeneous parallel algorithms
Parallel Computing
An Efficient Decryption Method for RSA Cryptosystem
AINA '05 Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 1
Reconfigurable Hardware for Addition Chains Based Modular Exponentiation
ITCC '05 Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01
Applications of The Montgomery Exponent
ITCC '05 Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01
Analysis of Fractional Window Recoding Methods and Their Application to Elliptic Curve Cryptosystems
IEEE Transactions on Computers
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
A massively parallel hardware for modular exponentiations using the m-ary method
ICA3PP'10 Proceedings of the 10th international conference on Algorithms and Architectures for Parallel Processing - Volume Part II
| Hi-index | 0.00 |
We know the necessity for information security becomes more widespread in these days, especially for hardware-based implementations such as smart cards chips for wireless applications and cryptographic accelerators. Fast modular exponentiation algorithms are often considered of practical significance in public-key cryptosystems. The RSA cryptosystem is one of the most widely used technologies for achieving information security. The main task of the encryption and decryption engine of RSA cryptosystem is to compute M E mod N. Because the bit-length of the numbers M, E, and N would be about 512 to 1024 bits now, the computations for RSA cryptosystem are time-consuming. In this paper, an efficient technique for parallel computation of the modular exponentiation is proposed and our algorithm can reduce time complexity. We can have the speedup ratio as 1.06 or even 2.75 if the proposed technique is used. In Savas-Tenca-Koc algorithm, they design a multiplier with an insignificant increase in chip area (about 2.8%) and no increase in time delay. Our proposed technique is faster than Savas-Tenca-Koc algorithm in time complexity and improves efficiency for RSA cryptosystem.