Time point system for ellipse curve password system

Abstract

The invention relates to a point-timing system of an elliptic curve cryptosystem, which pertains to the point-timing technical field of an elliptic curve cryptosystem and is characterized in that: the invention includes a controller of a point-timing register, a point-timing multipath option controller, a first multipath selector group, a middle variable register group and a second multipath selector group; under gating control signals output by the point-timing multipath option controller and in the process of six production lines, point-timing algorithm for multipliers and addends of the second multipath selector group is carried out by a modular multiplier and a modular adder positioned outside the point-timing system. In each production line, under the control of the gating control signals, the modular multiplier and the modular adder respectively return intermediate data to the first and the second multipath selector groups; under the control of operation control signals output by the controller of the point-timing register, each multipath selector controlling the first multipath selector group outputs relevant multipliers and addends to the second multipath selector group by the middle variable register group. The point-timing system of an elliptic curve cryptosystem of the invention increases point-timing arithmetic speed, optimizes point- multiplying performance of elliptic curves under a basic level and improves data throughput rate.

Description

technical field [0001] The invention relates to the technical field of digital signature and authentication. Background technique [0002] Cryptographic systems can be divided into traditional (or symmetric) encryption systems and public key (or asymmetric) encryption systems. In 1976, W.Diffie and M.E.Hellman proposed the concept of public key cryptography, which had a profound impact on the development of the entire cryptography. The currently widely used public key cryptosystem is RSA, which has the advantages of simple principle and convenient use. However, with the continuous improvement of the large integer factorization method and the continuous improvement of computer performance, the number of key bits required to ensure the security of RSA continues to increase. At present, it is generally believed that the number of bits of the RSA key is more than 1024 bits to ensure security. . The increase in the number of key bits directly leads to a sharp drop in encryptio...

AI Technical Summary

Problems solved by technology

[0046] Calculating the point addition and doubling of elliptic curves is in consideration of reducing the area. The method of serial calculation is generally used. However, the efficiency of serial calculation is relatively low. By analyzing the data correlation of point addition and doubling operations, you can It is concluded that many mutually independent operations in serial calculations are also considered to have dependencies, thereby causing a waste of clock cycles. The present invention proposes an effective solution for doubling calculations just based on this problem

Images