Access Point Passphrase Matching to Cut Authentication Delays
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing authentication systems in wireless networks face computational intensity and time-consuming pre-shared key matching processes, leading to connectivity delays and scaling constraints, particularly in managing a large number of access points and pre-shared keys.
Innovation Solution
A computer network device, such as an access point, performs key matching by receiving passphrase information requests, identifying passphrases, and establishing secure connections, offloading the computational burden from authentication computers.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If the authentication computer performs pre-shared key matching by systematically performing calculations on multiple possible pre-shared keys, then authentication can be achieved, but the process becomes computationally intense and time-consuming
Solution Approach 1:
The patent applies preliminary action by pre-computing and storing cryptographic hashes of all possible pre-shared keys in a lookup table during system initialization. When authentication is needed, the system directly compares the hash of the provided key against pre-computed hashes, eliminating the need for systematic calculations during the actual authentication process. This resolves the contradiction by performing the computationally intensive work in advance, making authentication both accurate and fast.
2Reliability
If the authentication computer performs systematic key matching calculations, then authentication is achieved, but the authentication computer becomes overwhelmed or a bottleneck
Solution Approach 1:
The patent applies segmentation by dividing the authentication system into two parts: a centralized authentication computer that stores pre-computed key hashes, and distributed authenticators (access points) that perform local hash comparisons. This segmentation allows the computational burden to be distributed, preventing the authentication computer from becoming a bottleneck while maintaining secure authentication through the centralized hash storage.
3Adaptability or versatility
If the authentication computer stores multiple pre-shared keys for matching, then more devices can be authenticated, but scaling is constrained due to computational overhead
Solution Approach 1:
The patent applies copying by creating and storing cryptographic hash copies of pre-shared keys in a centralized lookup table. Instead of storing and processing multiple actual pre-shared keys across the network, the system stores hash copies that can be rapidly compared. This allows the system to support a large number of devices while reducing computational complexity, as hash comparison is much simpler than systematic key matching.
Data Source
AI summary
A computer network device that performs key matching is described. While attempting to establish a secure connection with an electronic device, the computer network device may receive a connection-request message associated with the electronic device. In response, the computer network device may provide a context message addressed to a computer, where the context message requests stored passphrase information associated with the electronic device. Then, the computer network device may receive, associated with the computer, a context response. When the context response indicates that there is no stored passphrase information associated with the electronic device, the computer network device may perform the key matching to identify the passphrase associated with the electronic device. Next, the computer network device may provide, addressed to the computer, the identified passphrase associated with the electronic device or an encryption key corresponding to the identified passphrase for storage by the computer.