The invention relates to a cryptographic method with at least one computing step containing a modular exponentiation E according to E=x.sup.d(mod pq), with a first prime factor p, a second prime factor q, an exponent d and a number x, whereby the modular exponentiation E is calculated according to the Chinese Remainder Theorem.