CN117336720A - Network connection method and system and electronic equipment - Google Patents
Network connection method and system and electronic equipment Download PDFInfo
- Publication number
- CN117336720A CN117336720A CN202311300366.6A CN202311300366A CN117336720A CN 117336720 A CN117336720 A CN 117336720A CN 202311300366 A CN202311300366 A CN 202311300366A CN 117336720 A CN117336720 A CN 117336720A
- Authority
- CN
- China
- Prior art keywords
- password
- access device
- wireless access
- strings
- character string
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 60
- 238000012163 sequencing technique Methods 0.000 claims abstract description 8
- 238000004891 communication Methods 0.000 claims description 3
- 238000005336 cracking Methods 0.000 description 33
- 230000006870 function Effects 0.000 description 10
- 238000004590 computer program Methods 0.000 description 6
- 238000004422 calculation algorithm Methods 0.000 description 4
- 241000282326 Felis catus Species 0.000 description 3
- 241000234295 Musa Species 0.000 description 3
- 235000018290 Musa x paradisiaca Nutrition 0.000 description 3
- 238000004364 calculation method Methods 0.000 description 3
- 241000220225 Malus Species 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000011084 recovery Methods 0.000 description 2
- 238000010586 diagram Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 230000002427 irreversible effect Effects 0.000 description 1
- 238000013507 mapping Methods 0.000 description 1
- 238000010295 mobile communication Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W12/00—Security arrangements; Authentication; Protecting privacy or anonymity
- H04W12/06—Authentication
- H04W12/068—Authentication using credential vaults, e.g. password manager applications or one time password [OTP] applications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
- H04L9/3236—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials using cryptographic hash functions
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W12/00—Security arrangements; Authentication; Protecting privacy or anonymity
- H04W12/04—Key management, e.g. using generic bootstrapping architecture [GBA]
Landscapes
- Engineering & Computer Science (AREA)
- Computer Security & Cryptography (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The embodiment of the application provides a network connection method and system and electronic equipment, wherein the method comprises the following steps: acquiring a plurality of character strings; acquiring a common password set; determining a probability of use of each of the strings based on the common set of passwords and the plurality of strings; sequencing the character strings according to the order of the probability of use from high to low to obtain a password dictionary; based on the password dictionary, network connection authentication is performed with the wireless access device. In the method, the time consumption for decoding the password can be reduced and the decoding efficiency can be improved by constructing the password dictionary which is arranged according to the sequence of the using probability of the character strings from large to small and decoding the password based on the password dictionary.
Description
Technical Field
The embodiment of the application relates to the technical field of network connection, in particular to a network connection method and system and electronic equipment.
Background
When the wireless network is connected, in the password cracking, violent traversal and dictionary traversal are two cracking modes which are most commonly used in the current password recovery. The violent traversal is to traverse all passwords in rules formulated by a user, and the dictionary traversal is to traverse the passwords in the dictionary file. The violent mode often needs more rules to cover the password space as large as possible to improve the success rate of password recovery, but too large password space can cause multiplication of traversal time, even hundreds of years of time is needed, and password cracking is meaningless. Thus, dictionary traversal is currently commonly used.
However, the current dictionary traversal mode uses the password dictionary to be arranged according to the alphabetical order, and because the traversal is from the beginning to the end, the cracking process can be a large number of invalid operations in the arrangement mode, so that the cracking time is high.
Disclosure of Invention
The embodiment of the application provides a network connection method and system and electronic equipment, which can reduce cracking time.
In a first aspect, an embodiment of the present application provides a network connection method, including: acquiring a plurality of character strings; acquiring a common password set; determining a probability of use of each of the strings based on the common set of passwords and the plurality of strings; sequencing the character strings according to the order of the probability of use from high to low to obtain a password dictionary; and carrying out network connection authentication with the wireless access device based on the password dictionary.
In this embodiment, the character strings in the constructed dictionary are arranged in order of from large to small according to the probability of use, and when the wireless access device is connected through the dictionary ordered according to the probability of use, the time for cracking the password can be reduced, and the cracking and connection efficiency can be improved.
In some embodiments, the obtaining a plurality of character strings includes: acquiring a plurality of characters, wherein the characters comprise one of letters, numbers and symbols; and arranging and combining the plurality of characters to construct a plurality of character strings.
In this embodiment, by automatically generating a plurality of character strings based on a plurality of characters, the cost of manual input can be reduced, and the number of passwords of a subsequent password dictionary can be increased.
In some embodiments, the common password set includes a plurality of common passwords, the probability of use of the character string is a similarity value of the character string, and determining the probability of use of each of the character strings based on the common password set and the plurality of character strings includes: and carrying out similarity comparison on each character string and the plurality of common passwords to obtain a similarity value of each character string.
In this embodiment, the similarity between the character strings and the common password is compared to determine the use probability of each character string, so that the accuracy of calculating the use probability can be improved.
In some embodiments, the common password set includes a plurality of common passwords and a number of uses corresponding to the common passwords, and determining the use probability of each of the character strings based on the common password set and the plurality of character strings includes: comparing each character string with each common password to obtain the corresponding use times of each character string; acquiring the total use times of each common password; and obtaining the use probability of each character string according to the corresponding use times and the total use times of each character string.
In this embodiment, the use probability of each character string is determined in the above manner, so that the speed of calculating the use probability can be increased.
In some embodiments, the sorting each of the character strings includes: and if the use probabilities of the plurality of character strings are equal, sequencing the plurality of character strings with the equal use probabilities according to a preset sequence, wherein the preset sequence is one of alphabetical sequence, numerical sequence and character number sequence.
In this embodiment, under the condition of equal use probabilities, the character strings are ordered according to a preset order, so that a plurality of character strings in the password dictionary can be orderly arranged.
In some embodiments, the authenticating the network connection with the wireless access device based on the cryptographic dictionary includes: acquiring the times of an access application process; based on the times, obtaining an (n+1) th character string in the password dictionary, wherein N is the times; based on the (N+1) th character string, sending an access application command to the wireless access device; if authentication failure information of the wireless access device is received, carrying out an access application process again; and if the authentication success information of the wireless access device is received, completing network connection.
In this embodiment, the strings in the dictionary may be grabbed from scratch and an attempt may be made to access the wireless access device until the crack is successful or all strings are traversed.
In some embodiments, the sending an access application command to the wireless access device based on the n+1th string includes: calculating the (N+1) th character string to obtain a hash value corresponding to the (N+1) th character string; obtaining the access application command according to the hash value; and sending the access application command to the wireless access device, wherein the access application command is used for enabling the wireless access device to apply for accessing to a network.
In this embodiment, by performing hash calculation on the n+1th character string, the hash value corresponding to the password stored in the wireless access device can be compared with the hash value corresponding to the password stored in the wireless access device, so that the wireless access device can store the corresponding hash value without storing the password, and the security of network connection can be improved.
In a second aspect, embodiments of the present application provide an electronic device, including: at least one processor; and a memory communicatively coupled to the at least one processor; wherein the memory stores instructions executable by the at least one processor to enable the at least one processor to perform the method according to any one of the embodiments of the first aspect.
In a third aspect, embodiments of the present application provide a network connection system, where the network connection system includes a wireless access device and an electronic apparatus according to the second aspect; the electronic equipment is connected with the wireless access device through wireless communication.
In this embodiment, the electronic device may reduce the time required for cracking the password and improve the cracking efficiency based on cracking the password of the wireless access device according to the password dictionary with the use probability ordered from large to small.
In some embodiments, the wireless access device is a WiFi access device.
In a fourth aspect, embodiments of the present application further provide a computer-readable storage medium storing computer-executable instructions for causing a computer to perform the method according to any one of the embodiments of the first aspect.
In a fifth aspect, embodiments of the present application also provide a computer program product comprising a computer program stored on a computer readable storage medium, the computer program comprising program instructions which, when executed by a computer, cause the computer to perform the method according to any one of the embodiments of the first aspect above.
Compared with the prior art, the beneficial effects of this application are: different from the situation of the prior art, the embodiment of the application provides a network connection method and system, and an electronic device, wherein the method comprises the following steps: acquiring a plurality of character strings; acquiring a common password set; determining a probability of use of each of the strings based on the common set of passwords and the plurality of strings; sequencing the character strings according to the order of the probability of use from high to low to obtain a password dictionary; and carrying out network connection authentication with the wireless access device based on the password dictionary. In the method, the time consumption for cracking the password can be reduced and the cracking efficiency can be improved by constructing the password dictionary which is arranged according to the sequence of the using probability of the character strings from large to small and cracking the password based on the password dictionary.
Drawings
One or more embodiments are illustrated by way of example and not limitation in the figures of the accompanying drawings, in which like references indicate similar elements/modules and steps, and in which the figures do not include the true to scale unless expressly indicated by the contrary reference numerals.
FIG. 1 is a method for constructing a dictionary of passwords provided in an embodiment of the application;
fig. 2 is a block diagram of an electronic device according to an embodiment of the present application.
Detailed Description
The present application is described in detail with reference to specific examples. The following examples will assist those skilled in the art in further understanding the present application, but are not intended to limit the present application in any way. It should be noted that variations and modifications could be made by those skilled in the art without departing from the spirit of the present application. These are all within the scope of the present application.
In order to facilitate an understanding of the present application, the present application will be described in more detail below with reference to the accompanying drawings and specific examples. Unless defined otherwise, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this application belongs. The terminology used in the description of the present application is for the purpose of describing particular embodiments only and is not intended to be limiting of the application. The term "and/or" as used in this specification includes any and all combinations of one or more of the associated listed items.
It should be noted that, if not conflicting, the various features in the embodiments of the present application may be combined with each other, which is within the protection scope of the present application. In addition, although functional block division is performed in the device schematic, in some cases, block division may be different from that in the device. Moreover, the words "first," "second," and the like as used herein do not limit the data and order of execution, but merely distinguish between identical or similar items that have substantially the same function and effect.
In the network connection process, for example, in wireless fidelity (Wireless Fidelity, wiFi) connection, when the electronic device needs to implement the internet function by wirelessly connecting to the wireless access device, a password needs to be sent to the wireless access device, and the wireless access device confirms whether the electronic device can perform the wireless internet function based on the password. If the user forgets the password, the user needs to use a password dictionary for cracking.
The cryptographic dictionary may be created by security researchers, by a cryptographic cracking tool developer, or by others, according to different sources and methods. It may contain common password patterns, common words, surnames, dates, number sequences, and other common password choices. In breaking WiFi passwords, an attacker typically uses this dictionary of passwords to try multiple possible combinations of passwords, which can be automated through a password breaking tool or custom script, trying each password in the dictionary.
In a password dictionary, the passwords are generally ordered according to the dictionary. Dictionary ordering, also known as lexicographic ordering or lexicographic ordering, is a common way of ordering strings. I.e. a group of strings are arranged in their alphabetical order, similar to the dictionary ordering used in normal times. In dictionary ordering, the first character of two strings is compared first, the second character is compared if it is the same, and so on until a difference occurs, the smaller string is arranged in front. If all characters are the same but one string has reached the end, then this string is considered to be the smaller one. For example, assume that there are three strings: banana, apple, cat, if arranged in a dictionary ordering manner, should be: apple, banana, cat since the letter a at the beginning of the apple is at the beginning of the other two strings, the apple is arranged at the forefront, b is larger than c on the second character, and banana is arranged at the second position, and cat is arranged at the rearmost.
In traversing using a cryptographic dictionary, it is generally traversed from beginning to end. If there is hit in the course of traversing, then the password is cracked successfully, if there is no hit after traversing from beginning to end, then the password is cracked and fails. The efficiency of this cracking algorithm depends entirely on the quality of the dictionary. It is therefore critical to improve the quality of the dictionary. However, the current dictionary is ordered according to alphabetical order, and the set passwords are generally quite natural, so that the cracking probability of the former passwords in the dictionary ordered according to alphabetical order is the same as the cracking probability of the latter passwords, and thus, when the dictionary is used for cracking WIFI, a large amount of comparison and operation may be invalid.
In order to solve the technical problems, the embodiments of the present application provide a network connection method, a system, and an electronic device, which can reduce the time for cracking the password and improve the cracking efficiency by cracking the password of the wireless access device using a password dictionary that is ordered according to the use probability of the password.
In a first aspect, an embodiment of the present application provides a network connection method, where an execution body of the method for constructing a cryptographic dictionary is an electronic device, and the electronic device may be a mobile phone, a computer, or other terminals, referring to fig. 1, and the method includes:
step S10: a plurality of character strings is acquired.
The character strings are combinations of characters such as letters, numbers, symbols, etc., and generally, the number of characters contained in the character strings should be not less than 8, and in practical applications, a plurality of character strings can be obtained by limiting the number of characters contained in the character strings. The plurality of character strings may be manually entered or automatically collected over a network.
Step S20: a common set of passwords is obtained.
The common secret code set includes a plurality of common secret codes, or in other embodiments, the common secret code set includes a plurality of common secret codes and corresponding times of use, and the common secret code set can be manually input or automatically collected through a network. Common passwords are also strings of characters, which are also combinations of characters such as letters, numbers, symbols, and the like.
Step S30: based on the common password set and the plurality of character strings, a probability of use of each character string is determined.
In some embodiments, if the common password set includes a plurality of common passwords, and the probability of use of the character string is a similarity value of the character string, the step includes: and carrying out similarity comparison on each character string and a plurality of common passwords in the common password set to obtain a similarity value of the character string. And obtaining the use probability of each character string after obtaining the similarity value of each character string according to the mode. Specifically, the similarity value may be one of a jekcard similarity coefficient, a sorenson-dice similarity coefficient, a levenson distance, a hamming distance, a cosine similarity coefficient, and the like. The specific calculation method of the similarity value may refer to the prior art, and is not limited herein. In this embodiment, the similarity between the character strings and the common password is compared to determine the use probability of each character string, so that the accuracy of calculating the use probability can be improved.
Alternatively, in some other embodiments, if the common password set includes a plurality of common passwords, and the number of uses corresponding to each common password, the step includes: comparing each character string with each common password to obtain the corresponding use times of each character string; acquiring the total use times of all common passwords; and obtaining the use probability of each character string according to the corresponding use times and the total use times of each character string.
Specifically, each character string can be compared with the common passwords in the common password set to determine whether the same character string exists, if so, the corresponding use times of the same character string are used as the corresponding use times of the character string, the total use times of each common password are determined based on the common password set, then the ratio of the corresponding use times of the character string to the total use times is calculated, the ratio is used as the use probability of the character string, and if not, the use probability of the character string is 0. In this embodiment, the use probability of each character string is determined in the above manner, so that the speed of calculating the use probability can be increased.
Step S40: and sequencing the character strings according to the order of the using probability from high to low to obtain the password dictionary.
Then, after the use probability of each character string is determined, the character strings are ordered according to the order of the use probability from high to low, and the password dictionary is obtained.
Step S50: based on the password dictionary, network connection authentication is performed with the wireless access device.
The wireless access device may be a device that provides a wireless hotspot, such as a WIFI router or the like. Specifically, a network connection authentication is performed with the wireless access device by traversing a plurality of character strings in the password dictionary.
In this embodiment, since the probability of cracking the front password in the password dictionary is different from the probability of cracking the rear password, the probability of cracking the front password is greater than the probability of cracking the rear password, so that when the wireless access device is connected with the password dictionary, the time for cracking the password can be reduced, and the cracking and connection efficiency can be improved.
In some of these embodiments, step S10 includes: step S11: acquiring a plurality of characters, wherein the characters comprise one of letters, numbers and symbols; step S12: and arranging and combining the plurality of characters to construct a plurality of character strings.
Specifically, the letters may be "a", "b", "c", etc., the numerals may be "1", "2", "3", etc., and the symbols may be "+|! "," - "," x ", etc. After a plurality of characters are obtained, the number of characters contained in the character string can be limited, and the plurality of characters are randomly arranged and combined to generate a plurality of character strings.
In this embodiment, by automatically generating a plurality of character strings based on a plurality of characters, the cost of manual input can be reduced, and the number of passwords of a subsequent password dictionary can be increased.
In some of these embodiments, sorting the strings includes step S41: and if the use probabilities of the plurality of character strings are equal, sequencing the plurality of character strings with the equal use probabilities according to a preset sequence, wherein the preset sequence is one of alphabetical sequence, numerical sequence and character number sequence.
If alphabetically, the first letters in the strings of equal usage probabilities can be aligned and ordered alphabetically. If the numbers are in order, the first numbers in the strings of equal usage probabilities can be aligned and sorted in order of the numbers from greater to lesser or from lesser to greater. If the number of characters is in sequence, the number of characters corresponding to the character strings with equal use probability can be compared, and the characters are ordered in sequence from big to small or from small to big.
Specifically, for the strings "ab2cdefg" and "ba1 cdefg", the probabilities of use of the two strings are equal, if the strings are ordered in alphabetical order, it is known that the string "ab2cdefg" should precede the string "ba1 cdefg", if the strings are ordered in numeric order, it is known that the string "ba1 cdefg" should precede the string "ab2cdefg", if the strings are ordered in order from small to large, since the number of characters of the string "ba1 cdefg" is 9 and the number of characters of the string "ab2cdefg" is 8, the string "ab2cdefg" should precede the string "ba1 cdefg". In practical application, the preset sequence can be set according to practical needs, and is not limited herein.
In this embodiment, under the condition of equal use probabilities, the character strings are ordered according to a preset order, so that a plurality of character strings in the password dictionary can be orderly arranged.
In some of these embodiments, step S50 includes: step S51: acquiring the times of an access application process; step S52: obtaining an (n+1) th character string in the password dictionary based on the times, wherein N is the times; step S53: based on the (n+1) th character string, sending an access application command to the wireless access device; step S54: if authentication failure information of the wireless access device is received, carrying out an access application process again; step S55: and if the authentication success information of the wireless access device is received, completing network connection.
N is an integer greater than or equal to 0. Specifically, if the password dictionary includes a first string, a second string, and a third string that are sequentially arranged. Firstly, if the number of times of access application process is 0 when the electronic equipment receives a first connection request of a user, acquiring a first character string in a password dictionary, namely the first character string, and sending an access application command to a wireless access device based on the first character string to finish the first access application process; if the electronic equipment receives the authentication success message of the wireless access device, the electronic equipment is indicated to be connected with the internet through the wireless access device, if the electronic equipment receives the authentication failure message of the wireless access device, the access application process is carried out again, at the moment, the number of times of the access application process is 1, then a second character string in the password dictionary, namely the second character string, is obtained, and an access application command is sent to the wireless access device based on the second character string, so that the second access application process is completed; if the electronic equipment receives the authentication success message of the wireless access device, the electronic equipment is indicated to be connected with the internet through the wireless access device, if the electronic equipment receives the authentication failure message of the wireless access device, the access application process is carried out again, at the moment, the number of times of the access application process is 2, then a third character string in the password dictionary, namely a third character string, is obtained, and an access application command is sent to the wireless access device based on the third character string, so that the third access application process is completed; if the electronic equipment receives the authentication success message of the wireless access device, the electronic equipment can be connected to the internet through the wireless access device, and if the electronic equipment receives the authentication failure message of the wireless access device, the electronic equipment prompts the user to break the failure and can not be connected.
It can be seen that in this embodiment, the strings in the dictionary can be grabbed from the beginning and an attempt made to access the wireless access device until the cracking is successful or all strings are traversed.
In some of these embodiments, sending an access application command to the wireless access device based on the n+1th string includes:
step S531: calculating the (N+1) th character string to obtain a hash value corresponding to the (N+1) th character string;
step S532: obtaining an access application command according to the hash value;
step S533: and sending an access application command to the wireless access device, wherein the access application command is used for enabling the wireless access device to apply for accessing to the network.
The hash function may map binary values of arbitrary length to shorter fixed length binary values, this small binary value being referred to as a hash value. Hash values are a unique and extremely compact representation of a piece of data. If a piece of plaintext is hashed and even only one letter of the piece is changed, the subsequent hash will produce a different value. It is computationally impossible to find two different inputs hashed to the same value, so the hash value of the data can verify the integrity of the data. Typically for fast look-up and encryption algorithms. It is a one-way cryptosystem, i.e. it is an irreversible mapping from plaintext to ciphertext, with only encryption and no decryption. Meanwhile, the hash function can obtain the output with fixed length after the input with any length is changed. This unidirectional feature of the hash function and the fixed length of the output data enable it to generate messages or data. The hash function algorithm can map binary plaintext of arbitrary length into shorter binary string algorithm, and different plaintext is difficult to map into the same hash value.
Specifically, after the (n+1) th character string is obtained, calculating the (n+1) th character string through a hash function to obtain a hash value corresponding to the (n+1) th character string, obtaining an access application command based on the hash value, and sending the access application command to a wireless access device, wherein the wireless access device judges whether the hash value corresponding to the correct password is consistent or not based on the hash value in the access application command, if so, sending an authentication success message to the electronic equipment, and if not, sending an authentication failure message to the electronic equipment.
In this embodiment, by performing hash calculation on the n+1th character string, the hash value corresponding to the password stored in the wireless access device can be compared with the hash value corresponding to the password stored in the wireless access device, so that the wireless access device can store the corresponding hash value without storing the password, and the security of network connection can be improved.
In a second aspect, an embodiment of the present application further provides an electronic device, referring to fig. 2, which shows a hardware structure of an electronic device capable of performing the network connection method according to any one of the embodiments of the first aspect.
The electronic device includes: at least one processor 11; and a memory 12 communicatively coupled to the at least one processor 11, one processor 11 being illustrated in fig. 2. The memory 12 stores instructions executable by the at least one processor 11 to enable the at least one processor 11 to perform the network connection method according to any one of the embodiments of the first aspect. The processor 11 and the memory 12 may be connected by a bus or otherwise, for example in fig. 2.
The memory 12 is used as a non-volatile computer readable storage medium for storing non-volatile software programs, non-volatile computer executable programs, and modules, such as program instructions/modules corresponding to the network connection method in the embodiments of the present application. The processor 11 executes various functional applications of the server and data processing by running non-volatile software programs, instructions and modules stored in the memory 12, i.e. implements the network connection method according to any of the embodiments of the first aspect.
The memory 12 may include a storage program area that may store an operating system, at least one application program required for functions, and a storage data area; the storage data area may store data created according to the use of the electronic device, etc. In addition, memory 12 may include high-speed random access memory, and may also include non-volatile memory, such as at least one magnetic disk storage device, flash memory device, or other non-volatile solid-state storage device. In some of these embodiments, memory 12 may optionally include memory located remotely from processor 11, which may be connected to the electronic device via a network. Examples of such networks include, but are not limited to, the internet, intranets, local area networks, mobile communication networks, and combinations thereof.
The one or more modules are stored in the memory 12 and when executed by the one or more processors 11 perform the network connection method according to any one of the embodiments of the first aspect described above.
The product can execute the method provided by the embodiment of the application, and has the corresponding functional modules and beneficial effects of the execution method. Technical details not described in detail in this embodiment may be referred to the network connection method according to any one of the embodiments of the first aspect of the present application.
In a third aspect, embodiments of the present application provide a network connection system, where the network connection system includes a wireless access device and an electronic apparatus according to the second aspect. The electronic device is connected with the wireless access device through wireless communication.
Specifically, the wireless access device is a WiFi access device, which may provide a WiFi hotspot. The electronic device may be a mobile phone, a computer, or the like. In this embodiment, the electronic device has the same structure and function as those of the electronic device described in the embodiment of the third aspect, and will not be described here again.
In this embodiment, the electronic device may reduce the time required for cracking the password and improve the cracking efficiency based on cracking the password of the wireless access device according to the password dictionary with the use probability ordered from large to small.
In a fourth aspect, embodiments of the present application also provide a non-transitory computer-readable storage medium storing computer-executable instructions for execution by one or more processors, e.g., performing the network connection method steps described in any of the embodiments of the first aspect above.
In a fifth aspect, embodiments of the present application further provide a computer program product, including a computer program stored on a non-volatile computer readable storage medium, the computer program including program instructions which, when executed by a computer, cause the computer to perform a method of constructing a cryptographic dictionary or a network connection method in any of the method embodiments described above, for example, performing the network connection method steps described in any of the embodiments of the first aspect above.
It should be noted that the above-described apparatus embodiments are merely illustrative, and the units described as separate units may or may not be physically separate, and units shown as units may or may not be physical units, may be located in one place, or may be distributed over a plurality of network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of this embodiment.
From the above description of embodiments, it will be apparent to those skilled in the art that the embodiments may be implemented by means of software plus a general purpose hardware platform, or may be implemented by hardware. Based on such understanding, the foregoing technical solution may be embodied essentially or in a part contributing to the related art in the form of a software product, which may be stored in a computer readable storage medium, such as ROM/RAM, a magnetic disk, an optical disk, etc., including several instructions for executing the method described in each embodiment or some parts of the embodiments with at least one computer device (which may be a personal computer, a server, or a network device, etc.).
Finally, it should be noted that: the above embodiments are only for illustrating the technical solution of the present application, and are not limiting thereof; the technical features of the above embodiments or in the different embodiments may also be combined under the idea of the present application, the steps may be implemented in any order, and there are many other variations of the different aspects of the present application as described above, which are not provided in details for the sake of brevity; although the present application has been described in detail with reference to the foregoing embodiments, it should be understood by those of ordinary skill in the art that: the technical scheme described in the foregoing embodiments can be modified or some technical features thereof can be replaced by equivalents; such modifications and substitutions do not depart from the spirit of the corresponding technical solutions from the scope of the technical solutions of the embodiments of the present application.
Claims (11)
1. A method of network connection, comprising:
acquiring a plurality of character strings;
acquiring a common password set;
determining a probability of use of each of the strings based on the common set of passwords and the plurality of strings;
sequencing the character strings according to the order of the probability of use from high to low to obtain a password dictionary;
and carrying out network connection authentication with the wireless access device based on the password dictionary.
2. The method of claim 1, wherein the obtaining a plurality of character strings comprises:
acquiring a plurality of characters, wherein the characters comprise one of letters, numbers and symbols;
and arranging and combining the plurality of characters to construct a plurality of character strings.
3. The method of claim 1, wherein the common set of passwords comprises a plurality of common passwords, the probability of use of the string is a similarity value for the string, and wherein determining the probability of use of each string based on the common set of passwords and the plurality of strings comprises:
and carrying out similarity comparison on each character string and the plurality of common passwords to obtain a similarity value of each character string.
4. The method of claim 1, wherein the common set of passwords comprises a plurality of common passwords, a number of uses corresponding to the common passwords, wherein determining a probability of use for each of the strings based on the common set of passwords and the plurality of strings comprises:
comparing each character string with each common password to obtain the corresponding use times of each character string;
acquiring the total use times of each common password;
and obtaining the use probability of each character string according to the corresponding use times and the total use times of each character string.
5. The method of any of claims 1-4, wherein said sorting each of said strings comprises:
and if the use probabilities of the plurality of character strings are equal, sequencing the plurality of character strings with the equal use probabilities according to a preset sequence, wherein the preset sequence is one of alphabetical sequence, numerical sequence and character number sequence.
6. The network connection method according to any one of claims 1 to 4, wherein the performing network connection authentication with the wireless access device based on the dictionary of passwords includes:
acquiring the times of an access application process;
based on the times, obtaining an (n+1) th character string in the password dictionary, wherein N is the times;
based on the (N+1) th character string, sending an access application command to the wireless access device;
if authentication failure information of the wireless access device is received, carrying out an access application process again;
and if the authentication success information of the wireless access device is received, completing network connection.
7. The network connection method according to claim 6, wherein the transmitting an access application command to the wireless access device based on the n+1th character string includes:
calculating the (N+1) th character string to obtain a hash value corresponding to the (N+1) th character string;
obtaining the access application command according to the hash value;
and sending the access application command to the wireless access device, wherein the access application command is used for enabling the wireless access device to apply for accessing to a network.
8. An electronic device, comprising:
at least one processor; the method comprises the steps of,
a memory communicatively coupled to the at least one processor; wherein,
the memory stores instructions executable by the at least one processor to enable the at least one processor to perform the method of any one of claims 1 to 7.
9. A network connection system comprising a wireless access device, the electronic device of claim 8;
the electronic equipment is connected with the wireless access device through wireless communication.
10. The network connection system of claim 9, wherein the wireless access device is a WiFi access device.
11. A computer-readable storage medium storing computer-executable instructions for causing a computer to perform the method of any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311300366.6A CN117336720A (en) | 2023-10-09 | 2023-10-09 | Network connection method and system and electronic equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311300366.6A CN117336720A (en) | 2023-10-09 | 2023-10-09 | Network connection method and system and electronic equipment |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN117336720A true CN117336720A (en) | 2024-01-02 |
Family
ID=89278742
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202311300366.6A Pending CN117336720A (en) | 2023-10-09 | 2023-10-09 | Network connection method and system and electronic equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN117336720A (en) |
-
2023
- 2023-10-09 CN CN202311300366.6A patent/CN117336720A/en active Pending
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US9524393B2 (en) | System and methods for analyzing and modifying passwords | |
| US9286466B2 (en) | Registration and authentication of computing devices using a digital skeleton key | |
| JP4822450B2 (en) | Cryptographic protocol execution method between two electronic entities | |
| JP6238867B2 (en) | Sequential biometric cryptographic system and sequential biometric cryptographic processing method | |
| EP3261287A1 (en) | Cryptographic primitive for user authentication | |
| US20070133807A1 (en) | Tag authentication apparatus and method for radio frequency identification system | |
| CN112380833B (en) | Similar text searching method and device for sentence-by-sentence comparison | |
| US9843574B1 (en) | Methods and apparatus for generating chaff passwords for use in a password-hardening system | |
| CN109150903A (en) | A kind of account management method, device, storage medium and terminal device | |
| CN112685612B (en) | Feature code searching and matching method, device and storage medium | |
| US20220004621A1 (en) | Data recovery through reversal of hash values using probabilistic data structures | |
| CN111723360A (en) | Voucher code processing method and device and storage medium | |
| CN112948083A (en) | Data processing method and device and electronic equipment | |
| CN114741704A (en) | Privacy protection method, device, equipment and medium based on marriage and love dating | |
| CN111708921B (en) | Number selection method, device, equipment and storage medium | |
| CN117336720A (en) | Network connection method and system and electronic equipment | |
| CN110234082B (en) | Addressing method and device of mobile terminal, storage medium and server | |
| CN107294705B (en) | Method, device and system for generating and verifying key | |
| CN110909387A (en) | Method and device for saving and recovering private data based on secure multi-party computing | |
| CN115242450A (en) | Password data input method, device and storage medium | |
| CN113971296A (en) | ID fuzzification data processing system | |
| CN111143786B (en) | Account verification password generation method and account verification method based on verification password | |
| CN114884646B (en) | System password storage method based on improved MD5 encryption processing | |
| CN114978658B (en) | Data processing method and device | |
| Bai et al. | Cost-asymmetric memory hard password hashing |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |