CN114338015B - Method, device, equipment and storage medium for generating password dictionary - Google Patents
Method, device, equipment and storage medium for generating password dictionary Download PDFInfo
- Publication number
- CN114338015B CN114338015B CN202210006444.0A CN202210006444A CN114338015B CN 114338015 B CN114338015 B CN 114338015B CN 202210006444 A CN202210006444 A CN 202210006444A CN 114338015 B CN114338015 B CN 114338015B
- Authority
- CN
- China
- Prior art keywords
- password
- character
- coordinate point
- dictionary
- symbol
- 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.)
- Active
Links
Landscapes
- Document Processing Apparatus (AREA)
Abstract
The application provides a method, a device, equipment and a storage medium for generating a password dictionary, wherein the method comprises the following steps: after at least one preset first password is obtained, each first character on the first password is replaced by a second character carrying a symbol according to a preset character replacement rule aiming at each first password; converting the second character according to the symbol to obtain a second password composed of third characters; after the second passwords are stored in the candidate password dictionary, judging whether the number of the passwords in the candidate password dictionary is larger than or equal to the preset number; if the number of the passwords in the candidate password dictionary is greater than or equal to the preset number, taking the candidate password dictionary as the password dictionary; by the aid of the method for generating the password dictionary, labor workload is reduced, and generation efficiency of the password dictionary is improved.
Description
Technical Field
The present application relates to the field of cryptography, and in particular, to a method, an apparatus, a device, and a storage medium for generating a cryptographic dictionary.
Background
In the traditional password cracking technology (namely, violent cracking), the password is generally cracked by traversing the password dictionary, so that the password dictionary required during the password cracking needs to be generated in advance before the password cracking is performed; in the existing generation mode of the password dictionary, the password used for constructing the password dictionary is generated by manual exhaustion or manual enumeration, but in general, the password dictionary required for password cracking needs to contain a large number of passwords, so the generation mode of the password dictionary can cause large manual workload.
Disclosure of Invention
In view of this, the embodiments of the present application provide a method, apparatus, device, and storage medium for generating a dictionary, so as to reduce the manual workload and improve the generation efficiency of the dictionary.
Mainly comprises the following aspects:
in a first aspect, an embodiment of the present application provides a method for generating a cryptographic dictionary, including:
s1: after at least one preset first password is obtained, constructing a candidate password dictionary by using the at least one first password; wherein for each first password, the first password is composed of at least one first character;
S2: for each first password, according to a preset character replacement rule, replacing each first character on the first password with a second character carrying a symbol; converting the second character according to the symbol to obtain a second password composed of a third character; the third character is obtained by converting the second character;
s3: after the second passwords are stored in the candidate password dictionary, judging whether the number of the passwords in the candidate password dictionary is larger than or equal to a preset number;
s4: if the number is smaller than the preset number, taking the second password as a first password, and repeating the steps of S2, S3 and S4 in sequence until the number is larger than or equal to the preset number; and when the number is greater than or equal to the preset number, taking the candidate password dictionary as a password dictionary.
Optionally, the symbol includes a positive sign and a negative sign, and the converting the second character according to the symbol includes:
determining a first coordinate point corresponding to the second character and a first line segment where the first coordinate point is located in a preset coordinate system; each coordinate point in the preset coordinate system is used for representing a second character carrying a symbol, one end of the first line segment is the first coordinate point, the other end of the first line segment is the second coordinate point, the ordinate of the second coordinate point is the same as the ordinate of the first coordinate point, and the abscissa of the second coordinate point is larger than the abscissa of the first coordinate point by a preset value;
When the symbol is positive, the first coordinate point is taken as a rotation center, the first line section is rotated clockwise by a preset angle, and characters except the symbol in the second characters corresponding to the third coordinate point are taken as the third characters; the third coordinate point is the coordinate point closest to the other end, except the first coordinate, of the second line segment, and the second line segment is the first line segment after clockwise rotation;
when the symbol is a negative sign, the first coordinate point is taken as a rotation center, the first line segment is rotated anticlockwise by the preset angle, and characters except the symbol in the second characters corresponding to the fourth coordinate point are taken as the third characters; the fourth coordinate point is the coordinate point closest to the other end, except the first coordinate, of the third line segment, and the third line segment is the first line segment after anticlockwise rotation.
Optionally, the symbol includes a positive sign and a negative sign, and the converting the second character according to the symbol includes:
determining a first ASCII code of the second character;
when the symbol is positive, adding the first ASCII code with a preset numerical value to obtain a second ASCII code; and taking the character corresponding to the second ASCII code as the third character;
When the symbol is a negative sign, subtracting the first ASCII code from a preset numerical value to obtain a third ASCII code; and taking the character corresponding to the third ASCII code as the third character.
Optionally, before storing the second password in the candidate dictionary, the method for generating a dictionary further includes:
judging whether the candidate password dictionary has the same password as the second password;
and if the second password is not the same as the second password, storing the second password into the candidate password dictionary.
Optionally, the method for generating the password dictionary further comprises the following steps:
and after the password dictionary is stored, the password dictionary is sent to a server corresponding to the client.
In a second aspect, an embodiment of the present application provides a cryptographic dictionary generating apparatus, including:
the construction module is used for constructing a candidate password dictionary by using at least one first password after acquiring the preset at least one first password; wherein for each first password, the first password is composed of at least one first character;
the replacing module is used for replacing each first character on each first password with a second character carrying a symbol according to a preset character replacing rule; converting the second character according to the symbol to obtain a second password composed of a third character; the third character is obtained by converting the second character;
The first judging module is used for judging whether the number of the passwords in the candidate password dictionary is larger than or equal to the preset number after the second passwords are stored in the candidate password dictionary;
the execution module is used for taking the second password as a first password if the number is smaller than the preset number, and repeatedly executing S2, S3 and S4 in sequence until the number is larger than or equal to the preset number; when the number is greater than or equal to the preset number, the candidate password dictionary is used as a password dictionary; wherein, S2 is: for each first password, according to a preset character replacement rule, replacing each first character on the first password with a second character carrying a symbol; converting the second character according to the symbol to obtain a second password composed of a third character; the S3 is as follows: after the second passwords are stored in the candidate password dictionary, judging whether the number of the passwords in the candidate password dictionary is larger than or equal to a preset number; the S4 is as follows: if the number is smaller than the preset number, taking the second password as a first password, and repeating the steps of S2, S3 and S4 in sequence until the number is larger than or equal to the preset number; and when the number is greater than or equal to the preset number, taking the candidate password dictionary as a password dictionary.
Optionally, the symbol includes a positive sign and a negative sign, and the replacing module is specifically configured to, when configured to convert the second character according to the symbol:
determining a first coordinate point corresponding to the second character and a first line segment where the first coordinate point is located in a preset coordinate system; each coordinate point in the preset coordinate system is used for representing a second character carrying a symbol, one end of the first line segment is the first coordinate point, the other end of the first line segment is the second coordinate point, the ordinate of the second coordinate point is the same as the ordinate of the first coordinate point, and the abscissa of the second coordinate point is larger than the abscissa of the first coordinate point by a preset value;
when the symbol is positive, the first coordinate point is taken as a rotation center, the first line section is rotated clockwise by a preset angle, and characters except the symbol in the second characters corresponding to the third coordinate point are taken as the third characters; the third coordinate point is the coordinate point closest to the other end, except the first coordinate, of the second line segment, and the second line segment is the first line segment after clockwise rotation;
When the symbol is a negative sign, the first coordinate point is taken as a rotation center, the first line segment is rotated anticlockwise by the preset angle, and characters except the symbol in the second characters corresponding to the fourth coordinate point are taken as the third characters; the fourth coordinate point is the coordinate point closest to the other end, except the first coordinate, of the third line segment, and the third line segment is the first line segment after anticlockwise rotation.
Optionally, the symbol includes a positive sign and a negative sign, and the replacing module is specifically configured to, when configured to convert the second character according to the symbol:
determining a first ASCII code of the second character;
when the symbol is positive, adding the first ASCII code with a preset numerical value to obtain a second ASCII code; and taking the character corresponding to the second ASCII code as the third character;
when the symbol is a negative sign, subtracting the first ASCII code from a preset numerical value to obtain a third ASCII code; and taking the character corresponding to the third ASCII code as the third character.
Optionally, the device for generating a cryptographic dictionary further includes:
the second judging module is used for judging whether the candidate password dictionary has the password identical to the second password before the second password is stored in the candidate password dictionary;
And the storage module is used for storing the second password into the candidate password dictionary if the password which is the same as the second password does not exist.
Optionally, the device for generating a cryptographic dictionary further includes:
and the sending module is used for sending the password dictionary to a server corresponding to the client after storing the password dictionary.
In a third aspect, an embodiment of the present application provides a computer device, including a memory, a processor, and a computer program stored on the memory and executable on the processor, where the processor implements the steps of the method for generating a cryptographic dictionary according to any one of the first aspects when the processor executes the computer program.
In a fourth aspect, embodiments of the present application provide a computer-readable storage medium having stored thereon a computer program which, when executed by a processor, performs the steps of the method for generating a dictionary of any one of the first aspects described above.
The technical scheme provided by the embodiment of the application can comprise the following beneficial effects:
according to the method for generating the password dictionary, on the basis of obtaining the candidate password dictionary containing at least one first password (namely, limited first passwords), according to a preset character replacement rule, each first character in the first passwords is replaced with a second character carrying a symbol, then the second character is converted according to the symbol carried by the second character to obtain a third character, the first passwords formed by the first characters are converted into second passwords formed by the third characters through the conversion process, after the second passwords are obtained, the second passwords are stored in the candidate password dictionary, and whether the number of the passwords in the candidate password dictionary is larger than or equal to the preset number is judged, if the number of the passwords in the candidate password dictionary is smaller than the preset number, the second passwords are used as the first passwords, the process of converting the first passwords into the second passwords is repeatedly and sequentially executed, the process of storing the second passwords into the candidate password dictionary is judged whether the number of the passwords in the candidate password dictionary is larger than or equal to the preset number, and the corresponding to the candidate passwords are processed according to the preset number judgment result, and when the number of the passwords in the candidate password is larger than or equal to the preset number; according to the method and the device, the password dictionary containing a large number of passwords can be obtained through the repeated execution operation, and the whole process is automatically executed through the server, so that the manual workload is reduced, and the generation efficiency of the password dictionary is improved.
In order to make the above objects, features and advantages of the present application more comprehensible, preferred embodiments accompanied with figures are described in detail below.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings that are needed in the embodiments will be briefly described below, it being understood that the following drawings only illustrate some embodiments of the present application and therefore should not be considered limiting the scope, and that other related drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
FIG. 1 is a flowchart of a method for generating a dictionary of passwords according to an embodiment of the application;
FIG. 2 is a diagram showing an example of a conversion method of a second character according to the first embodiment of the present application;
fig. 3 is a schematic structural diagram of a device for generating a dictionary of a second embodiment of the present application;
fig. 4 shows a schematic structural diagram of a computer device according to a third embodiment of the present application.
Detailed Description
For the purposes of making the objects, technical solutions and advantages of the embodiments of the present application more clear, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is apparent that the described embodiments are only some embodiments of the present application, but not all embodiments. The components of the embodiments of the present application, which are generally described and illustrated in the figures herein, may be arranged and designed in a wide variety of different configurations. Thus, the following detailed description of the embodiments of the present application, as provided in the accompanying drawings, is not intended to limit the scope of the application, as claimed, but is merely representative of selected embodiments of the application. All other embodiments, which can be made by those skilled in the art based on the embodiments of the present application without making any inventive effort, are intended to be within the scope of the present application.
The most basic feature of the fractal theory is that objective matters are described and researched by using a view angle of a fractional dimension and a mathematical method, namely, the objective matters are described and researched by using a mathematical tool of the fractal dimension. The utility model has the advantages of it has jumped the traditional fence in one-dimensional line, two-dimensional face, three-dimensional even four-dimensional space-time, more approximately the description of the true attribute and the state of complex system, accords with the diversity and the complexity of objective things more, but shows certain regularity again in the trend. Such as: koch snowflake algorithm. The password setting has certainty and randomness to a certain extent, is opposite to each other and interdependent, is disordered and similar in iteration (partially and wholly), accords with some characteristics of fractal, and therefore the application adopts a specific fractal algorithm to generate a password dictionary.
Based on this, the embodiment of the application provides a method, a device, equipment and a storage medium for generating a password dictionary, and the following description is given by the embodiment.
Example 1
Fig. 1 shows a flowchart of a method for generating a dictionary according to an embodiment of the present application, and as shown in fig. 1, the method for generating a dictionary may be implemented by:
Step S101: after at least one preset first password is obtained, constructing a candidate password dictionary by using the at least one first password; wherein for each first password, the first password is composed of at least one first character.
Specifically, before the password dictionary is generated, at least one first password is obtained first, for each obtained first password, the first password is obtained by arranging at least one first character according to a preset sequence, the first character comprises letters, numbers, operation symbols, punctuation marks, other symbols and some functional symbols, the preset sequence can be a manually set sequence or a randomly generated sequence, the method is not particularly limited, after the at least one first password is obtained, the obtained at least one first password is combined to obtain a password set, and the obtained password set is used as a candidate password dictionary (also called a seed dictionary).
It should be noted that, for the first password, the first password may be a common password set by a person, or may be a password randomly generated by a server; the present invention is not particularly limited herein.
It should be noted that, the obtained at least one first password is different from each other.
Step S102: for each first password, according to a preset character replacement rule, replacing each first character on the first password with a second character carrying a symbol; converting the second character according to the symbol to obtain a second password composed of a third character; the third character is obtained by converting the second character.
Specifically, the character replacement rule includes a plurality of first characters and a second character carrying a symbol corresponding to each first character, for example: the first character A corresponds to B-, and the first character L corresponds to R+; for each first character, the second character carrying the symbol corresponding to the first character is a preset character for replacing the first character, so for each first character on the first password, the second character carrying the symbol corresponding to the first character is determined in a character replacement rule, and then the determined second character carrying the symbol is used for replacing the first character, for example: the second character carrying the symbol determined in the character replacement rule is B-by using the first character A, so that the first character A is replaced by B-by using the second character; after each first character on the first password is replaced by a second character carrying a symbol, the first password is changed into a password composed of at least one second character carrying a symbol, the second character is converted according to the symbol of the second character to obtain a third character (namely, the second character carrying the symbol is converted into the third character according to the second character carrying the symbol and the symbol of the second character), and after each second character carrying the symbol on the password is converted into the third character, the password is changed into a password composed of at least one third character, namely: a second password is obtained.
Note that, the symbol carried by the second character may be set according to the actual situation, for example, may be a mathematical symbol, may be a punctuation mark, or may be a special symbol, which is not limited herein.
It should be noted that, the distinguishing manner of the characters and the symbols carried by the characters may be distinguished according to the sequence, for example: b-wherein, the front B is defined as the character and the back B is defined as the symbol; the distinction can also be performed according to preset identifiers, for example, distinction according to different font sizes, distinction according to different fonts, etc., and the related distinction mode can be set according to actual conditions, which is not limited in detail herein; in this application, the symbol with the front character is taken as an example.
For example, the first password is ABa33, and the first character A corresponds to B-in the character replacement rule, so B-is used to replace the first character A in the first password; the first character B corresponds to C# in the character replacement rule, so that the first character B in the first password is replaced by C#; the first character a is opposite to 3+ in the character replacement rule, so 3+ is used for replacing the first character a in the first password; the first character 3 is 9% to in the character replacement rule, so 9% is used to replace the first character 3 in the first password; the resulting password consisting of the second character carrying the symbol after the end of the substitution is B-c#3+9%9%. B-, converting the B-according to the symbol-, in the password to obtain a third character H; aiming at the C# in the password, converting the C# according to the symbol#, and obtaining a third character j; aiming at 3+ in the password, converting the 3+ according to the symbol+ to obtain a third character k; aiming at 3+ in the password, converting 9% according to the sign to obtain a third character 8; after conversion of each second character carrying a symbol, a second password Hjk88 is obtained, which consists of the converted third characters.
It should be noted that, the second character carrying the symbol may be one character or may be a plurality of characters, which is not limited herein; the third character may be one character or a plurality of characters, and is not particularly limited herein.
Step S103: after the second passwords are stored in the candidate password dictionary, judging whether the number of the passwords in the candidate password dictionary is larger than or equal to a preset number.
Specifically, after the second password is obtained, the second password may be stored in the candidate password dictionary to be used as a component of the candidate password dictionary, and after the second password is stored in the candidate password dictionary, whether the number of passwords in the candidate password dictionary is greater than or equal to a preset number may be determined, where the preset number may be a number preset by a user (the number of required passwords).
Step S104: if the number is smaller than the preset number, taking the second password as a first password, and repeatedly executing the step S102, the step S103 and the step S104 in sequence until the number is larger than or equal to the preset number; and when the number is greater than or equal to the preset number, taking the candidate password dictionary as a password dictionary.
Specifically, if the number of passwords in the candidate dictionary is determined to be less than the preset number, it is indicated that the number of passwords in the candidate dictionary has not reached the number of passwords required by the user, and the passwords need to be stored in the candidate dictionary, so that the steps S102, S103 and S104 are repeatedly performed in sequence until the number of passwords in the candidate dictionary reaches the number of passwords required for the user, that is: the number of the passwords in the candidate password dictionary is larger than or equal to the preset number; when the number of the passwords in the candidate password dictionary is larger than or equal to the preset number, the number of the passwords in the candidate password dictionary reaches the number of the passwords required by the user, so the candidate password dictionary is used as the password dictionary required by the user for subsequent use by the user.
The method for generating a candidate password dictionary provided in fig. 1 may be based on obtaining a candidate password dictionary containing at least one first password (i.e. limited first passwords), for each first password, according to a preset character replacement rule, replacing each first character in the first password with a second character carrying a symbol, then converting the second character according to the symbol carried by the second character to obtain a third character, converting the first password composed of the first character into a second password composed of the third character through the conversion process, after obtaining the second password, storing the second password into the candidate password dictionary, and judging whether the number of passwords in the candidate password dictionary is greater than or equal to a preset number, if so, taking the second password as the first password, and repeatedly executing the above process of converting the first password into the second password, the process of storing the second password into the candidate password dictionary, judging whether the number of the passwords in the candidate password dictionary is greater than or equal to the preset number, and according to the result of the judgment, when the number of the passwords in the candidate dictionary is greater than or equal to the preset number; according to the method and the device, the password dictionary containing a large number of passwords can be obtained through the repeated execution operation, and the whole process is automatically executed through the server, so that the manual workload is reduced, and the generation efficiency of the password dictionary is improved.
In another possible embodiment, when the above steps S102, S103 and S104 are repeated in order, it may be further determined whether the repetition number is greater than or equal to a preset number, and if the repetition number is greater than or equal to the preset number, the candidate dictionary is used as the dictionary.
In a possible implementation manner, the symbols include a positive sign and a negative sign, and in the step S102, the second character is converted according to the symbol carried by the second character, so as to obtain a corresponding third character, and the specific implementation manner of the process is as follows:
determining a first coordinate point corresponding to the second character and a first line segment where the first coordinate point is located in a preset coordinate system; each coordinate point in the preset coordinate system is used for representing a second character carrying a symbol, one end of the first line segment is the first coordinate point, the other end of the first line segment is the second coordinate point, the ordinate of the second coordinate point is the same as the ordinate of the first coordinate point, and the abscissa of the second coordinate point is larger than the abscissa of the first coordinate point by a preset value.
Specifically, the preset coordinate system is a plane rectangular coordinate system, in the plane rectangular coordinate system, the step length preset for the horizontal axis is the same as the step length preset for the vertical axis, the plane rectangular coordinate system comprises at least one coordinate point, one coordinate point is used for representing a second character carrying a symbol, and the second characters carrying the symbol represented by the coordinate points are different from each other; therefore, for each second character carrying a symbol, a first coordinate point corresponding to the second character (carrying a symbol) and a first line segment where the first coordinate point is located may be determined in the preset coordinate system (plane rectangular coordinate system), for the first line segment, one end point of the first line segment is the first coordinate point, the other end point of the first line segment is a second coordinate point, and the second coordinate point and the first coordinate point are horizontal, that is: the ordinate of the second coordinate point is the same as the ordinate of the first coordinate point, that is: the first line segment is parallel to the transverse axis of the preset coordinate system; the second coordinate point is located on the right side of the first coordinate point, so that the abscissa of the second coordinate point is larger than the abscissa of the first coordinate point by a preset value, the preset value is a positive number, and the preset value is equal to a step length preset for the coordinate axis of the preset coordinate system.
It should be noted that, the first line segment where the first coordinate point is located may also be any line segment with the length equal to the step length, where the first coordinate point is taken as one end (one end point is taken as the first coordinate point); (i.e., may be randomly generated by the server based on the conditions), not specifically defined herein.
When the symbol is positive, the first coordinate point is taken as a rotation center, the first line section is rotated clockwise by a preset angle, and characters except the symbol in the second characters corresponding to the third coordinate point are taken as the third characters; the third coordinate point is the coordinate point closest to the other end, except the first coordinate, of the second line segment, and the second line segment is the first line segment after clockwise rotation.
Specifically, after determining a first coordinate point and a first line segment, if the symbol carried by the second character is determined to be a positive sign, in the preset coordinate system, rotating the first line segment clockwise by a preset angle by taking the first coordinate point as a rotation center to obtain a second line segment; for the second line segment, one end point of the second line segment is a first coordinate point, and the other end of the second line segment may be located on the coordinate point or may be located near the coordinate point; when the other end of the second line segment is located on the coordinate point, the coordinate point is the coordinate point closest to the other end, namely: a third coordinate point; when the other end of the second line segment is not located on the coordinate point (namely, is located near the coordinate point), determining the coordinate point closest to the other end, taking the determined coordinate point closest to the other end as a third coordinate point, after determining the third coordinate point, using the third coordinate point to represent a second character carrying a symbol, taking characters except the symbol in the second character as a third character, wherein the third character is a third character obtained after converting the second character.
When the symbol is a negative sign, the first coordinate point is taken as a rotation center, the first line segment is rotated anticlockwise by the preset angle, and characters except the symbol in the second characters corresponding to the fourth coordinate point are taken as the third characters; the fourth coordinate point is the coordinate point closest to the other end, except the first coordinate, of the third line segment, and the third line segment is the first line segment after anticlockwise rotation.
Specifically, after determining a first coordinate point and a first line segment, if the symbol carried by the second character is determined to be a negative sign, in the preset coordinate system, rotating the first line segment anticlockwise by a preset angle by taking the first coordinate point as a rotation center to obtain a third line segment; for the third line segment, one end point of the third line segment is the first coordinate point, and the other end of the third line segment may be located on the coordinate point or may be located near the coordinate point; when the other end of the third line segment is located on the coordinate point, the coordinate point is the coordinate point closest to the other end, namely: a fourth coordinate point; when the other end of the third line segment is not located on the coordinate point (namely, is located near the coordinate point), determining the coordinate point closest to the other end, taking the determined coordinate point closest to the other end as a fourth coordinate point, after determining the fourth coordinate point, using the fourth coordinate point to represent a second character carrying a symbol, taking characters except the symbol in the second character as a third character, wherein the third character is a third character obtained after converting the second character.
For example, fig. 2 shows an exemplary diagram of a conversion manner of a second character according to an embodiment of the present application, where, as shown in fig. 2, a preset coordinate system is a rectangular coordinate system, a step size set for a coordinate axis of the preset coordinate system is 1, and the preset coordinate system has 9 coordinate points (each dot represents one coordinate point) in total, where: coordinate point (0, 0), coordinate point (0, 1), coordinate point (0, 2), coordinate point (1, 0), coordinate point (2, 0), coordinate point (1, 1), coordinate point (1, 2), coordinate point (2, 1) and coordinate point (2, 2); if the second character carrying the symbol is B-, the first coordinate point corresponding to the B-in the preset coordinate system is a coordinate point (1, 1), the first line segment where the first coordinate point is located is a line segment 1, and one end point of the line segment 1 is the first coordinate point, namely: a coordinate point (1, 1), the other end point of the line segment 1 being a coordinate point (2, 1); because the symbol carried by B-is negative, the first line segment (namely, line segment 1) needs to be rotated anticlockwise, if the preset angle is 45 degrees, the coordinate point (1, 1) is taken as the rotation center, and the line segment 2 is obtained after the line segment 1 is rotated anticlockwise by 45 degrees, namely: obtaining a third line segment, wherein one end point of the line segment 2 is a first coordinate point (namely, coordinate point (1, 1)), the other end point of the line segment 2 is not located on the coordinate point in the preset coordinate system, but the coordinate point closest to the other end point of the line segment 2 is a coordinate point (2, 2), so that the coordinate point (2, 2) is a fourth coordinate point, and if a second character carrying a symbol corresponding to the coordinate point (2, 2) is F+, the character F is taken as a third character, namely: and converting the B-to obtain a third character F.
The correspondence between the symbol and the rotation direction in the above process may be: when the sign is positive, the first line segment is rotated counterclockwise, and when the sign is negative, the first line segment is rotated clockwise, and the corresponding relation can be set according to the actual situation, which is not particularly limited herein.
It should be noted that, the specific implementation manner is a specific fractal algorithm adopted in the application.
In another possible implementation manner, if the symbols include at least one symbol that is different from each other, and different symbols correspond to different rotation directions and rotation angles, after determining the first coordinate point and the first line segment corresponding to the second character, the first line segment may be rotated with the first coordinate point as a rotation center according to the rotation direction and the rotation angle corresponding to the symbol of the second character, so as to obtain a fourth line segment; after the fourth line segment is obtained, a fifth coordinate point closest to the other end of the fourth line segment except the first coordinate point is determined, and characters except symbols in the second characters corresponding to the fifth coordinate point are used as third characters.
In a possible implementation manner, the symbols include a positive sign and a negative sign, and in the step S102, the second character is converted according to the symbol carried by the second character, so as to obtain a corresponding third character, and the specific implementation manner of the process is as follows:
A first ASCII (American Standard Code for Information Interchange ) code for the second character is determined.
When the symbol is positive, adding the first ASCII code with a preset numerical value to obtain a second ASCII code; and taking the character corresponding to the second ASCII code as the third character.
When the symbol is a negative sign, subtracting the first ASCII code from a preset numerical value to obtain a third ASCII code; and taking the character corresponding to the third ASCII code as the third character.
Specifically, each character has a unique ASCII code corresponding to the character, so that a first ASCII code of a second character is an ASCII code corresponding to a character except a carried symbol in the second character, after determining that the symbol carried by the second character is positive, if it is determined that the symbol carried by the second character is positive, adding the first ASCII and a preset numerical value to obtain a second ASCII code, determining a character corresponding to the second ASCII code, taking the character corresponding to the second ASCII code as a third character, and converting the second character to obtain the third character; and if the symbol carried by the second character is judged to be negative, subtracting the preset numerical value from the first ASCII, adding the first ASCII to obtain a third ASCII code, determining the character corresponding to the third ASCII code, and taking the character corresponding to the third ASCII code as a third character, wherein the third character is the character obtained by converting the second character.
For example, if the second symbol carrying symbol is 4+, 4 is a symbol in 4+, +is a symbol carried by the symbol 4, the first ASCII code corresponding to the symbol 4 is 52, and if the preset value is 50, the first ASCII code 52 and the preset value 50 need to be added to obtain the second ASCII code 102, and the character corresponding to the second ASCII code 102 is f, so the character f is taken as the third character; if the second character carrying the symbol is z-, in z-, z is a character, -is a symbol carried by the character z, the first ASCII code corresponding to the character z is 122, and if the preset value is 50, since the symbol carried by the character z is a negative sign, it is necessary to add the first ASCII code 122 to the preset value 50 to obtain a third ASCII code 72, and the character corresponding to the third ASCII code 72 is H, so the character H is regarded as a third character.
In another possible embodiment, if the symbols include at least one symbol that is different from each other, the different symbols correspond to different operation rules (the operation mode and the numerical value required in the operation), so after determining the first ASCII code of the second character, the first ASCII code is operated according to the operation rule corresponding to the symbol of the second character, to obtain a fourth ASCII code; and determining the character corresponding to the fourth ASCII code, and taking the character corresponding to the fourth ASCII code as the third character.
In a possible embodiment, before storing the second password in the candidate dictionary, the dictionary generating method may be further implemented by:
and judging whether the candidate password dictionary has the same password as the second password.
And if the second password is not the same as the second password, storing the second password into the candidate password dictionary.
Specifically, after the second password is obtained, the second password needs to be stored in the candidate password dictionary, but if the candidate password dictionary already has the same password as the second password, in order to avoid repetition, the second password does not need to be stored in the candidate password dictionary; therefore, before the second password is stored in the candidate password dictionary, whether the password identical to the second password exists in all the passwords included in the candidate password dictionary or not is judged, if the password identical to the second password does not exist, the second password can be stored in the candidate password dictionary, and if the password identical to the second password exists, the second password is deleted.
In a possible embodiment, the method for generating a cryptographic dictionary may be further implemented by:
And after the password dictionary is stored, the password dictionary is sent to a server corresponding to the client.
Specifically, after the required dictionary is obtained, in order to enable the dictionary to be reused, the dictionary may be stored so as to be called from the memory when needed; in addition, in order to facilitate the user to use the dictionary, the dictionary may be sent to a server corresponding to the client.
Example two
Fig. 3 shows a schematic structural diagram of a device for generating a dictionary of a second embodiment of the present application, as shown in fig. 3, where the device for generating a dictionary of a password includes:
a construction module 301, configured to construct a candidate password dictionary using at least one preset first password after the at least one first password is acquired; wherein for each first password, the first password is composed of at least one first character;
a replacing module 302, configured to replace, for each first password, each first character on the first password with a second character carrying a symbol according to a preset character replacement rule; converting the second character according to the symbol to obtain a second password composed of a third character; the third character is obtained by converting the second character;
A first judging module 303, configured to judge whether the number of the passwords in the candidate password dictionary is greater than or equal to a preset number after the second password is stored in the candidate password dictionary;
the execution module 304 is configured to take the second password as the first password if the number is smaller than the preset number, and repeatedly execute step S102, step S103, and step S104 in sequence until the number is greater than or equal to the preset number; when the number is greater than or equal to the preset number, the candidate password dictionary is used as a password dictionary; wherein, the step S102 is: for each first password, according to a preset character replacement rule, replacing each first character on the first password with a second character carrying a symbol; converting the second character according to the symbol to obtain a second password composed of a third character; the step S103 is: after the second passwords are stored in the candidate password dictionary, judging whether the number of the passwords in the candidate password dictionary is larger than or equal to a preset number; the step S104 is: if the number is smaller than the preset number, taking the second password as a first password, and repeatedly executing the step S102, the step S103 and the step S104 in sequence until the number is larger than or equal to the preset number; and when the number is greater than or equal to the preset number, taking the candidate password dictionary as a password dictionary.
In a possible embodiment, the symbol includes a positive sign and a negative sign, and the replacing module 302 is specifically configured to, when configured to convert the second character according to the symbol:
determining a first coordinate point corresponding to the second character and a first line segment where the first coordinate point is located in a preset coordinate system; each coordinate point in the preset coordinate system is used for representing a second character carrying a symbol, one end of the first line segment is the first coordinate point, the other end of the first line segment is the second coordinate point, the ordinate of the second coordinate point is the same as the ordinate of the first coordinate point, and the abscissa of the second coordinate point is larger than the abscissa of the first coordinate point by a preset value;
when the symbol is positive, the first coordinate point is taken as a rotation center, the first line section is rotated clockwise by a preset angle, and characters except the symbol in the second characters corresponding to the third coordinate point are taken as the third characters; the third coordinate point is the coordinate point closest to the other end, except the first coordinate, of the second line segment, and the second line segment is the first line segment after clockwise rotation;
When the symbol is a negative sign, the first coordinate point is taken as a rotation center, the first line segment is rotated anticlockwise by the preset angle, and characters except the symbol in the second characters corresponding to the fourth coordinate point are taken as the third characters; the fourth coordinate point is the coordinate point closest to the other end, except the first coordinate, of the third line segment, and the third line segment is the first line segment after anticlockwise rotation.
In a possible embodiment, the symbol includes a positive sign and a negative sign, and the replacing module 302 is specifically configured to, when configured to convert the second character according to the symbol:
determining a first ASCII code of the second character;
when the symbol is positive, adding the first ASCII code with a preset numerical value to obtain a second ASCII code; and taking the character corresponding to the second ASCII code as the third character;
when the symbol is a negative sign, subtracting the first ASCII code from a preset numerical value to obtain a third ASCII code; and taking the character corresponding to the third ASCII code as the third character.
In a possible embodiment, the cryptographic dictionary generating apparatus further includes:
The second judging module is used for judging whether the candidate password dictionary has the password identical to the second password before the second password is stored in the candidate password dictionary;
and the storage module is used for storing the second password into the candidate password dictionary if the password which is the same as the second password does not exist.
In a possible embodiment, the cryptographic dictionary generating apparatus further includes:
and the sending module is used for sending the password dictionary to a server corresponding to the client after storing the password dictionary.
The apparatus provided by the embodiments of the present application may be specific hardware on a device or software or firmware installed on a device, etc. The device provided in the embodiments of the present application has the same implementation principle and technical effects as those of the foregoing method embodiments, and for a brief description, reference may be made to corresponding matters in the foregoing method embodiments where the device embodiment section is not mentioned. It will be clear to those skilled in the art that, for convenience and brevity, the specific operation of the system, apparatus and unit described above may refer to the corresponding process in the above method embodiment, which is not described in detail herein.
Example III
The embodiment of the present application further provides a computer device 400, fig. 4 shows a schematic structural diagram of a computer device provided in the third embodiment of the present application, and as shown in fig. 4, the device includes a memory 401, a processor 402, and a computer program stored in the memory 401 and capable of running on the processor 402, where the memory 401 and the processor 402 are communicatively connected through a bus, and the processor 402 implements the method for generating a cryptographic dictionary when executing the computer program.
Specifically, the memory 401 and the processor 402 can be general-purpose memories and processors, which are not limited herein, and when the processor 402 runs the computer program stored in the memory 401, the above-mentioned method for generating the dictionary can be executed, so that the problem of heavy manual workload in the prior art is solved.
Example IV
The embodiment of the application also provides a computer readable storage medium, and the computer readable storage medium stores a computer program which is executed by a processor to execute the steps of the method for generating the password dictionary.
Specifically, the storage medium can be a general storage medium, such as a mobile disk, a hard disk, and the like, and when the computer program on the storage medium is executed, the above-mentioned method for generating the dictionary can be executed, so that the problem of high manual workload in the prior art is solved.
In the embodiments provided in the present application, it should be understood that the disclosed apparatus and method may be implemented in other manners. The above-described apparatus embodiments are merely illustrative, for example, the division of the units is merely a logical function division, and there may be other manners of division in actual implementation, and for example, multiple units or components may be combined or integrated into another system, or some features may be omitted, or not performed. Alternatively, the coupling or direct coupling or communication connection shown or discussed with each other may be through some communication interface, device or unit indirect coupling or communication connection, which may be in electrical, mechanical or other form.
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 on a plurality of network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.
In addition, each functional unit in the embodiments provided in the present application may be integrated in one processing unit, or each unit may exist alone physically, or two or more units may be integrated in one unit.
The functions, if implemented in the form of software functional units and sold or used as a stand-alone product, may be stored in a computer-readable storage medium. Based on such understanding, the technical solution of the present application may be embodied essentially or in a part contributing to the prior art or in a part of the technical solution, in the form of a software product stored in a storage medium, including several instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to perform all or part of the steps of the methods described in the embodiments of the present application. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a random access Memory (RAM, random Access Memory), a magnetic disk, or an optical disk, or other various media capable of storing program codes.
It should be noted that: like reference numerals and letters in the following figures denote like items, and thus once an item is defined in one figure, no further definition or explanation of it is required in the following figures, and furthermore, the terms "first," "second," "third," etc. are used merely to distinguish one description from another and are not to be construed as indicating or implying relative importance.
Finally, it should be noted that: the foregoing examples are merely specific embodiments of the present application, and are not intended to limit the scope of the present application, but the present application is not limited thereto, and those skilled in the art will appreciate that while the foregoing examples are described in detail, the present application is not limited thereto. Any person skilled in the art may modify or easily conceive of the technical solution described in the foregoing embodiments, or make equivalent substitutions for some of the technical features within the technical scope of the disclosure of the present application; such modifications, changes or substitutions do not depart from the spirit and scope of the corresponding technical solutions. Are intended to be encompassed within the scope of this application. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.
Claims (10)
1. A method for generating a cryptographic dictionary, comprising:
s1: after at least one preset first password is obtained, constructing a candidate password dictionary by using the at least one first password; wherein for each first password, the first password is composed of at least one first character;
S2: for each first password, according to a preset character replacement rule, replacing each first character on the first password with a second character carrying a symbol; converting the second character according to the symbol to obtain a second password composed of a third character; the third character is obtained by converting the second character;
s3: after the second passwords are stored in the candidate password dictionary, judging whether the number of the passwords in the candidate password dictionary is larger than or equal to a preset number;
s4: if the number is smaller than the preset number, taking the second password as a first password, and repeating the steps of S2, S3 and S4 in sequence until the number is larger than or equal to the preset number; and when the number is greater than or equal to the preset number, taking the candidate password dictionary as a password dictionary.
2. The method of generating a dictionary of claim 1, wherein the symbol includes a positive sign and a negative sign, the converting the second character based on the symbol includes:
determining a first coordinate point corresponding to the second character and a first line segment where the first coordinate point is located in a preset coordinate system; each coordinate point in the preset coordinate system is used for representing a second character carrying a symbol, one end of the first line segment is the first coordinate point, the other end of the first line segment is the second coordinate point, the ordinate of the second coordinate point is the same as the ordinate of the first coordinate point, and the abscissa of the second coordinate point is larger than the abscissa of the first coordinate point by a preset value;
When the symbol is positive, the first coordinate point is taken as a rotation center, the first line section is rotated clockwise by a preset angle, and characters except the symbol in the second characters corresponding to the third coordinate point are taken as the third characters; the third coordinate point is the coordinate point closest to the other end, except the first coordinate, of the second line segment, and the second line segment is the first line segment after clockwise rotation;
when the symbol is a negative sign, the first coordinate point is taken as a rotation center, the first line segment is rotated anticlockwise by the preset angle, and characters except the symbol in the second characters corresponding to the fourth coordinate point are taken as the third characters; the fourth coordinate point is the coordinate point closest to the other end, except the first coordinate, of the third line segment, and the third line segment is the first line segment after anticlockwise rotation.
3. The method of generating a dictionary of claim 1, wherein the symbol includes a positive sign and a negative sign, the converting the second character based on the symbol includes:
determining a first ASCII code of the second character;
when the symbol is positive, adding the first ASCII code with a preset numerical value to obtain a second ASCII code; and taking the character corresponding to the second ASCII code as the third character;
When the symbol is a negative sign, subtracting the first ASCII code from a preset numerical value to obtain a third ASCII code; and taking the character corresponding to the third ASCII code as the third character.
4. The dictionary generating method as claimed in claim 1, wherein before storing the second password in the candidate dictionary, the dictionary generating method further comprises:
judging whether the candidate password dictionary has the same password as the second password;
and if the second password is not the same as the second password, storing the second password into the candidate password dictionary.
5. The cryptographic dictionary generating method as recited in claim 1, wherein the cryptographic dictionary generating method further comprises:
and after the password dictionary is stored, the password dictionary is sent to a server corresponding to the client.
6. A cryptographic dictionary generating apparatus, comprising:
the construction module is used for constructing a candidate password dictionary by using at least one first password after acquiring the preset at least one first password; wherein for each first password, the first password is composed of at least one first character;
The replacing module is used for replacing each first character on each first password with a second character carrying a symbol according to a preset character replacing rule; converting the second character according to the symbol to obtain a second password composed of a third character; the third character is obtained by converting the second character;
the first judging module is used for judging whether the number of the passwords in the candidate password dictionary is larger than or equal to the preset number after the second passwords are stored in the candidate password dictionary;
the execution module is used for taking the second password as a first password if the number is smaller than the preset number, and repeatedly executing S2, S3 and S4 in sequence until the number is larger than or equal to the preset number; when the number is greater than or equal to the preset number, the candidate password dictionary is used as a password dictionary; wherein, S2 is: for each first password, according to a preset character replacement rule, replacing each first character on the first password with a second character carrying a symbol; converting the second character according to the symbol to obtain a second password composed of a third character; the S3 is as follows: after the second passwords are stored in the candidate password dictionary, judging whether the number of the passwords in the candidate password dictionary is larger than or equal to a preset number; the S4 is as follows: if the number is smaller than the preset number, taking the second password as a first password, and repeating the steps of S2, S3 and S4 in sequence until the number is larger than or equal to the preset number; and when the number is greater than or equal to the preset number, taking the candidate password dictionary as a password dictionary.
7. The cryptographic dictionary generating apparatus according to claim 6, wherein the symbol includes a positive sign and a negative sign, and the replacing module, when configured to convert the second character according to the symbol, is specifically configured to:
determining a first coordinate point corresponding to the second character and a first line segment where the first coordinate point is located in a preset coordinate system; each coordinate point in the preset coordinate system is used for representing a second character carrying a symbol, one end of the first line segment is the first coordinate point, the other end of the first line segment is the second coordinate point, the ordinate of the second coordinate point is the same as the ordinate of the first coordinate point, and the abscissa of the second coordinate point is larger than the abscissa of the first coordinate point by a preset value;
when the symbol is positive, the first coordinate point is taken as a rotation center, the first line section is rotated clockwise by a preset angle, and characters except the symbol in the second characters corresponding to the third coordinate point are taken as the third characters; the third coordinate point is the coordinate point closest to the other end, except the first coordinate, of the second line segment, and the second line segment is the first line segment after clockwise rotation;
When the symbol is a negative sign, the first coordinate point is taken as a rotation center, the first line segment is rotated anticlockwise by the preset angle, and characters except the symbol in the second characters corresponding to the fourth coordinate point are taken as the third characters; the fourth coordinate point is the coordinate point closest to the other end, except the first coordinate, of the third line segment, and the third line segment is the first line segment after anticlockwise rotation.
8. The cryptographic dictionary generating apparatus according to claim 6, wherein the symbol includes a positive sign and a negative sign, and the replacing module, when configured to convert the second character according to the symbol, is specifically configured to:
determining a first ASCII code of the second character;
when the symbol is positive, adding the first ASCII code with a preset numerical value to obtain a second ASCII code; and taking the character corresponding to the second ASCII code as the third character;
when the symbol is a negative sign, subtracting the first ASCII code from a preset numerical value to obtain a third ASCII code; and taking the character corresponding to the third ASCII code as the third character.
9. A computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, characterized in that the processor implements the steps of the method for generating a cryptographic dictionary as claimed in any one of the preceding claims 1-5 when the computer program is executed by the processor.
10. A computer readable storage medium having stored thereon a computer program, characterized in that the computer program when executed by a processor performs the steps of the method of generating a cryptographic dictionary as claimed in any one of the preceding claims 1-5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210006444.0A CN114338015B (en) | 2022-01-05 | 2022-01-05 | Method, device, equipment and storage medium for generating password dictionary |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210006444.0A CN114338015B (en) | 2022-01-05 | 2022-01-05 | Method, device, equipment and storage medium for generating password dictionary |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114338015A CN114338015A (en) | 2022-04-12 |
| CN114338015B true CN114338015B (en) | 2024-03-29 |
Family
ID=81024421
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210006444.0A Active CN114338015B (en) | 2022-01-05 | 2022-01-05 | Method, device, equipment and storage medium for generating password dictionary |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114338015B (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP1574929A1 (en) * | 2004-03-05 | 2005-09-14 | Sap Ag | Technique for evaluating computer system passwords |
| JP2009110112A (en) * | 2007-10-26 | 2009-05-21 | Ns Solutions Corp | Password generating apparatus, password generating method and program |
| CN107579821A (en) * | 2017-09-19 | 2018-01-12 | 厦门市美亚柏科信息股份有限公司 | Password dictionary generation method and computer-readable recording medium |
| CN108111310A (en) * | 2017-03-09 | 2018-06-01 | 张长富 | A kind of generation method and device of candidate password dictionary |
| CN112702157A (en) * | 2020-12-04 | 2021-04-23 | 河南大学 | Block cipher system identification method based on improved random forest algorithm |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8132006B2 (en) * | 2005-05-03 | 2012-03-06 | Ntt Docomo, Inc. | Cryptographic authentication and/or establishment of shared cryptographic keys, including, but not limited to, password authenticated key exchange (PAKE) |
-
2022
- 2022-01-05 CN CN202210006444.0A patent/CN114338015B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP1574929A1 (en) * | 2004-03-05 | 2005-09-14 | Sap Ag | Technique for evaluating computer system passwords |
| JP2009110112A (en) * | 2007-10-26 | 2009-05-21 | Ns Solutions Corp | Password generating apparatus, password generating method and program |
| CN108111310A (en) * | 2017-03-09 | 2018-06-01 | 张长富 | A kind of generation method and device of candidate password dictionary |
| CN107579821A (en) * | 2017-09-19 | 2018-01-12 | 厦门市美亚柏科信息股份有限公司 | Password dictionary generation method and computer-readable recording medium |
| CN112702157A (en) * | 2020-12-04 | 2021-04-23 | 河南大学 | Block cipher system identification method based on improved random forest algorithm |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114338015A (en) | 2022-04-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US20220270384A1 (en) | Method for training adversarial network model, method for building character library, electronic device, and storage medium | |
| CN113792850B (en) | Font generation model training method, font library establishment method, device and equipment | |
| CN113792851A (en) | Font generation model training method, font library establishment method, device and equipment | |
| CN106372051A (en) | Patent map visualization method and system | |
| CN115114599A (en) | A database watermark processing method, device, equipment and storage medium | |
| CN111161804B (en) | Query method and system for species genomics database | |
| US11816908B2 (en) | Method of generating font database, and method of training neural network model | |
| CN115169568A (en) | Quantum computing processing method, device and electronic device | |
| CN114419613A (en) | Image sample generation method, text recognition method, device, equipment and medium | |
| CN114338015B (en) | Method, device, equipment and storage medium for generating password dictionary | |
| CN108985759B (en) | Address generating method, system, equipment and storage medium for cryptocurrency | |
| CN113408304B (en) | Text translation method and device, electronic equipment and storage medium | |
| CN114418830A (en) | Secure computing method, apparatus, device, and storage medium | |
| CN112612810A (en) | Slow SQL statement identification method and system | |
| CN117422384A (en) | Bill of materials generation method, apparatus, electronic device and storage medium | |
| CN113066153B (en) | Method, device and equipment for generating pipeline flow chart and storage medium | |
| CN116860996A (en) | Three-dimensional knowledge graph construction method, device, equipment and storage medium | |
| CN112861505B (en) | Repeatability detection method, device and electronic equipment | |
| CN109949867A (en) | A kind of optimization method and system and storage medium of multiple sequence alignment algorithm | |
| CN115329759A (en) | Information processing method, device, equipment and storage medium | |
| CN115242402A (en) | Signature method, signature verification method and electronic equipment | |
| CN113903071A (en) | Face recognition method, device, electronic device and storage medium | |
| CN107341136B (en) | Generating method, generating device and storage medium of serial index number | |
| CN113408592A (en) | Feature point matching method and device, electronic equipment and computer-readable storage medium | |
| CN112769896A (en) | Distributed node optimization method and system, electronic device and storage medium |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |