Circuits, Communications and Systems, Pacific-Asia Conference on (2009)

Chengdu, China

May 16, 2009 to May 17, 2009

ISBN: 978-0-7695-3614-9

pp: 614-616

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/PACCS.2009.71

ABSTRACT

RSA is a strong public-key cryptosystem, which is generally used for authentication protocols. Most proposed implementations of RSA system are based on Montgomery modular algorithm. And thus the optimization of this algorithm is consequently very important. This paper improves the original algorithm with no increase of any computational cost by avoiding the final comparison and makes it more suitable for implementations both in software and hardware. Unlike previous works, our algorithm just omits the final comparison but subtraction.

INDEX TERMS

RSA; Montgomery Modular Multiplication; Optimized Algorithm

CITATION

X. Zhao and Q. Pu, "Montgomery Exponentiation with No Final Comparisons: Improved Results,"

*2009 Pacific-Asia Conference on Circuits, Communications and Systems (PACCS 2009)(PACCS)*, Chengdu, 2009, pp. 614-616.

doi:10.1109/PACCS.2009.71

CITATIONS