Efficient RSA Algorithm Designs and Analyses for Computer Security Applications

Most modern cryptographic protocols, which require a large number of processing steps, are based on modular evaluation. In fact modular arithmetic is the most dominant part of the computation which is performed in cryptographic applications especially for RSA encryption system. The operation is time-consuming for large operands. Therefore, a significant problem is how to reduce the time needed to perform modular arithmetic. These algorithms in the modular arithmetic are binary method, common multiplicand multiplication method, and signed-digit recoding method, addition chain method, and Montgomery algorithm. Most importantly, many relevant computer security papers and reports are issued in many journals to describe how to reduce the computational complexities in the cryptosystems.

並列關鍵字

RSA ； information security ； algorithm design ； cryptosystem ； number theory

參考文獻

S.-M.Yen,C.-S. Laih,A. K. Lenstra(1994).Multi-exponentiation.IEE Proceedings Computer Digital Technology.141(6),325-326.

Google Scholar

T. Yamk,E. Savas,C. K. Koc(2002).Incomplete reduction in modular arithmetic.IEE Proceedings: Computers and Digital Technique.149(2),46-52.

Google Scholar

R. L. Rivest,A. Shamir,L. Adleman(1978).A method for obtaining digital signatures and public-key cryptosystems.Communications of the ACM.21,120-126.

Google Scholar

W. Diffie,M. E. Hellman(1976).New directions in cryptography.IEEE Transactions on Information Theory.22(6),644-654.

Google Scholar

R. Katti,X. Ruan(2004).Left-to right binary signed-digit recording for elliptic curve cryptography.Proceedings of the 2004 International Symposium on Circuit and Systems.2,365-368.

Google Scholar

國際替代計量

Efficient RSA Algorithm Designs and Analyses for Computer Security Applications

全文下載

主題瀏覽