| 摘要 |
The aim of the invention is to enable to efficiently implement standard algorithms for the cryptography on processors having long number registers and limited computing capacity. Said cryptography is based on elliptic curves. The number field and the elliptic curve can be freely selected in such a way that said field and curve have to be advantageously read in only when a corresponding storage medium is personalised. The invention relates to the use of the extended, euclidian algorithm for detecting an inverse in the prime number field. Two numbers are successively stored in the long number registers of the respective processor. The described algorithm enables to obtain the results of two required operators in one calculating step and as a result calculation is accelerated. Further acceleration is obtained by externally storing the arithmetic unit of the long number arithmetic in the typically used processors. An arithmetic unit is formed by means of a separate register set. Reading in and out the operands into the separated arithmetic unit is time consuming. Half of the load cycles can be dropped by simultaneously processing two operands. |
