Method and system for updating preshared key

Abstract

The invention relates to a method and a system for updating a preshared key. The method comprises the following steps: both communication sides take prime numbers which correspond to a preshared key to be updated as prime number parameters P for Diffie-Hellman Key exchange algorithm; both communication sides use prime number parameters P, positive integers g which are less than the prime number parameters P and random numbers sx and sy generated by respective communication side for calculating PX and PY, wherein PX= g<sx>(mod P) and PY = g<sy>(mod P); and both communication sides exchange the PX and the PY and take (PY)<sx>(mod P)= (PX)<sy>(mod P) as a new preshared key.

Description

technical field [0001] The present invention relates to a wireless local area network (Wireless Local Area Networks, WLAN for short), in particular to a method for generating a pre-shared key in a wireless local area network. Background technique [0002] As a typical implementation form of broadband wireless IP (Internet Protocol, Internet Protocol) network, wireless local area network refers to a computer local area network using wireless transmission media. It can communicate in areas where wiring is difficult, and is an important supplement to traditional wired local area networks. . Wireless local area network technology is the product of the combination of computer network technology and wireless communication technology. It has the advantages of supporting mobile computing, flexible and fast architecture, low maintenance costs and good scalability. It provides means for the mobility and personalization of communication. . [0003] With the gradual deepening of globa...

AI Technical Summary

Problems solved by technology

[0015] 1. Since the AP usually does not have input / output devices such as keyboards and screens, it is usually necessary to update the pre-shared key in the AP on the PC (personal computer) connected to the AP, which is difficult to guarantee security and complicated to operate;

[0016] 2. It is impossible to realize the frequent and dynamic update of the pre-shared key

[0034] Although the Diffie-Hellman key exchange algorithm cannot prove its security in theory, it is currently considered as a secure key exchange algorithm because it is based on the discrete logarithm problem.

However, in order to ensure the security of the Diffie-Hellman key exchange algorithm, the prime number parameter P usually needs to be a large prime number above 512Bit (bits), so the amount of calculation is very large, and usually requires a dedicated chip implementation, which increases the cost of equipment

Images