摘要
As an outstanding asymmetric cryptography, RSA algorithm has a lot of virtues and thus is well applied in the scope of IC card applications. The paper deals with the application of RSA in smart cards and the approach in which the modular exponentiation of huge number is simplified by using the Chinese Remainder Theorem. We have already succeeded in completing RSA in IC cards. Results indicate that RSA algorithm applied in IC cards has the equivalent speed of DES algorithm with the same environment.
As an outstanding asymmetric cryptography, RSA algorithm has a lot of virtues and thus is well applied in the scope of IC card applications. The paper deals with the application of RSA in smart cards and the approach in which the modular exponentiation of huge number is simplified by using the Chinese Remainder Theorem. We have already succeeded in completing RSA in IC cards. Results indicate that RSA algorithm applied in IC cards has the equivalent speed of DES algorithm with the same environment.