Cipher key negotiation method, system, customer terminal and server for cipher key negotiation

Abstract

The embodiment of the invention discloses a key agreement method, which comprises sending a client calling message to a server, receiving information returned by the server, including key agreement mode of a code mechanism based on user's identity, receiving a server key exchange message sent by the server, obtaining a master key, and sending a client key exchange message to the server. The embodiment of the invention further discloses an another key agreement method, which comprises receiving a client calling message sent by a client terminal, selecting ciphertex family using the key agreement mode of the code mechanism based on user's identity from a ciphertext family list, and then sending to a client, sending a server key exchange message to the client, receiving a client key exchange message sent by the client, and obtaining a master key according to information carried in the client key exchange message. The invention further discloses a system used for the key agreement, and a relative client and a server, which can make the process of the key agreement more rapid, safer and more highly-effective.

Description

technical field [0001] The present invention relates to the technical field of communication, in particular to a key agreement method suitable for Transport Layer Security Protocol (TLS, Transport Layer Security Protocol), a system for key agreement, a client and a server. Background technique [0002] TLS is a widely used protocol in the field of communication technology. It provides authentication, data confidentiality and integrity protection for the application layer. Protect the algorithm and key. Since the key is non-public information, the two parties need to negotiate the key when establishing communication, so that the two parties can obtain the same safe and accurate key. [0003] At present, there are mainly five key negotiation methods used in the handshake protocol: RSA (Rirest A SllalnlrL Adleman, Rongse A) method, anonymous Diffie-Hellman method (Anonymous Diffie-Hellman, DH_anon), fixed DH method (Diffie-Hellman, DH_anon). -Hellman with signature, DH), ephem...

AI Technical Summary

Problems solved by technology

This series of verification operations requires a lot of storage and processor resources, especially for the limited processing power of mobile terminals and the limited transmission speed of mobile networks, resource consumption is even more prominent

[0045] 2. Using the DH algorithm for key negotiation cannot authenticate the two parties in the communication. If a malicious middleman pretends to be a client or server to attack the other party, it will not be recognized. Therefore, using the DH algorithm for key negotiation is vulnerable to attacks by the middleman, and the system security is relatively low. Low

[0046] 3. To use the shared key method for key negotiation, it is necessary to have the conditions for deploying a key known to both parties in advance. This requires different methods depending on the specific environment. In some environments, it is difficult to achieve, especially in the network more difficult to achieve in

When the shared key method is used at the same time, because both parties in the communication know the shared key in advance, it is impossible to prevent one party from denying that it has done a certain action, that is, there is a problem of non-repudiation

Images