| 摘要 |
The invention relates to a cryptographic method comprising at least one arithmetic step which contains a modular exponentiation E, according to the equation E=x<d>(mod p.q), comprising a first prime factor p, a second prime factor q, an exponent d and a number x. According to said method, the modular exponentiation E is calculated according to the Chinese Remainder Theorem. |
