| 摘要 |
The invention relates to a method of encrypting the data transmission in a data processing unit such as particularly a smart card. While optimally utilizing the working memory, the method elucidated hereinbefore allows computation of the multiplicative inverse value u-1(mod v) of an integer u modulo v which is required for performing an RSA algorithm. A Euclidic algorithm for computing the greatest common divisor of u and v is performed with two variables a, b, which are initialized with u and v. In parallel, values ax, ay, bx, by are computed in each iteration step, which values always comply with the equations a=u.ax-v.ay -b=u.bx-v.by At the end of the algorithm the searched multiplicative inverse value is: u-1(mod v)=-bx.
|
