Unlock instant, AI-driven research and patent intelligence for your innovation.

Encryption key agreement method

A technology of key agreement and agreement, which is applied in the field of information security, can solve problems such as complex operation, poor practicability, and difficult security risks, and achieve the effect of simple operation, low calculation overhead and space requirements, and high security

Inactive Publication Date: 2003-11-12
WUHAN UNIV OF TECH
View PDF0 Cites 7 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0006] Among them, the Diffie-Hellman method is the earliest key agreement method. It is based on the discrete logarithm problem DLP on the finite multiplication group. It has computational security and is currently widely used. Difficult to resist "man-in-the-middle" attacks, with security issues
The MQV method uses two pairs of keys, a static key and a dynamic key, to complete the handshake process and identity authentication process. The steps are cumbersome, the operation is complicated, and the practicability is not strong.
The STS method completes the key agreement through a three-way handshake, which requires complex digital signature and identity verification processes, and sometimes requires a dedicated time stamp server, and the communication cost is high
All of these greatly increase the communication cost of the handshake process of the communication session, and the overly complex cryptographic protocol method will also leave hidden security risks that are difficult to detect

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Encryption key agreement method
  • Encryption key agreement method
  • Encryption key agreement method

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0019] Implementation on finite multiplicative groups:

[0020] System parameters: Randomly select a large prime number p, and the generator g is a positive integer smaller than p. private keySK A and SK B is a random positive integer less than p-1. Then the public key PK A and PK B Get it as follows:

[0021] Key agreement process:

[0022] a) A randomly selects a positive integer k smaller than p-1 A , and obtain B's public key PK from the certification authority CA B , and then calculate S A = ( P K B ) k A mod p , and put S A send to B.

[0023] b) B randomly selects a positive integer k smaller than p-1 B , and obtain A's public key PK from the certification authority CA A , and then calculate S ...

Embodiment 2

[0026] Implementation on finite groups of elliptic curves:

[0027] System parameters: Randomly select a large prime number p, elliptic curve E(GF(p):y 2 =x 3 +ax+b(mod p) is a secure elliptic curve defined on the finite field GF(p), on which the base point randomly selected is G, let n=#E(GF(p) be the order of the elliptic curve E, r is a large prime factor of n. The private key SK A and SK B is a random positive integer less than r-1. Then the public key PK A and PK B Get it as follows:

[0028] The key agreement process is as follows:

[0029] a) A randomly selects a positive integer k A ∈[1, r-1], and obtain B's public key PK from the certification authority CA B , calculate S A =k A PK B , and put S A send to B.

[0030] b) B randomly selects a positive integer k B ∈[1, r-1], and obtain the public key PK of A from the certification authority CA A , and then calculate S B =k B PK A , and put S B Send to A.

[0031] c) A receives S from B B , with yo...

Embodiment 3

[0035] Implementation on finite groups of hyperelliptic curves:

[0036]System parameters: Randomly select a large prime number p, hyperelliptic curve C: y 2 +h(x)y=f(x)modp is a safe hyperelliptic curve whose genus is g defined on the finite field GF(p), where f(x) is the first polynomial whose degree is 2g+1, h(x) is a polynomial of degree at most g. Assuming that the order #J(C; GF(p)) of the Jacobian group J(C; GF(p)) of the hyperelliptic curve C is n, r is a large factor of n. Randomly select a base point D∈J(C; GF(p)) on the hyperelliptic curve C. private keySK A and SK B is a random positive integer less than r-1. Then the public key PK A and PK B Get it as follows:

[0037] Then the key agreement process is as follows:

[0038] a) A randomly selects a positive integer k A ∈[1, r-1], and obtain B's public key PK from the certification authority CA B , calculate S A =k A PK B , and put S A send to B.

[0039] b) B randomly selects a positive integer k ...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

In the method, both communication parties are set as A and B with their private key as SKa as well as public key as PKa and PKb which are stored in the third credible party of certification centre, of which PK=Sk-1XG. The temporary session key agreement is operated as the follows when both parties is communicated with unsafe channel: 1) random selecting an integer Ka by A and obtaining public key PKb of B from Ca, calculating Sa=KaXPKa and sending Sa to B; 2) random selecting an integer Kb by B, obtaining public key PKa of A from CA, calculating Sb=KbXPKa and sending Sb to A; 3) for Sb received by A from B to used his own privato key SKa to calculate Kab=KaXSKaXSb and calculating Kba=KbXSKbXSa by B with private key SKb to obtain temporary session key K=KaXKbXG for this time of communication.

Description

technical field [0001] The invention belongs to the key communication negotiation technology in the field of information security, in particular to a key agreement method. Background technique [0002] In an information security system, a key is the only credential for legal access. Under the Kerckhoff cryptographic security analysis assumption, the security of an information security system depends on the protection of the key itself, rather than the security protection of the system or communication hardware. Under this premise, the cryptographic system and algorithm itself can be disclosed, the access policy can be announced, and the cryptographic device may be lost, but the information security system can still continue to operate normally without being affected. However, once the key is leaked, the security system will be destroyed: not only legal users cannot access the system and extract information, but also the information in the system will ...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Applications(China)
IPC IPC(8): H04L9/00H04L9/14
Inventor 肖攸安李腊元
Owner WUHAN UNIV OF TECH