Elliptic Curve Cryptography is the use of finite field instead of a finite group of elliptic curves discrete logarithm problem based cryptography in a finite group and obtained a class of cryptosystems. The classical discrete logarithm problem in finite prime fields can be solved in an expected time which is subexponential in the group size via the socalled index calculus method. In contrast, it is not known if the discrete logarithm problem in the groups of rational points of elliptic curves over finite fields can be solved in subexponential expected time in the group size.See the article at home and abroad based on the large number of documents, combined with a lot of experience in reverse engineering, reverse engineering the software described in detail in a number of key technologies including software, anti-protection technology, static and dynamic disassembly, software debugging techniques and program understanding technology. Explore dongle protected software access, call and data access methods to study the dongle query the custom authentication algorithm and authentication interactive software security.This article in accordance with the ideas and methods of public key cryptography, the design of the end of the dongle and procedures within the elliptic curve discrete logarithm based interactive authentication protocol, to ensure that the internal software register module and dongle up the security of the data exchange, making the dongle is software provides greater security. |