Encryption protection method for important data information of game user

By desensitizing game user data and constructing key coefficients, combining elliptic curve encoding and hashing functions to generate random private keys, the game data encryption problem is solved, and personalized encryption and high security protection are achieved for different situations.

CN119046975AActive Publication Date: 2024-11-29SHENZHEN YUEXIANG NETWORK TECH CO LTD +1
View PDF 5 Cites 0 Cited by

Patent Information

Application Number
CN202410937644.7
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-07-12
Publication Date
2024-11-29
Estimated Expiration
2044-07-12

AI Technical Summary

Technical Problem

During the game data encryption process, it is difficult to select elliptical curve parameters and lack of evaluation standards, which leads to the inability to effectively encrypt game data in different situations. The selection of private keys does not take into account the data status, making it difficult to ensure data security.

Method used

By obtaining the original data of game users, desensitize and constructing data key coefficients, it is divided into two categories according to the data characteristics, and using elliptic curve encoding and hash functions to generate random private keys to ensure the degree of chaos in the encrypted data in different finite domains , improve encryption difficulty.

Benefits of technology

Personalized encryption is realized based on data characteristics, improving the security and difficulty in deciphering of data, and ensuring high security of important information of game user data during transmission.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119046975A_ABST
    Figure CN119046975A_ABST
Patent Text Reader

Abstract

The invention relates to the technical field of data processing, in particular to a game user important data information encryption protection method which comprises the following steps: acquiring original data; the method comprises the following steps: desensitizing and coding original data to obtain game coding data, constructing a data key coefficient of each game user, and dividing the game coding data into two types according to the data key coefficient; encrypting each type of game coded data to obtain encrypted data; calculating the information confusion degree of each type of encrypted data according to the coordinate point of each type of encrypted data; selecting a random number according to the coordinate difference of the two types of game coded data, and obtaining a plurality of alternative keys from the random number by using a hash function; selecting a final random private key according to the information confusion degree of each alternative key; and completing encryption protection of original data of the game user according to the final random private key. According to the invention, the chaotic state of the transmitted ciphertext is ensured, the uncertainty of the ciphertext is high, and the ciphertext is more difficult to decode.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the technical field of data processing, and in particular to a method for encrypting and protecting important data information of game users. Background Art

[0002] With the continuous progress of society, games have been hailed as the ninth art and are experiencing a period of vigorous development. With the continuous evolution of technology and the in-depth integration of social culture, the game industry has become an indispensable part of people's daily life today. The various types of data generated by users in the process of participating in the game not only carry the time and effort of the users, but also contain certain practical value. Therefore, in the operation of the game, the protection of user data becomes particularly important, which not only involves the security of the user's personal account, but also directly related to the economic and commercial interests of the game company itself.

[0003] In today's digital gaming environment, user data includes not only basic personal information, but also multi-level content such as interaction records, virtual assets, social relationships, etc. during the game. The security of this data is directly related to the quality of user experience.

[0004] Therefore, the game data needs to be encrypted to prevent others from stealing it. When using the traditional ECC elliptic curve encryption algorithm for encryption, it is difficult to select the parameters of the elliptic curve, and there is no corresponding evaluation standard for different parameters. In the encryption process, the selection of the private key often uses a random large number without considering the state of the data, resulting in the inability to encrypt game data in different situations. Summary of the invention

[0005] In order to solve the technical problem of encrypting game data in different situations, the present invention provides a method for encrypting and protecting important data information of game users. The technical solution adopted is as follows:

[0006] The present invention proposes a method for encrypting and protecting important data information of game users, which comprises the following steps:

[0007] Get the raw data of all game users;

[0008] Desensitize the original data to obtain desensitized game data; use elliptic curve encoding to encode the desensitized game data to obtain game coded data; construct the data key coefficient of the game user based on the account information and financial information in the original data; divide the game coded data into two categories based on the data key coefficient to obtain two finite fields;

[0009] Encrypt each type of game coding data to obtain encrypted data; calculate the degree of information confusion of each type of encrypted data according to the coordinate points of each type of encrypted data;

[0010] Random numbers are selected based on the coordinate differences between the two types of game encoding data, and the random numbers are used to obtain several candidate keys using a hash function; the final random private key is selected based on the degree of information confusion of each candidate key;

[0011] The encryption protection of the original data of the game users is completed based on the encryption of the final random private key in different finite fields.

[0012] Preferably, the original data of all game users includes the game users' account information, character information, equipment information, and financial information.

[0013] Preferably, the method for desensitizing the original data to obtain the desensitized game data is:

[0014] The digital data in the original data is recorded as constant data, the ratio of each constant data to the preset constant is rounded down to obtain the first splicing value, each constant data is modulo-operated with the preset constant to obtain the second splicing value, the first splicing value and the second splicing value are spliced ​​to obtain a number, and the obtained number is recorded as the desensitized constant data. After all the constant data in the original data are desensitized, the original data is recorded as the desensitized game data.

[0015] Preferably, the method for constructing the data key coefficient of the game user based on the account information and financial information in the original data is:

[0016] The playing time and average weekly online times of each game user are extracted from the account information of the original data, and the recharge amount of each game user is extracted from the financial information of the original data; the product of the recharge amount and the playing time of each game user is recorded as the first product, the logarithm of the average weekly online times is taken to obtain the first logarithmic value, and the product of the first product and the first logarithmic value is recorded as the data key coefficient of the game user.

[0017] Preferably, the method of dividing the game encoding data into two categories according to the data key coefficient is:

[0018] The data key coefficient of each game user is linearly normalized, and the game users whose normalized values ​​are greater than or equal to the preset threshold are recorded as first-level encryption users, and the game users whose normalized values ​​are less than the preset threshold are recorded as second-level encryption users. The game coding data corresponding to all first-level encryption users are recorded as first game coding data, and the game coding data corresponding to all second-level encryption users are recorded as second game coding data. There is a first finite field for the first game coding data; and there is a second finite field for the second game coding data.

[0019] Preferably, the method for encrypting each type of game encoding data to obtain encrypted data is:

[0020] A preset base point, a private key and a random number private key are provided; and the product of the preset base point and the preset private key is used as the preset public key;

[0021] For each type of game encoding data, a random number private key and a preset public key are used to encrypt the first game encoding data into first encrypted data, and the second game encoding data into second encrypted data.

[0022] Preferably, the method for calculating the degree of information confusion of each type of encrypted data according to the coordinate points of each type of encrypted data is:

[0023]

[0024] Where, d 4,s represents the sth encrypted data; The horizontal coordinate of the game data point representing the sth encrypted data, The ordinate of the game data point representing the sth encrypted data, Represents the standard deviation of the horizontal coordinates of all game coordinate points in the sth encrypted data, represents the standard deviation of the ordinates of all game coordinate points in the sth encrypted data, P j (d 4,s ) represents the probability of the coordinates of the jth game data point in the sth encrypted data appearing, N s represents the number of game data points in the sth encrypted data, L(d 4,s ) represents the degree of ciphertext confusion of the sth encrypted data.

[0025] Preferably, the method of selecting a random number by using the coordinate difference of the two types of game encoding data and using a hash function to obtain several candidate keys is:

[0026] T o =(d 4,1,rand(o,U1) -d 4,2,rand(o,U2) )+rd

[0027] q o =MD5(T o ),o=1,2,3……,M

[0028] Where M represents a preset constant, U1 represents the number of first-level encryption users, U2 represents the number of second-level encryption users, rand(o,U1) represents a random number between [o,U1], and d 4,1,rand(o,U1) represents the game encoding data of the first-level encrypted user, rand(o,U1), rand(o,U2) represents a random number between [o,U2], d 4,2,rand(o,U2) represents the game encoding data of the second-level encrypted user of rand(o,U1), rd represents a random number, T orepresents the oth random feature; MD5() represents the hash function, q o Indicates the oth candidate key.

[0029] Preferably, the method for selecting the final random private key according to the degree of information confusion of each candidate key is:

[0030] Each candidate key is used as a random key, and the information confusion coefficient of the user's encrypted data is calculated under this random key. The candidate key corresponding to the maximum value of the information confusion coefficient is used as the final random private key.

[0031] Preferably, the method for completing encryption protection of the original data of the game user according to the encryption of the final random private key in different finite fields is:

[0032] Get elliptic curve E through server A p (a, b), base point G, private key k, and transmit it to server B. Server B desensitizes the original data and encodes it to obtain the game encoding data, and classifies the game encoding data. Through the final random private key, C1 is obtained in different finite fields, where C1 = r × G; after C1 and the ciphertext are transmitted from server B to server A, the ciphertext can be decrypted through the base point, private key, C1 and C2; the elliptic curve E p (a, b), base point G, private key k is stored in server A, ciphertext and final random private key are stored in server B, completing the encryption protection of the original data.

[0033] The present invention has the following beneficial effects: the present invention first digitally desensitizes the sensitive digital content that may exist in the user data, and constructs the key coefficient of the user data according to the characteristics of the game user data to accurately measure the importance of the user data. The user data is grouped according to the key coefficient of the data. Then, the user ciphertext data information chaos coefficient is constructed according to the degree of chaos of the grouped data ciphertext. The larger the chaos coefficient, the more secure the encrypted ciphertext information is. According to the encrypted data content and the random number, the alternative secret key is generated to ensure the randomness of the alternative secret key. The alternative secret key with the largest chaos coefficient is selected from the alternative secret keys as the private key. The chaotic state of the transmitted ciphertext is ensured, the uncertainty of the ciphertext is high, and it is more difficult to decipher. BRIEF DESCRIPTION OF THE DRAWINGS

[0034] In order to more clearly illustrate the technical solutions and advantages in the embodiments of the present invention or the prior art, the drawings required for use in the embodiments or the prior art descriptions are briefly introduced below. Obviously, the drawings described below are only some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative work.

[0035] Figure 1 A flowchart of a method for encrypting and protecting important data information of game users provided by an embodiment of the present invention;

[0036] Figure 2 The present invention is a flowchart of an implementation method for encrypting and protecting important data information of game users provided by an embodiment of the present invention. DETAILED DESCRIPTION

[0037] In order to further explain the technical means and effects adopted by the present invention to achieve the predetermined invention purpose, the following is a detailed description of a method for encrypting and protecting important data information of game users proposed by the present invention, its specific implementation method, structure, features and effects, in conjunction with the accompanying drawings and preferred embodiments. In the following description, different "one embodiment" or "another embodiment" does not necessarily refer to the same embodiment. In addition, specific features, structures or characteristics in one or more embodiments may be combined in any suitable form.

[0038] Unless defined otherwise, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this invention belongs.

[0039] An embodiment of a method for encrypting and protecting important data information of game users:

[0040] The following is a detailed description of a method for encrypting and protecting important data information of game users provided by the present invention in conjunction with the accompanying drawings.

[0041] See also Figure 1 , which shows a flow chart of a method for encrypting and protecting important data information of game users provided by an embodiment of the present invention, the method comprising the following steps:

[0042] Step S001, obtaining the original data of all game users.

[0043] When a game user plays a game, his account information will be stored in the database of the game company. Therefore, the account information of each game user is obtained from the database of the game company, and the role information, equipment information, financial information, etc. of the game user are queried through the account information of the game user. In this embodiment, the account information, role information, equipment information, and financial information of a game user are taken as an example, and all the information data of the game user are recorded as raw data d 1 .

[0044] At this point, the original data of all game users is obtained.

[0045] Step S002, desensitize the original data to obtain desensitized game data; use elliptic curve coding on the desensitized game data to obtain game coded data; construct a data key coefficient of the game user based on the account information and financial information in the original data; and divide the game coded data into two categories based on the data key coefficient.

[0046] Desensitize the numbers in the original data to make the information of all game users insensitive, reduce the distinction between high-value accounts and low-value accounts, and increase the difficulty of stealing high-value accounts; build data key coefficients to obtain high-value accounts among all game users, focus on protecting high-value accounts, and increase the difficulty of stealing high-value accounts.

[0047] The method for desensitizing numbers in the original data is:

[0048]

[0049] In the formula, num o represents the number before desensitization in the original data, α represents a conventional constant, which is set to 7 in this embodiment, Indicates rounding down, % indicates modulo operation, cat() indicates the concatenation of two numbers, num n The number represents the desensitized original data. The desensitized original data is recorded as d 2 For example, if the number before desensitization is 150, then 150%7=3, so the number after splicing is 213, and the number after desensitization of 150 is 213.

[0050] An elliptic curve is artificially selected and recorded as E p (a, b), encode the desensitized original data onto the elliptic curve. There are many known techniques for encoding onto the elliptic curve, which will not be elaborated here. Encode the desensitized original data of all game users to obtain several game coordinate points, and record the encoded data as d 3 , where encoding is to encode the original data of each game user to obtain a game coordinate point.

[0051] Different levels of protection are provided for accounts of different values, and high-value accounts are given special protection. The high-value accounts are determined by the recharge amount, playing time, and average weekly online times of game users. Based on these three factors, the key coefficient of game user data is constructed. The formula is as follows:

[0052] A i =(RM i +PH i )×ln(FM i +1)

[0053] In the formula, RM i Indicates the recharge amount of game user i in the game, PH i Indicates the playing time of game user i, FM i A represents the average weekly online times of game user i, i Indicates the data criticality coefficient of game user i. Among them, the longer the playing time and the larger the recharge amount, the more valuable the game data of the game user in the game is; the average weekly online times indicate the active status of the game user. The more active the game user is, the more valuable the game data of the game user in the game is, and the more encryption protection is needed.

[0054] The key coefficient of each game user's data is linearly normalized, and the game account of the game user with a larger normalized value is regarded as a high-value account. Game users with a normalized value greater than or equal to 0.5 are recorded as first-level encrypted users, and their finite domain is set to p 1 , record the game users whose normalized value is less than 0.5 as the second-level encrypted users, and set their finite field to be p 2 In this embodiment, the finite field p 1 =256, finite field p 2 =128. The coded data corresponding to the first-level encrypted user is recorded as d 3,1 , the encoded data corresponding to the second-level encrypted user is recorded as d 3,2 .

[0055] At this point, the encoded data of different game users and their corresponding finite fields have been obtained.

[0056] Step S003, encrypting each type of game coding data to obtain encrypted data; calculating the degree of information confusion of each type of encrypted data according to the coordinate points of each type of encrypted data.

[0057] In the asymmetric encryption process of the ECC elliptic curve, the base point G and the private key k are set manually, and different public keys are calculated in different finite fields. The public key calculation formula is: K = G × k, G is the base point, expressed as a coordinate, and the private key k is a value that is less than the ordinate of the base point. The obtained public key is K, and K is expressed as a coordinate. The K value represents two coordinates in different finite fields, recorded as and Then, a random private key r is set manually, and data encryption is completed according to the random private key, public key and encoded data to obtain the user's encrypted data. The formula is d 4 =d 3 +r×K, where encryption is performed in different finite fields, and the data after the first-level encryption user's coded data is encrypted is recorded as the first encrypted data d 4,1 , the encrypted data of the second-level encrypted user is recorded as the second encrypted data d 4,2There are several game coordinate points in both the first encrypted data and the second encrypted data. The degree of ciphertext confusion is obtained according to the horizontal and vertical coordinates of the game coordinate points and the frequency of each coordinate. The formula is as follows:

[0058]

[0059] Where, d 4,s Represents the sth encrypted data, s is 1 or 2; The horizontal coordinate of the game data point representing the sth encrypted data, The ordinate of the game data point representing the sth encrypted data, Represents the standard deviation of the horizontal coordinates of all game coordinate points in the sth encrypted data, Represents the standard deviation of the ordinates of all game coordinate points in the sth encrypted data,

[0060] P j (d 4,s ) represents the probability of the coordinates of the jth game data point in the sth encrypted data appearing, N s represents the number of game data points in the sth encrypted data, L(d 4,s ) represents the degree of ciphertext confusion of the sth encrypted data.

[0061] The information chaos coefficient of the user encrypted data is obtained by adding the ciphertext chaos degree of the first encrypted data and the second encrypted data. The weaker the regularity of the ciphertext of the user encrypted data, the stronger the chaos degree, the more difficult it is for an eavesdropper to crack it, and the more secure the user encrypted data. The standard deviation of the horizontal axis in the encrypted data The larger the value, the more discrete the data is horizontally in the finite field, and the standard deviation of the coordinates The larger the value, the more discrete the data is in the vertical direction in the finite field. The second term is the information entropy of the data in the finite field. The larger the entropy, the greater the uncertainty of the ciphertext information. The larger the standard deviation and entropy, the greater the information confusion coefficient of the user's encrypted data, which means that the ciphertext information is more chaotic and the encryption effect is better.

[0062] The above formula calculates the information confusion coefficient of the user's encrypted data when the elliptic curve, finite field, base point, private key k and random number private key r are all known.

[0063] At this point, the information confusion coefficient of the user's encrypted data is obtained.

[0064] Step S004, selecting a random number based on the coordinate difference between the two types of game encoding data, and using a hash function to obtain several candidate keys; selecting a final random private key based on the degree of information confusion of each candidate key.

[0065] Since different random private key encryptions will obtain different encryption results, when the finite field p is determined, the distribution of user ciphertext data can only be affected by the random private key r. When the key used is 128 bits, it is unrealistic to find the most suitable random private key r by exhaustively enumerating all possible numbers. In the face of such a large number of numbers, exhaustive enumeration is a time-consuming and laborious task of huge calculations. Compared with the limited improvement of the encryption effect by a reasonable random private key r, the time spent on the exhaustive method is not proportional to the benefits of encryption. Therefore, a more reasonable random private key r is calculated by the information confusion coefficient of the user's encrypted data.

[0066] In order to ensure the randomness of the random number private key and to reduce the amount of calculation, a constant M is first defined. In this embodiment, M is set to 20. The number of first-level encryption users is recorded as U1, and the number of second-level encryption users is recorded as U2. The candidate key is obtained by the following formula:

[0067] T o =(d 4,1,rand(o,U1) -d 4,2,rand(o,U2) )+rd

[0068] q o =MD5(T o ),o=1,2,3……,M

[0069] In the formula, rand(o,U1) represents a random number between [o,U1], d 4,1,rand(o,U1) represents the encoded data of the first-level encrypted user, rand(o,U1), rand(o,U2) represents a random number between [o,U2], d 4,2,rand(o,U2) represents the encoded data of the second-level encrypted user of rand(o,U1), rd represents a random number, and the addition and subtraction of the user's encrypted data are the addition and subtraction of the horizontal and vertical coordinates at the same time. o represents the oth random feature; MD5() represents the hash function, q o Represents the oth candidate key. The difference between the encrypted data of two users in different finite fields improves the randomness of the random number and has higher security.

[0070] For each candidate key, the information confusion coefficient of the user's encrypted data under the candidate key is calculated, and the candidate key corresponding to the maximum information confusion coefficient is used as the final random private key. Under the effect of the final random private key, the encrypted data is more statistically chaotic and less regular, thus having higher security.

[0071] Step S005, completing encryption protection of the original data of the game user according to the final random private key.

[0072] According to the above steps, the final random private key is obtained. Since the game user data will be transmitted in the server, for server A, an elliptic curve E is randomly obtained. p (a, b), base point G, private key k; Server A transmits the obtained elliptic curve, base point, and private key to Server B, Server B encodes the transmitted plaintext to obtain the encoded data, and then classifies the encoded data, puts it in different finite fields, and calculates the final random private key, and obtains C1 in different finite fields respectively through the final random private key, where C1 = r×G; There is one C1 in each of the two finite fields, and the first encrypted data d is obtained in the two finite fields respectively through the final random private key 4,1 and the second encrypted data d 4,2 , the first encrypted data and the second encrypted data are the ciphertexts of two finite fields respectively; after server B transmits C1 of each finite field and the ciphertext corresponding to each finite field to server A, it decrypts C1 of each finite field and the ciphertext of the finite field to obtain the encoded data, and the decryption method is d 3,1 =d 4,1 -C1×K and d 3,2 =d 4,2 -C1×K, reverse the encoded data to get the desensitized data, and reverse the encoded data to get the plaintext data, i.e. the game user data. Server A only stores the elliptic curve E p (a, b), base point G, private key k; server B saves the final random key and ciphertext. If someone steals the game user information, it is impossible to decrypt it by only obtaining the data of one server. Therefore, the encryption protection of the game user data is completed through the private keys set by the two servers. The implementation flow chart of encryption is as follows: Figure 2 shown.

[0073] It should be noted that the sequence of the above embodiments of the present invention is only for description and does not represent the advantages and disadvantages of the embodiments. The processes depicted in the accompanying drawings do not necessarily require the specific order or continuous order shown to achieve the desired results. In some embodiments, multitasking and parallel processing are also possible or may be advantageous.

[0074] The various embodiments in this specification are described in a progressive manner, and the same or similar parts between the various embodiments can be referenced to each other, and each embodiment focuses on the differences from other embodiments.

Claims

1. A method for encrypting and protecting important data information of game users. It is characterized in that The method comprises the following steps: Get the raw data of all game users; Desensitize the original data to obtain desensitized game data; use elliptic curve encoding to encode the desensitized game data to obtain game coded data; construct the data key coefficient of the game user based on the account information and financial information in the original data; divide the game coded data into two categories based on the data key coefficient to obtain two finite fields; Encrypt each type of game coding data to obtain encrypted data; calculate the degree of information confusion of each type of encrypted data according to the coordinate points of each type of encrypted data; Random numbers are selected based on the coordinate differences between the two types of game encoding data, and the random numbers are used to obtain several candidate keys using a hash function; the final random private key is selected based on the degree of information confusion of each candidate key; The encryption protection of the original data of the game users is completed based on the encryption of the final random private key in different finite fields.

2. A method for encrypting and protecting important game user data as claimed in claim 1, It is characterized in that The original data of all game users includes game users' account information, character information, equipment information, and financial information.

3. A method for encrypting and protecting important game user data as claimed in claim 1, It is characterized in that The method for desensitizing the original data to obtain the desensitized game data is: The digital data in the original data is recorded as constant data, the ratio of each constant data to the preset constant is rounded down to obtain the first splicing value, each constant data is modulo-operated with the preset constant to obtain the second splicing value, the first splicing value and the second splicing value are spliced ​​to obtain a number, and the obtained number is recorded as the desensitized constant data. After all the constant data in the original data are desensitized, the original data is recorded as the desensitized game data.

4. A method for encrypting and protecting important game user data as claimed in claim 1, It is characterized in that The method for constructing the data key coefficient of the game user based on the account information and financial information in the original data is: The playing time and average weekly online times of each game user are extracted from the account information of the original data, and the recharge amount of each game user is extracted from the financial information of the original data; the product of the recharge amount and the playing time of each game user is recorded as the first product, the logarithm of the average weekly online times is taken to obtain the first logarithmic value, and the product of the first product and the first logarithmic value is recorded as the data key coefficient of the game user.

5. A method for encrypting and protecting important data information of game users as claimed in claim 1, It is characterized in that The method of dividing the game coding data into two categories according to the data key coefficient to obtain two finite fields is: The data key coefficient of each game user is linearly normalized, and the game users whose normalized values ​​are greater than or equal to the preset threshold are recorded as first-level encryption users, and the game users whose normalized values ​​are less than the preset threshold are recorded as second-level encryption users. The game coding data corresponding to all first-level encryption users are recorded as first game coding data, and the game coding data corresponding to all second-level encryption users are recorded as second game coding data. There is a first finite field for the first game coding data; and there is a second finite field for the second game coding data.

6. A method for encrypting and protecting important game user data as claimed in claim 1, It is characterized in that The method for encrypting each type of game encoding data to obtain encrypted data is: A preset base point, a private key and a random number private key are provided; and the product of the preset base point and the preset private key is used as the preset public key; For each type of game encoding data, a random number private key and a preset public key are used to encrypt the first game encoding data into first encrypted data, and the second game encoding data into second encrypted data.

7. A method for encrypting and protecting important game user data as claimed in claim 1, It is characterized in that The method for calculating the degree of information confusion of each type of encrypted data according to the coordinate points of each type of encrypted data is: Where, d 4,s represents the sth encrypted data; The horizontal coordinate of the game data point representing the sth encrypted data, The ordinate of the game data point representing the sth encrypted data, Represents the standard deviation of the horizontal coordinates of all game coordinate points in the sth encrypted data, represents the standard deviation of the ordinates of all game coordinate points in the sth encrypted data, P j (d 4,s ) represents the probability of the coordinates of the jth game data point in the sth encrypted data appearing, N s represents the number of game data points in the sth encrypted data, L(d 4,s ) represents the degree of ciphertext confusion of the sth encrypted data.

8. A method for encrypting and protecting important data information of game users as claimed in claim 1, It is characterized in that The method of selecting random numbers by using the coordinate difference of the two types of game encoding data and using the random numbers to obtain several candidate keys using a hash function is as follows: T o =(d 4,1,rand(o,U1) -d 4,2,rand(o,U2) )+rd q o =MD5(T o ),o=1,2,3……,M Where M represents a preset constant, U1 represents the number of first-level encryption users, U2 represents the number of second-level encryption users, rand(o,U1) represents a random number between [o,U1], and d 4,1,rand(o,U1) represents the game encoding data of the first-level encrypted user, rand(o,U1), rand(o,U2) represents a random number between [o,U2], d 4,2,rand(o,U2) represents the game encoding data of the second-level encrypted user of rand(o,U1), rd represents a random number, T o represents the oth random feature; MD5() represents a hash function, q o Indicates the oth candidate key.

9. A method for encrypting and protecting important data information of game users as claimed in claim 1, It is characterized in that The method for selecting the final random private key according to the degree of information confusion of each candidate key is: Each candidate key is used as a random key, and the information confusion coefficient of the user's encrypted data is calculated under this random key. The candidate key corresponding to the maximum value of the information confusion coefficient is used as the final random private key.

10. A method for encrypting and protecting important data information of game users as claimed in claim 1, It is characterized in that The method for completing encryption protection of the original data of the game user according to the encryption of the final random private key in different finite fields is: Get elliptic curve E through server A p (a, b), base point G, private key k, and transmit it to server B. Server B desensitizes the original data and encodes it to obtain the game encoding data, and classifies the game encoding data. Through the final random private key, C1 is obtained in different finite fields, where C1 = r × G; after C1 and the ciphertext are transmitted from server B to server A, the ciphertext can be decrypted through the base point, private key, C1 and C2; the elliptic curve E p (a, b), base point G, private key k is stored in server A, ciphertext and final random private key are stored in server B, completing the encryption protection of the original data.

Citation Information

Patent Citations

  • An encryption and decryption methods and devices in multicast communication

    CN110011995A

  • Cooperative signature method, device and system based on elliptic curve

    CN113158258A

  • Random number encrypted data transmission method and device, computer equipment and storage medium

    CN116866029A

  • Privacy protection method and system for local production data of equipment

    CN117113383A

  • 3C product rental platform data processing method based on data compression and encryption

    CN117708847A