CN114912080A - Method for generating registration code, control method, terminal device and storage medium - Google Patents
Method for generating registration code, control method, terminal device and storage medium Download PDFInfo
- Publication number
- CN114912080A CN114912080A CN202210423321.7A CN202210423321A CN114912080A CN 114912080 A CN114912080 A CN 114912080A CN 202210423321 A CN202210423321 A CN 202210423321A CN 114912080 A CN114912080 A CN 114912080A
- Authority
- CN
- China
- Prior art keywords
- code
- character
- ciphertext sequence
- registration
- machine code
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 78
- 238000003860 storage Methods 0.000 title claims abstract description 13
- 238000013475 authorization Methods 0.000 claims abstract description 33
- 238000012545 processing Methods 0.000 claims abstract description 33
- 238000004590 computer program Methods 0.000 claims description 12
- 230000003044 adaptive effect Effects 0.000 claims description 8
- 238000006243 chemical reaction Methods 0.000 claims description 6
- 230000007613 environmental effect Effects 0.000 claims description 3
- 238000005336 cracking Methods 0.000 description 12
- 238000001802 infusion Methods 0.000 description 11
- 230000008569 process Effects 0.000 description 11
- 238000010586 diagram Methods 0.000 description 8
- 230000006870 function Effects 0.000 description 4
- 238000005520 cutting process Methods 0.000 description 3
- 239000000203 mixture Substances 0.000 description 3
- 230000008859 change Effects 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 230000036541 health Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000006467 substitution reaction Methods 0.000 description 2
- 238000012795 verification Methods 0.000 description 2
- 230000002457 bidirectional effect Effects 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 239000008280 blood Substances 0.000 description 1
- 210000004369 blood Anatomy 0.000 description 1
- 238000009826 distribution Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 230000002163 immunogen Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000000746 purification Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/10—Protecting distributed programs or content, e.g. vending or licensing of copyrighted material ; Digital rights management [DRM]
- G06F21/12—Protecting executable software
- G06F21/121—Restricting unauthorised execution of programs
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/10—Protecting distributed programs or content, e.g. vending or licensing of copyrighted material ; Digital rights management [DRM]
- G06F21/105—Arrangements for software license management or administration, e.g. for managing licenses at corporate level
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/10—Protecting distributed programs or content, e.g. vending or licensing of copyrighted material ; Digital rights management [DRM]
- G06F21/107—License processing; Key processing
Landscapes
- Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- Computer Security & Cryptography (AREA)
- Multimedia (AREA)
- Technology Law (AREA)
- Computer Hardware Design (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Storage Device Security (AREA)
Abstract
The application discloses a method for generating registration codes, a method for controlling software permission, a terminal device and a storage medium, wherein the method comprises the following steps: acquiring nameplate data of the terminal equipment; generating a machine code according to the nameplate data; carrying out disorder processing on characters in the machine code to generate a first ciphertext sequence; generating a plurality of random characters, inserting the random characters into the first ciphertext sequence, and generating a second ciphertext sequence; and adding the authorization deadline to a suffix of the second ciphertext sequence to generate a registration code. By the method, the safety of the generated registration code can be improved on the basis of ensuring the uniqueness of the registration code, and malicious registration of software can be effectively prevented.
Description
Technical Field
The present application relates to the field of computer technologies, and in particular, to a method for generating a registration code, a method for controlling software license, a terminal device, and a storage medium.
Background
After a user takes software designed by a software programmer, the user needs to register the software by using a registration code, and then all or part of functions of the software can be normally used.
Registration codes are also one of the most important means of protecting software from piracy. For software with general properties, pirated software generated by cracking registration codes can only generate problems of copyright dispute, civil litigation and the like. However, medical software related to the safety of medical treatment of patients can have serious consequences such as criminal litigation if the life health safety of patients is seriously damaged by using pirated software of cracked versions. Therefore, the security and uniqueness of the registration code become key factors for maintaining the legality of the use of the legal software and maintaining the intellectual property right of the manufacturer.
In the related art, the registration code is usually generated by using the related information such as the serial number of the device, and the related information such as the serial number of the device and the registration code have intuitive relevance, so that a hacker can easily crack the registration code according to the related information such as the serial number of the device, and a generation mode of the registration code in the related art has a relatively large safety risk.
Disclosure of Invention
Based on this, the present application provides a method for generating a registration code, a method for controlling software licensing, a terminal device and a storage medium, which can improve the security of the generated registration code on the basis of ensuring the uniqueness of the registration code, and can effectively prevent malicious registration of software.
In a first aspect, the present application provides a method for generating a registration code, which is applied to a terminal device, and the method includes:
acquiring nameplate data of the terminal equipment;
generating a machine code according to the nameplate data;
carrying out disorder processing on characters in the machine code to generate a first ciphertext sequence;
generating a plurality of random characters, inserting the random characters into the first ciphertext sequence, and generating a second ciphertext sequence;
and adding the authorization deadline to a suffix of the second ciphertext sequence to generate a registration code.
In a second aspect, the present application provides a software license control method, applied to a terminal device, the method including:
acquiring nameplate data of the terminal equipment;
generating a machine code according to the nameplate data;
carrying out disorder processing on characters in the machine code to generate a first ciphertext sequence;
generating a plurality of random characters, inserting the random characters into the first ciphertext sequence, and generating a second ciphertext sequence;
adding the authorization deadline to a suffix of the second ciphertext sequence to generate a first registration code;
and determining whether the user is legal or not according to the first registration code and the received second registration code input by the user.
In a third aspect, the present application provides a terminal device, where the terminal device includes: a processor and a memory, the processor and the memory being interconnected, the memory being for storing a computer program, the processor being for executing the computer program and, upon execution of the computer program, implementing a method of generating a registration code as described above or implementing a method of software license control as described above.
In a fourth aspect, the present application provides a computer storage medium storing a computer program that, when being processed and executed, causes the processor to implement the method for generating registration codes as described above or the method for controlling software licensing as described above.
According to the embodiment of the application, the first ciphertext sequence and the second ciphertext sequence are sequentially generated by utilizing the nameplate data of the terminal equipment, then the registration codes are generated, the generated registration codes correspond to the terminal equipment one by one, the uniqueness of the registration codes is ensured, two encryption steps are carried out, the data relevance between the registration codes and the nameplate data information of the terminal equipment can be cut off, the encryption safety of the registration codes is improved, a hacker is prevented from violently cracking the registration codes according to the nameplate data of the terminal equipment, and the use safety and the stability of the registration codes can be greatly guaranteed; the method for generating the registration code in the embodiment of the application can be widely applied to the terminal equipment, and the generated registration code can effectively prevent malicious registration of software.
It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the application.
Drawings
Fig. 1 is a schematic flowchart of an embodiment of a method for generating a registration code according to the present application;
FIG. 2 is a schematic diagram of an embodiment of nameplate data of an infusion pump in the method for generating registration codes of the present application;
FIG. 3 is a diagram illustrating an embodiment of a position of a character swap in a machine code according to the method for generating a registration code of the present application;
fig. 4 is a schematic diagram of an embodiment of a rule for exchanging positions of each character in a machine code in the method for generating a registration code according to the present application;
FIG. 5 is a flowchart illustrating an embodiment of a software licensing control method of the present application;
fig. 6 is a schematic structural diagram of an embodiment of a terminal device according to the present application.
Detailed Description
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 obvious that the described embodiments are some, but not all, embodiments of the present application. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
The flow diagrams depicted in the figures are merely illustrative and do not necessarily include all of the elements and operations/steps, nor do they necessarily have to be performed in the order depicted. For example, some operations/steps may be decomposed, combined or partially combined, so that the actual execution sequence may be changed according to the actual situation.
When a software programmer designs a piece of software, the user needs to register the software by using a registration code after the software reaches the hand of the user, and then all or part of functions of the software can be normally used.
Registration codes are also one of the most important means of protecting software from piracy. Some top-level hackers in the market use some brute force cracking modes to crack the registration code programs of the software, and then generate many pirated software with cracked versions. For some software with general properties, pirated software generated by cracking registration codes can only generate some problems of copyright disputes, civil litigation and the like. However, in the case of medical software, the safety of medical treatment of patients is involved, and if the life health safety of patients is seriously damaged by using pirated software of cracked versions, the serious consequences of criminal litigation and the like can be reached. Therefore, the security and uniqueness of the registration code become key factors for maintaining the legality of the use of the legal software and maintaining the intellectual property right of the manufacturer.
In the related art, the registration codes are usually generated by using the related information such as the serial numbers of the devices, the serial numbers are arranged in a certain sequence in the registration codes generated in the way, and when a hacker acquires the related information such as the serial numbers of the devices, the hacker can easily acquire the registration codes in a brute force cracking way, and further crack the software. Therefore, in the related technology, the generation mode of the registration code does not change the intuitive relevance between the serial number and other related information of the equipment and the registration code, so that a hacker can crack the registration code easily according to the serial number and other related information of the equipment, and the security risk is high.
According to the embodiment of the application, the name plate data of the terminal equipment are utilized to sequentially generate the first ciphertext sequence and the second ciphertext sequence, then the registration codes are generated, the generated registration codes correspond to the terminal equipment one by one, the uniqueness of the registration codes is ensured, two encryption steps are carried out, the data correlation between the registration codes and the name plate data information of the terminal equipment can be cut off, the encryption safety of the registration codes is improved, hackers are prevented from violently cracking the registration codes according to the name plate data of the terminal equipment, and the use safety and the stability of the registration codes can be greatly guaranteed; the method for generating the registration code in the embodiment of the application can be widely applied to terminal equipment, and the generated registration code can effectively prevent malicious registration of software.
In order to better explain the method of the embodiments of the present application, a detailed description will be made below.
Referring to fig. 1, fig. 1 is a schematic flowchart of an embodiment of a method for generating a registration code according to the present application, where the method is applied to a terminal device, and the terminal device includes but is not limited to: desktop computers, cell phones, infusion pumps, etc. For better illustration, the following discussion will be made in detail by taking the terminal device as an infusion pump.
The method comprises the following steps: step S101, step S102, step S103, step S104, and step S105
Step S101: and acquiring data of the nameplate of the terminal equipment.
Step S102: and generating a machine code according to the nameplate data.
The nameplate data of the terminal device includes but is not limited to: CPU serial number, hard disk serial number, CPU rated voltage, etc.; taking a terminal device as an infusion pump as an example, fig. 2 shows a data schematic diagram of a nameplate of the infusion pump.
When the terminal equipment is used, nameplate data of the terminal equipment can be obtained; the nameplate data is used as the unique identification of the terminal equipment, the machine code is generated according to the nameplate data, and then the machine code and the terminal equipment have one-to-one correspondence.
Step S103: and carrying out disorder processing on the characters in the machine code to generate a first ciphertext sequence.
The disorder processing may mean that the arrangement order and arrangement position of the characters of the current machine code are disturbed. After disorder processing is carried out on the machine code, the related information of nameplate data in the machine code can be disturbed, and a hacker is prevented from violently solving the registration code by using the related information of the nameplate data; the first ciphertext sequence obtained by disordering the characters in the machine code contains disordered character information, and the relevance between the first ciphertext sequence and the nameplate data can be cut off.
Step S104: and generating a plurality of random characters, inserting the random characters into the first ciphertext sequence, and generating a second ciphertext sequence.
For example, the plurality of random characters generated include: +#@! &? (ii) a Each random character is sequentially inserted into the first ciphertext sequence, the obtained second ciphertext sequence comprises a plurality of random characters, the randomness of the characters in the second ciphertext sequence can be increased by adding the random characters into the first ciphertext sequence, the second ciphertext sequence has higher character composition complexity, and the difficulty of brute force cracking is higher.
Step S105: and adding the authorization deadline to a suffix of the second ciphertext sequence to generate a registration code.
The authorization deadline represents a registration validity period of the registration codes, when the registration time of the registration codes exceeds the authorization deadline, the registration codes belong to a failure expiration state, each registration code has a specific validity period, and the registration codes comprise time use permission of which the authorization deadline can obtain the registration codes.
Illustratively, if the authorization deadline is set as: 12/25/2025, second ciphertext series: PHSN # FJ 23! ysh & hjis + sc _ ys, then the authorization deadline is added to the suffix of the second ciphertext sequence, and the generated registration code is: PHSN # FJ 23! ysh & hjis + sc _ ys20251225, the authorization deadline of the registration code can be obtained according to the registration code, and the user can conveniently obtain the authorization deadline after registration of the registration code, so that better use convenience is brought to the user.
According to the embodiment of the application, the first ciphertext sequence and the second ciphertext sequence are sequentially generated by utilizing the nameplate data of the terminal equipment, then the registration codes are generated, the generated registration codes correspond to the terminal equipment one by one, the uniqueness of the registration codes is ensured, two encryption steps are carried out, the data relevance between the registration codes and the nameplate data information of the terminal equipment can be cut off, the encryption safety of the registration codes is improved, a hacker is prevented from violently cracking the registration codes according to the nameplate data of the terminal equipment, and the use safety and the stability of the registration codes can be greatly guaranteed; the method for generating the registration code in the embodiment of the application can be widely applied to terminal equipment, and the generated registration code can effectively prevent malicious registration of software.
In an embodiment, the step S102 of generating the machine code according to the nameplate data may include: and if the nameplate data is detected to belong to unregistered nameplate data, filling the nameplate data with a plurality of preset characters to obtain the machine code, wherein the character length of the machine code is greater than or equal to the preset length.
The data of the nameplate which is not registered is valid data, and the data of the nameplate which is registered is invalid data. In order to guarantee the use standardization of the registration code, the terminal equipment and the registration code have one-to-one correspondence, and the nameplate data is used as the unique identity of the terminal equipment, the registration code is generated after the nameplate data of the terminal equipment is encrypted according to the embodiment of the application; therefore, in the embodiment of the application, whether the nameplate data belongs to the registered nameplate data or not is firstly judged, if the nameplate data of the terminal equipment belongs to the registered nameplate data, the nameplate data of the terminal equipment cannot be repeatedly registered, and then encryption cannot be performed according to the nameplate data to generate the registration code; only when the nameplate data of the terminal equipment belong to unregistered nameplate data, encryption processing is carried out on the nameplate data of the terminal equipment; and when the nameplate data is detected not to belong to the failure data, filling the nameplate data by adopting a plurality of preset characters (usually special characters), wherein the character length of the filled machine code is greater than or equal to the preset length.
Generally, the longer the character length of the machine code, the more complicated the machine code, but the more complicated the encryption step for the machine code; therefore, the embodiment of the application sets the preset length, the character length of the machine code is larger than or equal to the preset length, and the problems that the encrypted registration code is too simple and the security risk is too large due to too short character length of the machine code can be prevented.
Illustratively, if the acquired nameplate data of the terminal device is: MRHi7-1063Y1processor, and the nameplate data does not belong to the invalidation data, the nameplate data has a character length of: 21, wherein the preset length is 25, then 4 preset characters are needed to be adopted to fill the nameplate data, if these 4 preset characters are: "& + }! "the 4 preset characters are sequentially inserted into the nameplate data, and the filled nameplate data is as follows: MR + Hi7- } 106! 3Y1proc & essor, machine code is: MR + Hi7- } 106! 3Y1proc & essor, the length of the machine code is 25.
According to the embodiment of the application, after the nameplate data are filled with the preset characters, when the machine code is encrypted, the complexity of the encryption step can be ensured, and the problem that the registration code is simplified due to the fact that the encryption step is simplified too much is avoided.
In an embodiment, the step S105 of adding the authorization deadline to the suffix of the second ciphertext sequence to generate the registration code may include: substep S105a1 and substep S105a 2.
Sub-step S105a 1: and adding the authorization deadline to a suffix of the second ciphertext sequence to generate a third ciphertext sequence.
Sub-step S105a 2: and cutting the characters in the third ciphertext sequence to generate a registration code, wherein the character length of the registration code is equal to the character length of the machine code.
Because in S104, a plurality of random characters are inserted into the first ciphertext sequence, which is equivalent to increasing the character length of the second ciphertext sequence, and the authorization deadline is also added to the suffix of the second ciphertext sequence in the embodiment of the present application, the character length of the third ciphertext sequence is greater than the character length of the machine code; if the character length of the third ciphertext sequence is too long, the storage complexity of the registration code and the software registration verification time are increased; therefore, the characters in the third ciphertext sequence are cut, the character length of the cut third ciphertext sequence is equal to the character length of the machine code, the character length of the registration code is not too long, and the use convenience of the registration code is guaranteed.
Illustratively, the third ciphertext sequence is: QR + Wi7- }1^ | A. 3Y1 ═ r7c & $ s0oP76tR20251225, if the character length of the machine code is: 25, the character length of the third ciphertext sequence is: 37, 37>25, it is necessary to cut 12 characters from the third ciphertext sequence, for example, cut 12 characters from the prefix of the third ciphertext sequence, and then the cut third ciphertext sequence is: 3Y1 ═ r7c & $ s0oP76tR20251225, the registration code is: 3Y1 & $ s0oP76tR20251225, therefore, the embodiment of the application can not only ensure the complexity in the machine code encryption process and avoid data theft, but also ensure that the generated registration code is not too complex, and improve the use convenience of the registration code.
In an embodiment, in the sub-step S105a2, the performing the clipping process on the characters in the third ciphertext sequence may include: and deleting a plurality of target characters which are not adjacent and do not belong to the characters within the authorization deadline in the third ciphertext sequence.
The target character may refer to a character that needs to be deleted from the third ciphertext sequence. Each target character has a specific position distribution rule in the third ciphertext sequence, for example, a plurality of target characters all belong to characters at odd positions in the third ciphertext sequence; for example, the third ciphertext sequence is: QR + Wi7- }1^ | A. 3Y1 ═ r7c & $ s0oP76tR20251225, the character length of the machine code is: 25, cutting 12 characters from the third ciphertext sequence, and respectively taking the characters at the 1 st position, the 3 rd position, the 5 th position, the 7 th position, the 9 th position, the 11 th position, the 13 th position, the 15 th position, the 17 th position, the 19 th position, the 21 st position, the 23 th position in the third ciphertext sequence, as target characters, and after deleting a plurality of target characters from the third ciphertext sequence, the registration code is: RW7 }! Y ═ 7& soP76tR 20251225; the positions of the target characters in the third ciphertext sequence are not adjacent, so that the randomness of character composition in the third ciphertext sequence can be increased after the characters in the third ciphertext sequence are cut, and the cracking difficulty of the registration codes is improved.
In an embodiment, in step S104, the inserting the plurality of random characters into the first ciphertext sequence may include: and sequentially inserting each random character into the non-adjacent positions in the first ciphertext sequence.
The random characters can represent random information in the first ciphertext sequence, so that the random characters are added in the first ciphertext sequence, the positions of the random characters inserted in the first ciphertext sequence are not adjacent, the character composition complexity in the second ciphertext sequence can be increased, and hackers can be prevented from finding out rules in the second ciphertext sequence through an intelligent algorithm and then easily cracking the rules to obtain the registration codes.
Illustratively, the plurality of random characters is: [% ]; the first ciphertext sequence is: p1eR + oHs7- } 6! r3Ys1r0oic & M, each random character is sequentially inserted into the first-time ciphertext sequence, and then the inserted first-time ciphertext sequence is: p% 1eR + # oHs-7- } 6! r3Ys1r [ 0oi ] c & M. Therefore, the embodiment of the application can improve the complexity and the cracking difficulty of the second ciphertext sequence by inserting the random characters into the first ciphertext sequence.
In an embodiment, the method may further include: step S106 and step S107.
Step S106: and acquiring the adaptive environment characteristics corresponding to the terminal equipment.
Step S107: and generating an indicator of the terminal equipment according to the adaptive environment characteristics corresponding to the terminal equipment according to the environment characteristic coding rule.
At this time, the step S105 of adding the authorization deadline to the suffix of the second ciphertext sequence to generate the registration code may include: substep S105B1 and substep S105B 2.
Sub-step S105B 1: and adding the authorization deadline to a suffix of the second ciphertext sequence to generate a third ciphertext sequence.
Sub-step S105B 2: and adding the indicator to the prefix of the third ciphertext sequence to generate a registration code.
The terminal device is applied in a specific environment, and the environment-adaptive characteristic may refer to a characteristic of the specific environment applied by the terminal device. An indicator is generated by utilizing the adaptive environment characteristic, and the indicator is added to the prefix of the third-time ciphertext sequence, so that a user can know in the registration code which scene the registration code is applied to according to the indicator. For example, if the terminal device is an infusion pump, the infusion pump has different treatment effects when applied to different departments; for example, table 1 shows the environment characteristic encoding rule.
TABLE 1 environmental characteristic coding rules
Department for infusion pump application | Indicator symbol |
Hepatology department | G |
Nephrology department | S |
ICU | I |
Emergency call | J |
Department of immunogenics | F |
If the infusion pump is applied to the hepatology department, the registration code is applied to infusion management control software of the hepatology department, and login verification can be performed in the infusion management control software by using the registration code; for example, the third ciphertext sequence is: PHSN # FJ 23! ysh & hjis + sc _ ys20251225, indicator "G", the indicator is added to the prefix of the second-time ciphertext sequence, and the registration code is: GPHSN # FJ 23! ysh & hjis + sc _ ys 20251225. Therefore, the embodiment of the application can indicate the adaptive environment of the registration code by setting the indicator, and brings better use convenience to users.
In an embodiment, the method may further include: step S108.
Step S108: and receiving a forbidden character string sent by a background server, wherein the forbidden database of the background server comprises a plurality of forbidden character strings.
At this time, the step S105 of adding the authorization deadline to the suffix of the second ciphertext sequence to generate the registration code may include: substeps S105C1 and substeps 105C 2.
Sub-step S105C 1: and adding the authorization deadline to a suffix of the second ciphertext sequence to generate a third ciphertext sequence.
Sub-step S105C 2: and adding the forbidden character string to the prefix of the third ciphertext sequence to generate a registration code.
The method further comprises the following steps: step S109.
Step S109: and sending the feedback mark corresponding to the forbidden character string to the back-end server, so that the back-end server deletes the forbidden character string from the forbidden database.
The terminal equipment communicates with a background server, and the back-end server comprises: a disabling database, wherein the disabling database includes a plurality of disabling strings; the forbidden character strings have uniqueness in the forbidden database, the second ciphertext sequence does not contain the forbidden character strings, bidirectional data transmission can be achieved between the terminal device and the background server, the forbidden character strings can be used for preventing the problem of repetition among different registration codes, and when the forbidden character strings are added to the prefix of the third ciphertext sequence to generate the registration codes, the distinctiveness among different registration codes can be increased, and the use safety of the registration codes is improved.
The forbidden character strings are added to the prefixes of the third ciphertext sequences, so that the generated registration codes are guaranteed to have uniqueness, and different registration codes are different in the using process; after one forbidden character string is added to the prefix of the third ciphertext sequence, the feedback mark corresponding to the forbidden character string is output to the back-end server, and the back-end server deletes the forbidden character string from the forbidden database, so that the forbidden character string is prevented from being added to the next generation method of the registration codes to generate the registration codes, and confusion among a plurality of registration codes is prevented.
Illustratively, the forbidden character string is generated by the back-end server in advance, and the characters in the forbidden character string cannot be generated in the process of ciphertext encryption; referring to table 2, table 2 shows an illustration of disabling a database.
TABLE 2 disabled databases
If the obtained third ciphertext sequence is: PHSN # FJ 23! ysh & hjis + sc _ ys20251225, a forbidden string from table 2 above is selected as: and alpha pi omega, adding the forbidden character string to the prefix of the third ciphertext sequence, and generating a registration code as follows: α π Ω PHSN # FJ 23! ysh & hjis + sc _ ys20251225, outputting a feedback mark corresponding to the forbidden character string to a back-end server, and deleting the 'alpha pi omega' from the forbidden database so as to avoid the 'alpha pi omega' from being recycled in the generation process of the next registration code; then the forbidden character string can be obtained from the forbidden database after updating in the next generation process of the registration code, thus ensuring the uniqueness of the generation process of the registration code.
In an embodiment, in step S102, the filling the nameplate data with a plurality of preset characters to obtain the machine code may further include:
substep S1021: and filling the nameplate data by adopting a plurality of preset characters to obtain a first character string.
Substep S1022: and carrying out binary conversion on the first character string to obtain a binary code.
The process of converting a character into a binary code (i.e., a binary number) is a binary conversion. When the binary conversion is carried out on the first character string, the obtained binary code is replaced by binary digits; each character is represented by binary digits; for example, the character "M" corresponds to a binary number: 1001, the binary digits corresponding to the character "N" are: 1010 and so on.
For example, the first string is: MR + Hi7- } 106! 3Y1proc & essor; after binary conversion is carried out on the first character string, the obtained binary code is as follows: 10011101101110111101011111010110110010110110110010111010110101110110101010100111010011100010111011010111001011100.
substep S1023: and carrying out-of-order processing on each digit in the binary code.
The binary code comprises binary digits, and the step of disorder processing of the binary digits is simpler and more convenient, so that the data has higher disorder degree after the disorder processing is carried out on the binary code.
Substep S1024: and carrying out binary negation processing on the binary codes after the out-of-order processing to generate the machine code.
The process of converting binary codes (i.e. binary digits) into characters is binary inversion, for example, the obtained binary digits are: 1001, after binary inversion processing is performed according to a binary encoding rule, the obtained characters are: "M".
The "binary encoding rule" may adopt an encoding rule recognized in the related art, or may be set according to actual needs. And by analogy, each binary digit in the binary code after the out-of-order processing is subjected to binary negation processing in sequence, and the machine code can be generated.
In the process of generating the machine code, the binary code is adopted for disorder processing, when the characters are converted into binary digits, the character length of the binary code is increased, the complexity of the binary code is also increased, and the problem of data stealing of the machine code by hackers can be effectively avoided.
In an embodiment, the sub-step S1023 of out-of-order processing each digit in the binary code may further include: sub-step S10231 and sub-step S10232.
Substep S10231: generating any one binary data set by adopting a random algorithm, and intercepting a binary data segment from the binary data set, wherein the character length of the binary data segment is equal to the character length of the binary code.
Substep S10232: and performing Boolean operation on the binary data segment and the binary code.
The random algorithm can adopt a binary random number generation algorithm in the related art; for example, the generated binary data set is: 1011100101011010101010011110100101000111101010110100
00101011110100111011100100101011010101010011101001010111101100010101101100, respectively; intercepting a binary data segment from the binary data set as: 10111001010110101010100111101001010001111010101101000010101111010011101110010010101101010101001110100101011110110.
wherein, the boolean operation rule may be: performing boolean operation on two binary digits, and outputting 0 if the two binary digits are the same (for example, both are 0 or both are 1); if the two binary digits are different (one is 0 and the other is 1), outputting 1; therefore, a brand new binary code can be output after Boolean operation; for example, the binary data segment is: 10111, the binary code is: 10011, the binary data segment and the binary code are output after boolean operation: 00100. therefore, after the Boolean operation is performed on the binary digits, the method and the device can realize the function of disorder processing of the binary codes.
In an embodiment, in step S103, the performing out-of-order processing on the characters in the machine code to generate a first ciphertext sequence may include: substep S1031, substep S1032, and substep S1033.
Substep S1031: and counting the occurrence frequency of each character in the machine code.
For example, if the machine code is: MR + Hi7- } 106! 3Y1proc & essor, the frequency of occurrence of the character "M" is: 1, the frequency of occurrence of the character "R" is: 1, the frequency of occurrence of the character "+" is: 1, the frequency of occurrence of the character "H" is: 1, the frequency of occurrence of the character "i" is: 1, the frequency of occurrence of the character "7" is: 1; by analogy, the occurrence frequency of each character in the machine code can be counted.
Sub-step S1032: when the occurrence frequency of each character in the machine code meets a first condition, the position of the ith character in the machine code and the ith last character in the machine code is exchanged, wherein i represents the position of the character in the machine code, and the first condition is as follows: the frequency of occurrence of each character in the machine code is odd or even.
Substep S1033: when the occurrence frequency of each character in the machine code does not meet the first condition, exchanging the position of the character with the odd occurrence frequency with the adjacent character with the even occurrence frequency.
The position of the character in the machine code is adjusted according to the occurrence frequency of each character so as to increase the randomness of the first ciphertext sequence, and the characters in the first ciphertext sequence have higher irregularity.
Illustratively, the machine code is: MR + Hi7- } 106! 3Y1proc & essor, the frequency of occurrence of each character in the machine code is shown in the following table 3;
TABLE 3 frequency of occurrence of each character in machine code
Character(s) | M | R | + | H | i | 7 | - | } |
Frequency of |
1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 |
Character(s) | 1 | 0 | 6 | ! | 3 | Y | p | r |
Frequency of |
2 | 1 | 1 | 1 | 1 | 1 | 1 | 2 |
Character(s) | o | c | & | e | s | / | / | / |
Frequency of |
2 | 1 | 1 | 1 | 2 | / | / | / |
As shown in table 3, the frequency of occurrence of each character in the machine code is both odd and even, so that when the frequency of occurrence of each character in the machine code does not satisfy the first condition, the characters with odd frequency of occurrence are transposed with the adjacent characters with even frequency of occurrence.
Referring to table 3, first, it is determined whether the frequency of occurrence of a character is an odd number, and when the frequency of occurrence of a character is an odd number, it is determined whether the frequency of occurrence of a character adjacent to the character is an even number, and when it is determined that the frequency of occurrence of a character adjacent to the character is an even number, the positions of the character whose frequency of occurrence is an odd number and the character whose frequency of occurrence is an even number are exchanged; for example, in table 3: the characters "}" and "Y" are adjacent to the character "1", and then the positions of the two characters are exchanged; the characters p and r are adjacent, and the positions of the two characters are exchanged; the character "c" is adjacent to the character "o", and the two characters are exchanged; the character "e" is adjacent to the character "s", and the positions of the two characters are exchanged; referring to fig. 3, fig. 3 is a schematic diagram illustrating a position of a character in a machine code, where the machine code after the position change is: MR + Hi7-1} 06! 31Yrpoc & sesor, the first ciphertext sequence generated is: MR + Hi7-1} 06! 31Yrpoc & sesor.
It should be noted that, when the occurrence frequency of each character in the machine code does not satisfy the first condition, after the positions of the character with the odd occurrence frequency and the adjacent character with the even occurrence frequency are exchanged, each character in the machine code is sequentially traversed, and the occurrence frequency of the next character is sequentially judged; (the purpose of writing a segment is to explain that after the character e is transposed with the first s of the character in FIG. 2, the character e is adjacent to the second s of the character, but the embodiment will sequentially judge the next character (i.e. the second s) and will not judge the character e again, so the position of the character e adjacent to the second s will not be transposed again); the transposing of the content is an algorithm idea.
For example, if the machine code is: MR + Hi7- } 206! 3Y1pmoc & eCSAR, wherein the occurrence frequency of each character in the machine code is 1, the occurrence frequency of each character in the machine code meets a first condition, and the position of the ith character in the machine code is exchanged with the position of the ith last character in the machine code; as shown in fig. 4, fig. 4 shows the rule of transposing each character in the machine code, and after transposing, the first ciphertext sequence generated is as follows: rAsCe & comp1Y 3! 602} -7iH + RM. If the character length of the machine code is an odd number, the middle character does not need to be changed in position, and as shown in fig. 4, the middle character "3" does not need to be changed in position.
Therefore, the machine code is divided into two types according to the occurrence frequency of each character in the machine code, the positions of the characters in the machine code are respectively exchanged, and the risk that a first ciphertext sequence is stolen and cracked by a hacker can be effectively reduced.
Referring to fig. 5, fig. 5 is a schematic flowchart of an embodiment of a software license control method of the present application, which is applied to a terminal device, the software license control method of the embodiment of the present application is mostly the same as the above-mentioned generation method of registration codes, and please refer to the above-mentioned generation method of registration codes for the same content, which is not described herein again, and different contents are mainly described below.
The method comprises the following steps: step S201, step S202, step S203, step S204, step S205, and step S206.
Step S201: and acquiring data of the nameplate of the terminal equipment.
Step S202: and generating a machine code according to the nameplate data.
Step S203: and carrying out disorder processing on the characters in the machine code to generate a first ciphertext sequence.
Step S204: and generating a plurality of random characters, inserting the random characters into the first ciphertext sequence, and generating a second ciphertext sequence.
Step S205: and adding the authorization deadline to a suffix of the second ciphertext sequence to generate a first registration code.
Step S206: and determining whether the user is legal or not according to the first registration code and the received second registration code input by the user.
The first registration code obtained according to the generation method of the registration code is the unique and legal registration code, if the source of the second registration code input by the user is legal and is also obtained by the generation method of the registration code, the second registration code and the first registration code should be the same, and the user can be determined to be a legal user; if the source of the second registration code input by the user is illegal and is not obtained by the generation method of the registration code, the second registration code is different from the first registration code, and the user can be determined to be an illegal user.
According to the embodiment of the application, the first ciphertext sequence and the second ciphertext sequence are sequentially generated by utilizing the nameplate data of the terminal equipment, then the registration codes are generated, the generated registration codes correspond to the terminal equipment one by one, the uniqueness of the registration codes is ensured, two encryption steps are carried out, the data relevance between the registration codes and the nameplate data information of the terminal equipment can be cut off, the encryption safety of the registration codes is improved, a hacker is prevented from violently cracking the registration codes according to the nameplate data of the terminal equipment, and the use safety and the stability of the registration codes can be greatly guaranteed; the method for generating the registration code in the embodiment of the application can be widely applied to terminal equipment, and the generated registration code can effectively prevent malicious registration of software.
In one embodiment, the generating a machine code from the nameplate data includes: and if the nameplate data is detected to belong to unregistered nameplate data, filling the nameplate data with a plurality of preset characters to obtain the machine code, wherein the character length of the machine code is greater than or equal to the preset length.
In an embodiment, the adding the authorization deadline to the suffix of the second ciphertext sequence to generate a registration code includes: adding the authorization deadline to a suffix of the second ciphertext sequence to generate a third ciphertext sequence; and cutting the characters in the third ciphertext sequence to generate a registration code, wherein the character length of the registration code is equal to the character length of the machine code.
In an embodiment, the performing a clipping process on the characters in the third ciphertext sequence includes: and deleting a plurality of target characters which are not adjacent and do not belong to the characters within the authorization deadline in the third ciphertext sequence.
In one embodiment, the inserting the plurality of random characters into the first ciphertext sequence includes: and sequentially inserting each random character into the non-adjacent positions in the first ciphertext sequence.
In an embodiment, the method further comprises: acquiring adaptive environmental characteristics corresponding to the terminal equipment; generating an indicator of the terminal equipment according to the environment characteristic coding rule and the adaptive environment characteristic corresponding to the terminal equipment; adding the authorization deadline to a suffix of the second ciphertext sequence to generate a registration code, comprising: adding the authorization deadline to a suffix of the second ciphertext sequence to generate a third ciphertext sequence; and adding the indicator to the prefix of the third ciphertext sequence to generate a registration code.
In an embodiment, the method further comprises: receiving a forbidden character string sent by a background server, wherein a forbidden database of the background server comprises a plurality of forbidden character strings; adding the authorization deadline to a suffix of the second ciphertext sequence to generate a registration code, comprising: adding the authorization deadline to a suffix of the second ciphertext sequence to generate a third ciphertext sequence; and adding the forbidden character string to the prefix of the third ciphertext sequence to generate a registration code, and sending a feedback mark corresponding to the forbidden character string to the back-end server.
In an embodiment, the populating the nameplate data with a plurality of preset characters to obtain the machine code includes: filling the nameplate data by adopting a plurality of preset characters to obtain a first character string; performing binary conversion on the first character string to obtain a binary code; carrying out-of-order processing on each digit in the binary code; and carrying out binary negation processing on the binary codes after the out-of-order processing to generate the machine code.
In one embodiment, the out-of-order processing each digit in the binary code includes: generating any one binary data set by adopting a random algorithm, and intercepting a binary data segment from the binary data set, wherein the character length of the binary data segment is equal to that of the binary code; and performing Boolean operation on the binary data segment and the binary code.
In an embodiment, the performing out-of-order processing on the characters in the machine code to generate a first ciphertext sequence includes: counting the occurrence frequency of each character in the machine code; when the occurrence frequency of each character in the machine code meets a first condition, the position of the ith character in the machine code and the ith last character in the machine code is exchanged, wherein i represents the position of the character in the machine code, and the first condition is as follows: the occurrence frequency of each character in the machine code is odd or even; when the occurrence frequency of each character in the machine code does not meet the first condition, exchanging the position of the character with the odd occurrence frequency with the adjacent character with the even occurrence frequency.
Referring to fig. 6, fig. 6 is a schematic structural diagram of an embodiment of a terminal device in the present application, where the terminal device 100 includes: a processor 2 and a memory 1, the processor 2 and the memory 1 being connected to each other, the memory 1 being configured to store a computer program, the processor 2 being configured to execute the computer program and, upon execution of the computer program, to implement the method for generating a registration code as described in any of the above, or to implement the method for controlling software licensing as described in any of the above. For a detailed description of the related contents, please refer to the related contents above, which are not described in detail herein.
The processor 2 may be a micro-control unit, a central processing unit, a digital signal processor, or the like.
The memory 1 may be a Flash chip, a read-only memory, a magnetic disk, an optical disk, a usb disk, or a removable hard disk.
In an embodiment, the terminal device may be a medical device, the medical device may further include a wired or wireless network interface, a keyboard, an input/output interface, and other components so as to perform input and output, and the medical device may further include other components for implementing functions of the device, which is not described herein again.
The present application also provides a computer-readable storage medium storing a computer program which, when executed by a processor, causes the processor to implement the method for generating a registration code as described in any one of the above, or the method for controlling software licensing as described in any one of the above. For a detailed description of the related contents, please refer to the related contents above, which are not described in detail herein.
The computer readable storage medium may be an internal storage unit of the blood purification apparatus, such as a hard disk or a memory. The computer readable storage medium may also be an external storage device such as a hard drive equipped with a plug-in, smart memory card, secure digital card, flash memory card, or the like.
It is to be understood that 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.
It should also be understood that the term "and/or" as used in this specification and the appended claims refers to and includes any and all possible combinations of one or more of the associated listed items.
The above description is only for the specific embodiment of the present application, but the scope of the present application is not limited thereto, and any person skilled in the art can easily conceive various equivalent modifications or substitutions within the technical scope of the present application, and these modifications or substitutions should be covered by the scope of the present 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 registration code is applied to a terminal device, and the method comprises the following steps:
acquiring nameplate data of the terminal equipment;
generating a machine code according to the nameplate data;
carrying out disorder processing on characters in the machine code to generate a first ciphertext sequence;
generating a plurality of random characters, inserting the random characters into the first ciphertext sequence, and generating a second ciphertext sequence;
and adding the authorization deadline to a suffix of the second ciphertext sequence to generate a registration code.
2. A software license control method is applied to a terminal device, and the method comprises the following steps:
acquiring nameplate data of the terminal equipment;
generating a machine code according to the nameplate data;
carrying out disorder processing on the characters in the machine code to generate a first ciphertext sequence;
generating a plurality of random characters, inserting the random characters into the first ciphertext sequence, and generating a second ciphertext sequence;
adding the authorization deadline to a suffix of the second ciphertext sequence to generate a first registration code;
and determining whether the user is legal or not according to the first registration code and the received second registration code input by the user.
3. The method of claim 2, wherein generating a machine code from the nameplate data comprises:
and if the nameplate data is detected to belong to unregistered nameplate data, filling the nameplate data with a plurality of preset characters to obtain the machine code, wherein the character length of the machine code is greater than or equal to the preset length.
4. The method of claim 2, further comprising:
acquiring adaptive environmental characteristics corresponding to the terminal equipment;
generating an indicator of the terminal equipment according to the environment characteristic coding rule and the adaptive environment characteristic corresponding to the terminal equipment;
adding the authorization deadline to a suffix of the second ciphertext sequence to generate a registration code, comprising:
adding the authorization deadline to a suffix of the second ciphertext sequence to generate a third ciphertext sequence;
and adding the indicator to the prefix of the third ciphertext sequence to generate a registration code.
5. The method of claim 2, further comprising:
receiving a forbidden character string sent by a background server, wherein a forbidden database of the background server comprises a plurality of forbidden character strings;
adding the authorization deadline to a suffix of the second ciphertext sequence to generate a registration code, comprising:
adding the authorization deadline to a suffix of the second ciphertext sequence to generate a third ciphertext sequence;
adding the forbidden character string to the prefix of the third ciphertext sequence to generate a registration code;
the method further comprises the following steps:
and sending the feedback mark corresponding to the forbidden character string to the back-end server, so that the back-end server deletes the forbidden character string from the forbidden database.
6. The method of claim 3, wherein the populating the nameplate data with a plurality of preset characters to obtain the machine code comprises:
filling the nameplate data by adopting a plurality of preset characters to obtain a first character string;
performing binary conversion on the first character string to obtain a binary code;
carrying out-of-order processing on each digit in the binary code;
and carrying out binary negation processing on the binary codes after the out-of-order processing to generate the machine code.
7. The method of claim 6, wherein said out-of-order processing each digit in said binary code comprises:
generating any one binary data set by adopting a random algorithm, and intercepting a binary data segment from the binary data set, wherein the character length of the binary data segment is equal to that of the binary code;
and performing Boolean operation on the binary data segment and the binary code.
8. The method of claim 2, wherein the out-of-order processing of the characters in the machine code to generate a first ciphertext sequence comprises:
counting the occurrence frequency of each character in the machine code;
when the occurrence frequency of each character in the machine code meets a first condition, the position of the ith character in the machine code and the ith last character in the machine code is exchanged, wherein i represents the position of the character in the machine code, and the first condition is as follows: the occurrence frequency of each character in the machine code is odd or even;
when the occurrence frequency of each character in the machine code does not meet the first condition, exchanging the position of the character with the odd occurrence frequency with the adjacent character with the even occurrence frequency.
9. A terminal device, characterized in that the terminal device comprises: a processor and a memory, the processor and the memory being interconnected, the memory being for storing a computer program, the processor being configured to execute the computer program and, when executing the computer program, to implement the method of generating registration codes according to claim 1 or to implement the method of software license control according to any of claims 2 to 8.
10. A computer-readable storage medium, characterized in that it stores a computer program that, when being processed and executed, causes the processor to implement the method of generating registration codes according to claim 1 or the method of controlling software licensing according to any one of claims 2 to 8.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202210423321.7A CN114912080B (en) | 2022-04-21 | 2022-04-21 | Registration code generation method, control method, terminal device and storage medium |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202210423321.7A CN114912080B (en) | 2022-04-21 | 2022-04-21 | Registration code generation method, control method, terminal device and storage medium |
Publications (2)
Publication Number | Publication Date |
---|---|
CN114912080A true CN114912080A (en) | 2022-08-16 |
CN114912080B CN114912080B (en) | 2024-07-16 |
Family
ID=82764593
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN202210423321.7A Active CN114912080B (en) | 2022-04-21 | 2022-04-21 | Registration code generation method, control method, terminal device and storage medium |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN114912080B (en) |
Citations (14)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5291598A (en) * | 1992-04-07 | 1994-03-01 | Gregory Grundy | Method and system for decentralized manufacture of copy-controlled software |
CN1399744A (en) * | 1999-10-04 | 2003-02-26 | 金洪年 | Service execution method and system for registration of domain names using vernaculars in non-English speaking countries |
US20030110375A1 (en) * | 1998-06-04 | 2003-06-12 | Z4 Technologies, Inc. | Method for monitoring software using encryption including digital signatures/certificates |
CN1862493A (en) * | 2005-05-12 | 2006-11-15 | 施乐公司 | Method for creating unique identification for copies of executable code and management thereof |
CN102479304A (en) * | 2010-11-26 | 2012-05-30 | 深圳市硅格半导体有限公司 | Method, client and system for software access control |
US20120185850A1 (en) * | 2011-01-18 | 2012-07-19 | Hyeong-Seok Oh | Code rearranger and method for rearranging code for a virtual machine |
CN103093129A (en) * | 2013-01-09 | 2013-05-08 | 上海大唐移动通信设备有限公司 | Registration code generation method and device used for software licensing |
CN104123482A (en) * | 2014-07-08 | 2014-10-29 | 攀钢集团攀枝花钢钒有限公司 | Method for generating machine code and registration code and method for software registration and function limiting |
CN106919810A (en) * | 2017-02-22 | 2017-07-04 | 广州广电运通金融电子股份有限公司 | Registration code generating method and device, software registration method and device |
CN110096852A (en) * | 2019-05-14 | 2019-08-06 | 北京天地和兴科技有限公司 | A kind of offline industrial control software authentication method close based on state |
CN111164593A (en) * | 2019-12-27 | 2020-05-15 | 威创集团股份有限公司 | Registration authorization method and system |
CN112084511A (en) * | 2020-08-27 | 2020-12-15 | 欧菲微电子技术有限公司 | Encryption method and device of service life information, storage medium and electronic equipment |
CN113660205A (en) * | 2021-07-12 | 2021-11-16 | 浙江瑞银电子有限公司 | Software authorization code encryption method |
CN113868604A (en) * | 2021-09-01 | 2021-12-31 | 深圳市科陆电子科技股份有限公司 | Software authorization method, system, device and computer readable storage medium |
-
2022
- 2022-04-21 CN CN202210423321.7A patent/CN114912080B/en active Active
Patent Citations (14)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5291598A (en) * | 1992-04-07 | 1994-03-01 | Gregory Grundy | Method and system for decentralized manufacture of copy-controlled software |
US20030110375A1 (en) * | 1998-06-04 | 2003-06-12 | Z4 Technologies, Inc. | Method for monitoring software using encryption including digital signatures/certificates |
CN1399744A (en) * | 1999-10-04 | 2003-02-26 | 金洪年 | Service execution method and system for registration of domain names using vernaculars in non-English speaking countries |
CN1862493A (en) * | 2005-05-12 | 2006-11-15 | 施乐公司 | Method for creating unique identification for copies of executable code and management thereof |
CN102479304A (en) * | 2010-11-26 | 2012-05-30 | 深圳市硅格半导体有限公司 | Method, client and system for software access control |
US20120185850A1 (en) * | 2011-01-18 | 2012-07-19 | Hyeong-Seok Oh | Code rearranger and method for rearranging code for a virtual machine |
CN103093129A (en) * | 2013-01-09 | 2013-05-08 | 上海大唐移动通信设备有限公司 | Registration code generation method and device used for software licensing |
CN104123482A (en) * | 2014-07-08 | 2014-10-29 | 攀钢集团攀枝花钢钒有限公司 | Method for generating machine code and registration code and method for software registration and function limiting |
CN106919810A (en) * | 2017-02-22 | 2017-07-04 | 广州广电运通金融电子股份有限公司 | Registration code generating method and device, software registration method and device |
CN110096852A (en) * | 2019-05-14 | 2019-08-06 | 北京天地和兴科技有限公司 | A kind of offline industrial control software authentication method close based on state |
CN111164593A (en) * | 2019-12-27 | 2020-05-15 | 威创集团股份有限公司 | Registration authorization method and system |
CN112084511A (en) * | 2020-08-27 | 2020-12-15 | 欧菲微电子技术有限公司 | Encryption method and device of service life information, storage medium and electronic equipment |
CN113660205A (en) * | 2021-07-12 | 2021-11-16 | 浙江瑞银电子有限公司 | Software authorization code encryption method |
CN113868604A (en) * | 2021-09-01 | 2021-12-31 | 深圳市科陆电子科技股份有限公司 | Software authorization method, system, device and computer readable storage medium |
Non-Patent Citations (3)
Title |
---|
张玉刚: "一种加密软件注册码的研究及实现", 中国优秀硕士学位论文全文数据库, no. 2, 15 December 2011 (2011-12-15) * |
董灿钧;: "注册码软件加密保护中RSA算法的应用", 信息安全与技术, no. 09, 10 September 2013 (2013-09-10) * |
黄宁;钟剑;: "由机器码动态生成矩阵实现的软件版权保护方案", 赣南师范学院学报, no. 03, 20 June 2012 (2012-06-20) * |
Also Published As
Publication number | Publication date |
---|---|
CN114912080B (en) | 2024-07-16 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
JP7225208B2 (en) | Pseudorandom Number Generation in Blockchain | |
US10284372B2 (en) | Method and system for secure management of computer applications | |
US9736142B2 (en) | Tokenization using multiple reversible transformations | |
CN107819569B (en) | The encryption method and terminal device of log-on message | |
CN105205359B (en) | A kind of JavaScript code guard method and device | |
CN100576227C (en) | A kind of software encrypting registration piracy-preventing method | |
US8978152B1 (en) | Decentralized token table generation | |
GB2520446A (en) | Quorum based data processing | |
CN106610995B (en) | Method, device and system for creating ciphertext index | |
US11227037B2 (en) | Computer system, verification method of confidential information, and computer | |
CN109150903A (en) | A kind of account management method, device, storage medium and terminal device | |
CN110489466B (en) | Method and device for generating invitation code, terminal equipment and storage medium | |
CN112001376B (en) | Fingerprint identification method, device, equipment and storage medium based on open source component | |
CN110210211A (en) | A kind of method of data protection and calculate equipment | |
Immler et al. | Practical aspects of quantization and tamper-sensitivity for physically obfuscated keys | |
CN113688399A (en) | Firmware digital signature protection method and device, computer equipment and storage medium | |
Li et al. | Secure and high-quality watermarking algorithms for relational database based on semantic | |
CN109299586A (en) | It is a kind of to decrypt Activiation method, system and storage medium offline | |
Huang et al. | Smart contract watermarking based on code obfuscation | |
CN114912080B (en) | Registration code generation method, control method, terminal device and storage medium | |
CN107395629A (en) | A kind of computer network security registration and verification method | |
Wu et al. | Authentication of LINE chat history files by information hiding | |
CN114357384A (en) | Method for activating software based on authorization file, computing device and computer readable medium | |
CN115080987A (en) | Password management method, device, system, storage medium and computer equipment | |
Qian et al. | Integer-granularity locality-sensitive bloom filter |
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 |