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

參考文獻

B. Premkumar(2002).A formal framework for conversion from binary to residue numbers.IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing.49(2)

Google Scholar

D.-C. Lou,C.-C. Chang(1996).Fast exponentiation method obtained by folding the exponent in half.Electronics Letters.32(11),984-985.

Google Scholar

D.-C. Lou,C.-L. Wu(2004).Parallel exponentiation using common-multiplicand-multiplication and signed-digit-folding techniques.International Journal of Computer Mathematics.81(10),1187-1202.

Google Scholar

D.-Z. Sun,Z.-F. Cao,Y. Sun(2006).How to compute modular exponentiation with large operators based on the right-to-left binary algorithm.Applied Mathematics and Computation.176(1),280-292.

Google Scholar

G. Chen,B. Guoqiang,H. Chen(2007).A new systolic architecture for modular division.IEEE Transactions on Computers.56(2),282-286.

Google Scholar

國際替代計量

Efficient RSA Algorithm Designs and Analyses for Computer Security Applications

全文下載

主題瀏覽