| 摘要 |
The invention a method for accelerating exponentiation calculations in arithmetic modulo, a number N stored on q words. The exponentiations are especially involved in cryptography protocols implemented by means of computer resources. According to said method, a first algorithm is suitable for replacing an argument, stored on 2q words, by a result which is congruent modulo N to said argument and the q low-order words of which are null and a first operator takes two entries each stored on q words and outputs a number W, stored on q words, the product by R of which is congruent modulo N to the product of both entries, whereby R is a power of two higher than N. Said method allows computation power and memory space to be saved. |
