Integration into the Chinese remainder theorem and Montgomery algorithm for fast RSA algorithm
Yu Li · Microcomputer & its Applications · 2010
Make use of the idea of Chinese remainder theorem and Montgomery modular multiplication algorithm to improved RSA cryptosystem:on the one hand, improved after the Chinese remainder theorem algorithm for time efficiency has improved greatly, the speed increase is about 4 times more than before;the other hand, by joining the Montgomery modular multiplication algorithm for modular multiplication so that we have had good speed and security improvements, and more suitable for high-speed RSA cryptosystem.