Encryption process for simple modular operation using Montgomery method
The process is performed on the Pfield as defined by the Montgomery method where Pfield (A,B)n = A asterisk B asterisk I mod n, where I is a determinable error. The process performs a double shift on the least significant bits of words A and N. This makes it unnecessary to perform addition on later...
Saved in:
Main Author | |
---|---|
Format | Patent |
Language | English French |
Published |
13.08.1999
|
Edition | 6 |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | The process is performed on the Pfield as defined by the Montgomery method where Pfield (A,B)n = A asterisk B asterisk I mod n, where I is a determinable error. The process performs a double shift on the least significant bits of words A and N. This makes it unnecessary to perform addition on later cells of significant size.
L'invention propose un nouveau procédé de mise en oeuvre d'une opération élémentaire, dite Pfield, définie par la méthode de Montgomery par Pfield (A, B) N = A * B * I mod N, où I est une erreur déterminable. Dans le procédé de l'invention, on décale deux fois de suite les mots de poids le plus faible des données A et N qui sont contenus dans des sous-registres élémentaires 10-1 et 12-1. Le procédé de l'invention rend inutile l'ajout de cellules de retard de taille importante. |
---|---|
Bibliography: | Application Number: FR19980002149 |