Shared key establishment method suitable for computing resource dissymmetric fields

Abstract

The invention discloses a shared key establishment method suitable for computing resource dissymmetric fields. The shared key establishment method is provided by adopting a knapsack problem and a discrete logarithm problem (comprising an elliptic curve discrete logarithm problem), which is characterized in that computing resources necessary for both protocol parties in an implementation process are dissymmetric, thereby greatly improving the implementation efficiency of one of the protocol parties. The shared key establishment method is particularly suitable for the computing resource dissymmetric fields of servers and mobile terminals in the Internet of Things, cloud computing and other security fields, and has more advantages than the traditional key exchange protocols such as Diffie Hellman key exchange protocol and the like in these fields. The method provided by the invention can be widely used in the field of information security systems such as network security, electronic commerce and so on.

Description

technical field [0001] The invention belongs to the technical field of information security, and in particular relates to a method for establishing a shared key applicable to the field of asymmetric computing resources. Background technique [0002] Aiming at the problem of complex key management in symmetric cryptographic algorithms, Diffie and Hellman proposed the idea of ​​"public key cryptosystem" in 1976, and proposed the Diffie-Hellman key exchange (key establishment) protocol to solve the problem of public channel key transmission problems. [0003] There are two defects in the traditional public key cryptosystem: [0004] (1) Compared with symmetric cryptography, public key cryptography is mostly designed based on difficult mathematical problems, and its implementation efficiency is low; [0005] (2) The algorithm itself does not consider the differences in the implementation environment. For example, for the classic Diffie-Hellman key exchange protocol, the comput...

AI Technical Summary

Problems solved by technology

[0004] (1) Compared with symmetric cryptography, public key cryptography is mostly designed based on difficult mathematical problems, and its implementation efficiency is low;

[0005] (2) The algorithm itself does not consider the differences in the implementation environment. For example, for the classic Diffie-Hellman key exchange protocol, the computing resources consumed by both parties in the process of implementing the protocol are the same, that is, both parties need to execute two large integer modular exponentiation

[0006] However, at present, many application fields such as the Internet of Things and cloud computing often present the characteristics of asymmetric computing resources, that is, the computing resources of the server end are strong, and the computing resources of the terminal are weak.

Images