The application claims priority to Chinese patent application No. 2023116475118, filed on Dec. 4, 2023, the entire contents of which are incorporated herein by reference.
The present invention relates to the field of WAPI local area network devices, and in particular, to a WAPI trusted wireless local area network device.
WAPI is an encryption standard under Wi-Fi technologies. A WAPI terminal completes identity authentication when accessing a network, which is widely used, and it is necessary to ensure the security of data transmission when the WAPI terminal accesses the network.
When an existing WAPI terminal accesses the network, mutual authentication is completed after the WAPI terminal, an access point, and a server are started. The server encrypts data requested by the WAPI terminal by using an encryption protocol specified by a WAPI protocol, and then sends the encrypted data to another WAPI terminal via the access point, which can improve the security of data transmission. However, this data encryption method is based on a given confidentiality agreement to encrypt data. When the confidentiality agreement is disclosed, overall data can be easily obtained, and it is not flexible in data protection.
In “DATA SECURITY MANAGEMENT METHOD, SYSTEM, AND DEVICE FOR WAPI TERMINAL ACCESS NETWORK” as disclosed in Chinese Patent Application No. CN202310799395.5, the method includes splitting access information into access data and an access name, and performing encryption on the access information based on a preset encryption rule and a random shielding index to form encrypted access data for transmission. However, this method does not describe a generation mode of the random shielding index. If the index is generated randomly by using a system or software, it is difficult to ensure that both random shielding indexes generated by two WAPI terminals are the same, which will cause another WAPI terminal device to be unable to decode; and if the index is preset by a user in advance, the random shielding index will become a fixed constant, which does not have a self-updating ability, needs to be replaced by the user regularly, and is more troublesome in use.
An objective of the present invention is to provide a WAPI trusted wireless local area network device, to solve the problems raised in the above background.
To achieve the above objectives, the present invention provides a technical solution as follows:
A WAPI trusted wireless local area network device includes a sending device and a receiving device, where the sending device includes:
Preferably, a logic for generating the key is as follows:
where a subscript H represents a data number corresponding to the key.
Preferably, a logic for obtaining the superposition start bit Pd is as follows: calculating an average value of a sum of a1˜a6 in the sending time Th, marked as Pd′, that is:
and obtaining the superposition start bit Pd after rounding the average value Pd′ according to a rounding-off method.
Preferably, a logic for obtaining the check bit Py is as follows: generating a calculated value Py based on the data number H, with a calculation formula being:
Py=log H+1
obtaining the check bit Py after rounding the calculated valuePy′ according to a rounding-off method, and calculating a theoretical length Pc′ based on the check bit Py, with a calculation formula being:
Pc′=ePy
and after rounding the theoretical length Pc according to the rounding-off method, taking its single digit as the check length Pc.
Preferably, a logic for the primary encryption is as follows:
Preferably, a logic for data decoding is as follows:
Preferably, a logic for checking data is as follows:
Compared with the prior art, the present invention has the following beneficial effects: Different keys are generated based on a sending time of initial data, primary encryption is performed on the initial data by using a key, and then secondary encryption is performed based on a preset encryption protocol. The key has a self-updating ability according to the time, which can make an encryption manner of each group of initial data different, and improve the security of data transmission. Besides, a check bit is set based on a serial number of the data, which can detect data after data transmission, prevent the data from being missing or tampered in a transmission process, and further improve the security of data transmission.
In order to make the objectives, technical solutions, and advantages of the present invention clearer and more comprehensible, the present invention is described in further detail below with reference to the specific embodiments.
It should be noted that unless otherwise defined, the technical or scientific terms used in the present invention shall have the common meanings as understood by those skilled in the art to which the present invention belongs. The terms “first”, “second”, and the like used in the present invention are not intended to indicate any sequence, amount or importance, but distinguish different components. As used herein, “include”, “comprise”, and the like mean that an element or item appearing before the word covers an element, an item, or an equivalent thereof listed after the word without excluding other elements or items. As used herein, “connection”, “connected”, and the like are not limited to a physical or mechanical connection but may include a direct or indirect electrical connection. As used herein, “up”, “down”, “left”, “right”, and the like are merely used to represent a relative positional relationship, and when an absolute position of a described object changes, the relative positional relationship may also change accordingly.
Referring to
A WAPI trusted wireless local area network device includes a sending device and a receiving device, where
A logic for generating the key is as follows:
A logic for obtaining the superposition start bit Pd is as follows: calculating an average value of a sum of a1˜a6 in the sending time Th, marked as Pd′, that is:
and obtaining the superposition start bit Pd after rounding the average value Pd′ according to a rounding-off method.
A logic for obtaining the check bit Py is as follows: generating a calculated value Py based on the data number H, with a calculation formula being:
Py′=log H+1
In this embodiment, the average value is Pd′=(23+10+11+12+53+16)/6=20.833, the superposition start bit Pd=21 is obtained after rounding the average value Pd′, the calculated value is Py′=log 1+1=1, the check bit Py=1 is obtained after rounding the calculated value, the theoretical length is Pc′=e, the single digit of the theoretical length is taken as the check length Pc, the check length is Pc=3, and the key is MH=21,1,3,23,10,11,12,53,16,1.
A logic for the primary encryption is as follows:
In this embodiment, a length of the initial data “HELLO” is N=5, the conversion character string generated according to the ASCII code table is Sz=72,69,76,76,79, b1=72, b2=69, . . . , b5=79, the check bit is Py=1, and the check length is Pc=3, therefore, the check character segment is b′=72,69,76, the superposition start bit is Pd=21, which is greater than the length N of the initial data, and counting is continued from left to right. In other words, when the superposition start bit Pd is greater than the length N of the initial data, a bit “Pd−kN” is used as a new superposition start bit. When the check bit Py is greater than the length N of the initial data, it is treated in a similar manner, and k is a positive integer. When the check character segment b′ exceeds the length of the conversion character string Sz, filling is continued from a leftmost bit of the conversion character string Sz. Therefore, in this embodiment, the conversion character string Sz and the sending time Th are superposed from a first bit, the superposition character string after being superposed is Sz=95,79,87,88,132,16, q=5, and N′=6, and the primary encryption character string Sz1=72,69,76,21,1,3,23,10,11,12,53,16,1,95,79,87,88,132,16 is finally obtained.
A logic for data decoding is as follows:
A specific implementation method is to perform reverse operation according to the method of the above embodiment.
A logic for checking data is as follows:
In this embodiment, the check bit Py=1, the check length Pc=3, the check character segment b=72,69,76, and the conversion character string Sz=72,69,76,76,79 are received by the data check module, when the corresponding character segment b1=72, b2=69, b3=76 is equal to the check character segment b′, it is considered that the data is not missing or tampered in the transmission process, and the conversion character string Sz is restored according to the ASCII codes and transmitted to the data output module, otherwise, the alarm signal is issued to the alarm module.
To sum up, a specific process of this embodiment is as follows:
All or some of the foregoing embodiments may be implemented by means of software, hardware, firmware, or any combination thereof. When software is used to implement the embodiments, the foregoing embodiments may be implemented completely or partially in a form of a computer program product. A person of ordinary skill in the art may be aware that in combination with examples described in embodiments disclosed in this specification, units and algorithm steps can be implemented by electronic hardware or a combination of computer software and electronic hardware. Whether the functions are performed by hardware or software depends on particular applications and design constraints of the technical solutions.
The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, that is, may be located in one position, or may be distributed on a plurality of network units. Some or all of the units may be selected depending on actual requirements to achieve the objectives of the solutions in the embodiments.
The above is only the specific implementation method of the present application, but the scope of protection of the present application is not limited to this. Any changes or replacements that can be easily thought by those skill in the art within the scope of disclosure of the present application should fall within the scope of protection of the present application.
| Number | Date | Country | Kind |
|---|---|---|---|
| 202311647511.8 | Dec 2023 | CN | national |
| Number | Name | Date | Kind |
|---|---|---|---|
| 10079810 | Moore | Sep 2018 | B1 |
| 11366897 | Ramanathan | Jun 2022 | B1 |
| 11601266 | Stapleton | Mar 2023 | B1 |
| 11895232 | Stapleton | Feb 2024 | B1 |
| 11947656 | Finchelstein | Apr 2024 | B2 |
| 12126713 | Ramanathan | Oct 2024 | B1 |
| 20090251282 | Fitzgerald | Oct 2009 | A1 |
| 20150106616 | Nix | Apr 2015 | A1 |
| 20170109735 | Sheng | Apr 2017 | A1 |
| 20180241488 | Daoura | Aug 2018 | A1 |
| 20190349426 | Smith | Nov 2019 | A1 |
| 20210320794 | Auh | Oct 2021 | A1 |
| 20210374497 | Syed | Dec 2021 | A1 |
| 20220255650 | Daoura | Aug 2022 | A1 |
| 20220263700 | Dabbs | Aug 2022 | A1 |
| 20230140203 | Peng | May 2023 | A1 |
| 20230171101 | Auh | Jun 2023 | A1 |
| Number | Date | Country |
|---|---|---|
| 104955049 | Sep 2015 | CN |
| 113726512 | Nov 2021 | CN |
| 116108416 | May 2023 | CN |
| Entry |
|---|
| Fahmy, Syahrul et al. Wireless network attack: Raising the awareness of Kampung WiFi residents. 2012 International Conference on Computer & Information Science (ICCIS). https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6297124 (Year: 2012). |
| Liu, Runhao et al. iWEP: An Intelligent WLAN Early Warning Platform Using Edge Computing. 2019 15th International Conference on Mobile Ad-Hoc and Sensor Networks (MSN). https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=9066146 (Year: 2019). |
| Djellab, Rima; Benmohammed, Mohammed. Securing Encryption Key Distribution in WLAN via QKD. 2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery. https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6384961 (Year: 2012). |
| Ojha, Nitish Kumar; Baray, Elyas. An Overview of Protocols-Based Security Threats and Countermeasures in WLAN. 2023 4th International Conference for Emerging Technology (INCET). https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10170514 (Year: 2023). |
| Number | Date | Country | |
|---|---|---|---|
| 20250184127 A1 | Jun 2025 | US |
| Number | Date | Country | |
|---|---|---|---|
| Parent | PCT/CN2024/124899 | Oct 2024 | WO |
| Child | 19031211 | US |