Chinesische Reste und moderne Kryptographie (Q1182571)

The aim of this article is to give evidence of the role that the Chinese remainder theorem plays in connection with the RSA-algorithm and its applications. It is demonstrated that the Chinese remainder theorem is a basic ingredient for RSA in four different directions: i) to show that RSA satisfies the criteria for a public key crypto system, ii) for an approach to cryptanalyse RSA in one of its versions, iii) for an implementation of the necessary arithmetic of large integers, iv) for a key distribution protocol.