| 摘要 |
A method for the implementation of modular multiplication according to the Montgomery method, wherein a multiplicand A and a multiplier B are encoded respectively on a and b words of k bits, the most significant words of A and B being non-zero, a modulo N is encoded on m words of k bits, the modulo having (m-m') most significant words with k zero bits, with 0<m'<m. The method includes steps of multiplication in a multiplication circuit having a serial input to receive data elements encoded on at least m' words of k bits, a parallel input to receive encoded words of k bits, and a serial output, wherein, during the performance of the multiplication, a predetermined number p of words is given successively to the parallel input of the multiplication circuit, p being independent of m and greater than or equal to the number a.
|
