CN107320959B

CN107320959B - Game role identification information generation method, device, medium and electronic equipment

Info

Publication number: CN107320959B
Application number: CN201710509524.7A
Authority: CN
Inventors: 江浩亮; 周克利
Original assignee: Netease Hangzhou Network Co Ltd
Current assignee: Netease Hangzhou Network Co Ltd
Priority date: 2017-06-28
Filing date: 2017-06-28
Publication date: 2020-10-23
Anticipated expiration: 2037-06-28
Also published as: CN107320959A

Abstract

The disclosure relates to a game role identification information generation method, a game role identification information generation device, a storage medium and electronic equipment. The method comprises the following steps: when a creating request of a game role is received, responding to the creating request and carrying out preset calculation on a preset first numerical value to obtain a second numerical value; and calculating the second numerical value corresponding to the game role according to a preset algorithm to obtain unique identification information corresponding to the game role, and sending the unique identification information to a client. The method and the device can shorten the character creating time, avoid high consumption of the performance of the game server, and reduce the load pressure of the game server when the player creates the character.

Description

Game role identification information generation method, device, medium and electronic equipment

Technical Field

The present disclosure relates to the field of computer technologies, and in particular, to a game character identification information generation method, a game character identification information generation apparatus, and a computer-readable storage medium and an electronic device for implementing the game character identification information generation method.

Background

With the rapid development of information technology, online games have been enjoyed by more and more people as a way of leisure and entertainment. The current network game system is generally established on a communication network, and comprises a game server at a network side and a game client at a terminal side, wherein a user can establish one or more roles through the game client and name the established roles.

In the related art, each character in the network game has a digital ID as unique identification information of the character, and the player confirms the character by the digital ID to realize operations such as searching for other players in the network game. The number ID is generated in many ways, for example, a disordered number ID generation way is adopted, in which a number item exceeding the number of characters expected by the game server is created in a database before the game server is opened, each number item includes two elements, such as key and value, the key is a number, and the value is logic False or True. When a player creates a character, the player can look up the number with value False, i.e. the number that is not used, in the database as the number ID of the character, and then set the value of the number to True, i.e. identify that the number is used.

However, whether a certain numerical value is used or not is identified through the database, so that the database is accessed every time a player creates a character, the pressure of the database is increased, and the time for the player to create the character is prolonged; especially, in the initial stage of the game, a large number of players enter the game server at the same time to create characters, which causes high consumption of performance on the server side, and may even cause the game server to crash if the pressure on the game server is too high. In addition, it also results in an excessively long character creation time, which in turn results in an extremely poor user game experience.

Therefore, there is a need to provide a new technical solution to improve one or more of the problems in the above solutions.

It is to be noted that the information disclosed in the above background section is only for enhancement of understanding of the background of the present disclosure, and thus may include information that does not constitute prior art known to those of ordinary skill in the art.

Disclosure of Invention

An object of the present disclosure is to provide a game character identification information generating method, a game character identification information generating apparatus, and a computer-readable storage medium and an electronic device implementing the game character identification information generating method, thereby overcoming, at least to some extent, one or more problems caused by the limitations and disadvantages of the related art.

Additional features and advantages of the disclosure will be set forth in the detailed description which follows, or in part will be obvious from the description, or may be learned by practice of the disclosure.

According to a first aspect of the embodiments of the present disclosure, there is provided a method for generating game character identification information, which is applied to a game server, the method including:

when a creating request of a game role is received, responding to the creating request and carrying out preset calculation on a preset first numerical value to obtain a second numerical value; wherein the preset first numerical value is used for representing the number of the game characters which are created;

and calculating the second numerical value corresponding to the game role according to a preset algorithm to obtain unique identification information corresponding to the game role, and sending the unique identification information to a client.

In an exemplary embodiment of the disclosure, the performing, in response to the creation request, a preset calculation on a preset first value to obtain a second value includes:

and responding to the creation request and increasing the preset first value by a calculation to obtain the second value.

In an exemplary embodiment of the present disclosure, the preset algorithm includes an RSA algorithm; the calculating the second numerical value corresponding to the game role according to a preset algorithm to obtain the unique identification information corresponding to the game role comprises:

and calculating the second numerical value corresponding to the game role according to the RSA algorithm so as to obtain the unique identification information corresponding to the game role.

In an exemplary embodiment of the present disclosure, the unique identification information is an out-of-order digital ID.

In an exemplary embodiment of the present disclosure, the first value is set in a memory of the game server.

In an exemplary embodiment of the present disclosure, the method further comprises:

and setting the first numerical value in the memory of the game server when the game server is started, and storing the updated first numerical value in a database when the game server is stopped.

and when the game server is restarted after stopping, loading the stored first numerical value into the memory from the database.

According to a second aspect of the embodiments of the present disclosure, there is provided a game character identification information generation apparatus including:

the numerical value calculation module is used for responding to a creation request of a game role and performing preset calculation on a preset first numerical value to obtain a second numerical value when the creation request is received; wherein the preset first numerical value is used for representing the number of the game characters which are created;

and the identification determining module is used for calculating the second numerical value corresponding to the game role according to a preset algorithm to obtain unique identification information corresponding to the game role and sending the unique identification information to the client.

According to a third aspect of the embodiments of the present disclosure, there is provided a computer-readable storage medium having stored thereon a computer program which, when executed by a processor, implements the steps of the game character identification information generation method described in any one of the above embodiments.

According to a fourth aspect of the embodiments of the present disclosure, there is provided an electronic apparatus including:

a processor; and

a memory for storing executable instructions of the processor;

wherein the processor is configured to perform the steps of the game character identification information generation method in any one of the above embodiments via execution of the executable instructions.

The technical scheme provided by the embodiment of the disclosure can have the following beneficial effects:

in an embodiment of the present disclosure, by the method and the apparatus for generating identification information of a game character, when a request for creating a game character is received, a preset calculation is performed according to a first numerical value representing the number of created game characters to obtain a second numerical value, and then the second numerical value corresponding to the game character is directly calculated according to a preset algorithm to obtain unique identification information; therefore, on one hand, the role can be created without accessing the database, so that the role creation time is shortened, the high consumption of the performance of the game server end is avoided, and the load pressure of the game server end when a player creates the role is reduced; on the other hand, the performance of the game server can be indirectly further improved, so that the game experience of the player is enhanced.

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 disclosure.

Drawings

The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the present disclosure and together with the description, serve to explain the principles of the disclosure. It is to be understood that the drawings in the following description are merely exemplary of the disclosure, and that other drawings may be derived from those drawings by one of ordinary skill in the art without the exercise of inventive faculty.

Fig. 1 schematically shows a flow chart of a game character identification information generation method in an exemplary embodiment of the present disclosure;

FIG. 2 schematically illustrates a flow chart of another game character identification information generation method in an exemplary embodiment of the present disclosure;

fig. 3 schematically shows a flowchart of still another game character identification information generation method in an exemplary embodiment of the present disclosure;

FIG. 4 is a schematic diagram illustrating a game character creation time comparison in an exemplary embodiment of the present disclosure;

FIG. 5 is a schematic diagram illustrating server performance comparison at game character creation in an exemplary embodiment of the present disclosure;

fig. 6 schematically illustrates a game character identification information generation apparatus in an exemplary embodiment of the present disclosure;

FIG. 7 schematically illustrates a computer-readable storage medium in an exemplary embodiment of the disclosure;

fig. 8 schematically illustrates an electronic device in an exemplary embodiment of the disclosure.

Detailed Description

Example embodiments will now be described more fully with reference to the accompanying drawings. Example embodiments may, however, be embodied in many different forms and should not be construed as limited to the examples set forth herein; rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the concept of example embodiments to those skilled in the art. The described features, structures, or characteristics may be combined in any suitable manner in one or more embodiments.

Furthermore, the drawings are merely schematic illustrations of the present disclosure and are not necessarily drawn to scale. The same reference numerals in the drawings denote the same or similar parts, and thus their repetitive description will be omitted. Some of the block diagrams shown in the figures are functional entities and do not necessarily correspond to physically or logically separate entities. These functional entities may be implemented in the form of software, or in one or more hardware modules or integrated circuits, or in different networks and/or processor devices and/or microcontroller devices.

First, the present exemplary embodiment provides a game character identification information generation method, which can be applied to a game server, which can be a server of various network games. Referring to fig. 1, the method may include the steps of:

step S101: when a creating request of a game role is received, responding to the creating request and carrying out preset calculation on a preset first numerical value to obtain a second numerical value; wherein the preset first value is used for representing the number of the game characters which are created.

Step S102: and calculating the second numerical value corresponding to the game role according to a preset algorithm to obtain unique identification information corresponding to the game role, and sending the unique identification information to a client.

By the game role identification information generation method, on one hand, a role can be created without accessing a database, so that the role creation time is shortened, high consumption of performance of a game server end is avoided, and the load pressure of the game server end when a player creates the role is reduced; on the other hand, the performance of the game server can be indirectly further improved, so that the game experience of the player is enhanced.

Hereinafter, the respective steps of the above-described method in the present exemplary embodiment will be described in more detail with reference to fig. 1 to 5.

In step S101, when a request for creating a game character is received, a preset first numerical value is calculated in response to the request for creating the game character to obtain a second numerical value; wherein the preset first value is used for representing the number of the game characters which are created.

In this example embodiment, the first value may be zero initially, and may be incremented each time a game character is created. When receiving a creation request of a game character, the game character may receive one creation request at a time at different time points, or may receive a plurality of creation requests at the same time. When a plurality of creation requests are received, the preset calculation may be performed on the first numerical value in response to each creation request in sequence, or the preset calculation may be performed on the first numerical value in response to each creation request at random, which is not limited in this embodiment.

In an exemplary embodiment of the disclosure, the pre-calculating the preset first value to obtain the second value in response to the creation request in step S101 may include: and responding to the creation request and increasing the preset first value by a calculation to obtain the second value.

For example, a value N may be maintained in the memory of the game server at the time of starting, where the value N corresponds to the first value, and the value N records the number of game characters that have been created. The value N may be incremented, e.g. by 1, and updated, e.g. to said second value, each time a new game character is created. Of course, in other exemplary embodiments of the present disclosure, a new game character may be created according to the special requirement of the service provider, and the value N may be increased by other magnitudes such as adding 2 and adding 3, which is not limited in this exemplary embodiment.

On the basis of the above embodiments, in another exemplary embodiment of the present disclosure, the first value may be initially set in a memory of the game server. Therefore, the calculation can be directly called by the memory during the calculation, the method is simple and convenient, the performance consumption is low, the calculation time is short, and the role creation time is shortened.

In step S102, the second numerical value corresponding to the game character is calculated according to a preset algorithm to obtain unique identification information corresponding to the game character, and the unique identification information is sent to a client.

Illustratively, in an exemplary embodiment of the present disclosure, the unique identification information may include, but is not limited to, a numeric ID that is out of order. The scrambled number ID indicates that the number of characters of the player is not included in the number ID, and the player cannot know the number of players in the game server by the number ID. For example, if the incremental numerical value is simply used as the numerical ID corresponding to the player's character, the player can know the number of players in the game server according to the rule and the numerical ID, so as to affect the judgment and game experience of the player. The preset algorithm in this embodiment may include, but is not limited to, an RSA algorithm, for example, other asymmetric public key encryption algorithms that may map the first value to the unique digital ID may also be used, which is not particularly limited in this exemplary embodiment. Correspondingly, the calculating the second numerical value corresponding to the game character according to the preset algorithm to obtain the unique identification information corresponding to the game character may include: and calculating the second numerical value corresponding to the game role according to the RSA algorithm so as to obtain the unique identification information corresponding to the game role.

For example, when a request for creating a new game character is sent to the game server side, the game server adds 1 to the value N and applies the mathematical algorithm Q_(N)Generating a corresponding out-of-order numerical ID, i.e. Q_(N)Is a numerical ID. Here, it is ensured that Q is generated for a given value of N_(N)Is unique, and Q_(N)Can only be generated by one N value, and does not allow multiple values to pass through the algorithm Q_(N)The same values are generated. In the present exemplary embodiment, the RSA algorithm is used as the mathematical algorithm Q_(N)Which can satisfy the above for N and Q_(N)Is generated byAnd (6) obtaining. Further details will be given below by taking the RSA algorithm as an example. First, the following mathematical concepts are explained:

first, Euler function:

and (3) giving a positive integer n, wherein the number of the positive integers less than or equal to n and n form a relatively prime relation, and the number is the Euler function r. When n is prime, r is n-1 because prime and every number less than it form a relatively prime relationship. When n can be decomposed as the product of two relatively prime integers p, q, r is (p-1) × (q-1).

II, Euler's theorem:

if the two positive integers a and b are relatively prime, the Euler function r of b guarantees that the following equation holds:

a^r≡1(mod b) (1)

when b is a prime number, r is b-1, so the euler's theorem can be rewritten as follows:

a^b-1≡1(mod b) (2)

equation 2 above is a special case of the euler theorem, namely the fermat theorem.

III, modular reverse element

If the two positive integers a and n are prime, then one must find an integer b, such that a b ≡ 1(mod n). The integer b is now called the modulo element of a. Obtaining a by Euler's theorem^r＝a*a^r-11(mod n), obviously a^r-1Namely the modulo inverse element b.

Next, the RSA algorithm will be explained. The RSA algorithm is an asymmetric encryption algorithm, which is often used in network communication encryption, and is currently recognized as the most secure encryption algorithm possible. The RSA algorithm may be described specifically as follows:

1) the RSA algorithm involves three parameters, n, e1, e 2; where n is the product of two large prime numbers p, q.

2) From the euler function, rn is determined as (p-1) (q-1).

3) e1 and e2 are a pair of related values, e1 can be arbitrarily selected, but e1 is required to be relatively prime to rn, and e2 is selected, e1 ≡ e2 ≡ 1(mod rn); where the modulo element e2 is present, if and only if e1 is relatively prime to rn.

4) And (3) encryption algorithm:

A＝B^e1mod n (3)

and (3) decryption algorithm:

B＝A^e2mod n (4)

wherein, B is the data before encryption, A is the data after encryption, A and B are full shot, that is, B obtains only A through the encryption algorithm of RSA, A obtains only B through the RSA decryption algorithm. Attestation of the RSA algorithm, i.e. attestation A^e2≡ b (modn) as follows:

according to the encryption rule B^e1≡ a (mod n) the following is deduced:

A＝B^e1-kn (5)

substituting it into the decryption equation to be certified yields the following:

(B^e1-kn)^e2≡B(mod n) (6)

this equation 6 is equivalent to the evidence of the following equation 7

B^e1*e2≡B(mod n) (7)

Due to e1 e2 ≡ 1(mod rn), the following formula is obtained:

e1*e2＝h*rn+1 (8)

substituting equation 8 into equation 7 yields the following equation:

B^h*rn+1≡B(mod n) (9)

when B and n are relatively prime, according to Euler's theorem, the following equation can be obtained:

B^rn≡1(mod n) (10)

namely, it is

B^h*rn*B≡B(mod n) (11)

Thus, equation 4 above is demonstrated.

When B and n are not prime to each other, since n is the product of two large prime numbers p and q, B and n must have a common divisor p or q, and B ═ kp or B ═ kq. Here, it is proved that B ═ kp is taken as an example, and since B is smaller than n, it is clear that B and q are relatively prime, the following equation holds true by euler's theorem:

kp^q-1≡1(mod q) (12)

equation 12 is further extended to obtain the following equation:

(kp)^(q-1)*h(p-1)*kp≡kp(mod q) (13)

substituting equation 8 into equation 13 yields the following equation:

(kp)^e1*e2≡kp(mod q) (14)

namely, it is

(kp)^e1*e2≡sq+kp (15)

Obviously, s is a multiple of p, i.e., s ═ dp is substituted into equation 15 to obtain the following equation:

(kp)^e1*e2≡dpq+kp (16)

the original formula is verified by substituting B ═ kp and n ═ pq into formula 16 to obtain formula 7.

Through the above certification process, it can be confirmed that the algorithms a and B are surreptitious through RSA, that is, B obtains a unique a through the encryption algorithm of RSA, and a obtains a unique B through the RSA decryption algorithm. A unique numerical ID corresponding to each game character can be obtained by the exemplary RSA algorithm.

Finally, in the present exemplary embodiment, assuming that the game server plan can create 999997 characters at most, n is 999997, p is 757, and q is 1321. Based on this, e1 may be 13 in order to ensure that e1 is relatively prime with (p-1) × (q-1). Assume that the value N is incremented by 15 at this time. Then the generated numeric ID can be found to be according to the RSA algorithm, equation 3:

Q_(N)＝Q₍₁₅₎＝15¹³mod 999997＝962093。

in the example, the numerical value N is calculated by using an RSA algorithm to generate the unique out-of-order numerical ID, so that the method is simple and convenient, the calculation speed is high, and the time is saved. The generated digital ID may then be sent to the game client, i.e., the entire digital ID creation process is complete.

Referring to fig. 2, on the basis of the above embodiments, in an exemplary embodiment of the present disclosure, the method may further include the steps of:

step S201: and setting the first numerical value in the memory of the game server when the game server is started.

Illustratively, the value N is set in a memory of the game server, for example, and is used to record the number of game characters that have been created.

Step S202: and when the game server is stopped, the updated first numerical value is stored in a database.

Illustratively, after the game server is started, the value N is incremented by 1 each time a new game character is created. And saving the updated number of the game characters which are created currently into the database when the game is stopped. I.e. the value N is saved to the database when maintenance is stopped.

Referring to fig. 3, on the basis of the above embodiments, in an exemplary embodiment of the present disclosure, the method may further include the steps of:

step S203: and when the game server is restarted after stopping, loading the stored first numerical value into the memory from the database. For example, when the game is re-opened, the saved value N is loaded from the database into the memory, so as to facilitate the creation of a new game character after re-opening.

In order to reduce the performance pressure on the game server end when the player creates a character and shorten the time period for creating the character, the method in this example embodiment may maintain an increment value N in the memory of the game server, record the number of characters that have been created, and generate a unique out-of-order digital ID by applying, for example, an RSA algorithm to the increment value within O (1) in time complexity, for example, when the execution is performed once, reduce or even avoid access to a database in the related art, thereby reducing the load pressure on the game server end when the player creates a character, shortening the time for creating a character, further improving the performance of the game server, and enhancing the game experience of the player.

The technical effects of the present exemplary embodiment will be described in comparison with fig. 4 and 5. Referring to fig. 4, when, for example, 1000 players create characters at the same time, the average creation time of the scheme for generating digital IDs using the RSA algorithm of this example is only 1/5 of the scheme for generating digital IDs using, for example, a database in the related art, which greatly shortens the character creation time and thus can make the player game experience significantly improved.

Referring to fig. 5, when, for example, 1000 players create characters at the same time, the scheme of generating a digital ID by using the database in the related art is much more stressful to the game server than the scheme of generating a digital ID by using the present exemplary RSA algorithm, so that the present exemplary embodiment can greatly reduce the stressful to the game server, thereby improving the performance of the game server.

It should be noted that although the various steps of the methods of the present disclosure are depicted in the drawings in a particular order, this does not require or imply that these steps must be performed in this particular order, or that all of the depicted steps must be performed, to achieve desirable results. Additionally or alternatively, certain steps may be omitted, multiple steps combined into one step execution, and/or one step broken down into multiple step executions, etc. Additionally, it will also be readily appreciated that the steps may be performed synchronously or asynchronously, e.g., among multiple modules/processes/threads.

Further, in the present exemplary embodiment, a game character identification information generation apparatus is also provided. Referring to fig. 6, the apparatus 100 may include a numerical calculation module 101 and an identification determination module 102. Wherein:

the numerical value calculation module 101 is configured to, when a creation request of a game character is received, perform preset calculation on a preset first numerical value in response to the creation request to obtain a second numerical value; wherein the preset first value is used for representing the number of the game characters which are created.

The identification determining module 102 is configured to calculate the second numerical value corresponding to the game character according to a preset algorithm to obtain unique identification information corresponding to the game character, and send the unique identification information to a client.

In an exemplary embodiment of the disclosure, the value calculating module 101 may be configured to add a calculation to the preset first value in response to the creation request to obtain the second value.

In an exemplary embodiment of the present disclosure, the preset algorithm may include, but is not limited to, an RSA algorithm. Correspondingly, the identifier determining module 102 may be configured to calculate the second value corresponding to the game character according to the RSA algorithm, so as to obtain the unique identifier information corresponding to the game character.

In an exemplary embodiment of the present disclosure, the unique identification information may include, but is not limited to, a numeric ID that is out of order.

In an exemplary embodiment of the present disclosure, the first value may be set in a memory of the game server.

In an exemplary embodiment of the disclosure, the apparatus 100 may further include a data setting storage module, configured to set the first value in a memory of the game server when the game server is started, and store the updated first value in a database when the game server is stopped.

In an exemplary embodiment of the disclosure, the apparatus 100 may further include a data loading module, configured to load the saved first value from the database into the memory when the game server is restarted after the game server is stopped.

With regard to the apparatus in the above-described embodiment, the specific manner in which each module performs the operation has been described in detail in the embodiment related to the method, and will not be elaborated here.

It should be noted that although in the above detailed description several modules or units of the device for action execution are mentioned, such a division is not mandatory. Indeed, the features and functionality of two or more modules or units described above may be embodied in one module or unit, according to embodiments of the present disclosure. Conversely, the features and functions of one module or unit described above may be further divided into embodiments by a plurality of modules or units. The components shown as modules or units may or may not be physical units, i.e. may be located in one place or may also be distributed over a plurality of network units. Some or all of the modules can be selected according to actual needs to achieve the purpose of the disclosed solution. One of ordinary skill in the art can understand and implement it without inventive effort.

In an exemplary embodiment of the present disclosure, there is also provided a computer-readable storage medium having stored thereon a computer program which, when executed by, for example, a processor, can implement the steps of the game character identification information generation method described in any one of the above embodiments. In some possible embodiments, aspects of the present invention may also be implemented in the form of a program product including program code for causing a terminal device to perform the steps according to various exemplary embodiments of the present invention described in the above-mentioned game character identification information generation method section of this specification, when the program product is run on the terminal device.

Referring to fig. 7, a program product 300 for implementing the above method according to an embodiment of the present invention is described, which may employ a portable compact disc read only memory (CD-ROM) and include program code, and may be run on a terminal device, such as a personal computer. However, the program product of the present invention is not limited in this regard and, in the present document, a readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device.

The program product may employ any combination of one or more readable media. The readable medium may be a readable signal medium or a readable storage medium. A readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples (a non-exhaustive list) of the readable storage medium include: an electrical connection having one or more wires, a portable disk, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.

The computer readable storage medium may include a propagated data signal with readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A readable storage medium may also be any readable medium that is not a readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a readable storage medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.

Program code for carrying out operations for aspects of the present invention may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, C + + or the like and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computing device, partly on the user's device, as a stand-alone software package, partly on the user's computing device and partly on a remote computing device, or entirely on the remote computing device or server. In the case of a remote computing device, the remote computing device may be connected to the user computing device through any kind of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or may be connected to an external computing device (e.g., through the internet using an internet service provider).

In an exemplary embodiment of the present disclosure, there is also provided an electronic device, which may include a processor, and a memory for storing executable instructions of the processor. Wherein the processor is configured to perform the steps of the game character identification information generation method in any one of the above embodiments via execution of the executable instructions.

As will be appreciated by one skilled in the art, aspects of the present invention may be embodied as a system, method or program product. Thus, various aspects of the invention may be embodied in the form of: an entirely hardware embodiment, an entirely software embodiment (including firmware, microcode, etc.) or an embodiment combining hardware and software aspects that may all generally be referred to herein as a "circuit," module "or" system.

An electronic device 600 according to this embodiment of the invention is described below with reference to fig. 8. The electronic device 600 shown in fig. 8 is only an example, and should not bring any limitation to the functions and the scope of use of the embodiments of the present invention.

As shown in fig. 8, the electronic device 600 is embodied in the form of a general purpose computing device. The components of the electronic device 600 may include, but are not limited to: at least one processing unit 610, at least one storage unit 620, a bus 630 that connects the various system components (including the storage unit 620 and the processing unit 610), a display unit 640, and the like.

Wherein the storage unit stores program code executable by the processing unit 610 to cause the processing unit 610 to perform steps according to various exemplary embodiments of the present invention described in the above-mentioned game character identification information generation method section of this specification. For example, the processing unit 610 may perform the steps as shown in fig. 1.

The storage unit 620 may include readable media in the form of volatile memory units, such as a random access memory unit (RAM)6201 and/or a cache memory unit 6202, and may further include a read-only memory unit (ROM) 6203.

The memory unit 620 may also include a program/utility 6204 having a set (at least one) of program modules 6205, such program modules 6205 including, but not limited to: an operating system, one or more application programs, other program modules, and program data, each of which, or some combination thereof, may comprise an implementation of a network environment.

Bus 630 may be one or more of several types of bus structures, including a memory unit bus or memory unit controller, a peripheral bus, an accelerated graphics port, a processing unit, or a local bus using any of a variety of bus architectures.

The electronic device 600 may also communicate with one or more external devices 700 (e.g., keyboard, pointing device, bluetooth device, etc.), with one or more devices that enable a user to interact with the electronic device 600, and/or with any devices (e.g., router, modem, etc.) that enable the electronic device 600 to communicate with one or more other computing devices. Such communication may occur via an input/output (I/O) interface 650. Also, the electronic device 600 may communicate with one or more networks (e.g., a Local Area Network (LAN), a Wide Area Network (WAN), and/or a public network such as the Internet) via the network adapter 660. The network adapter 660 may communicate with other modules of the electronic device 600 via the bus 630. It should be appreciated that although not shown in the figures, other hardware and/or software modules may be used in conjunction with the electronic device 600, including but not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, and data backup storage systems, among others.

Through the above description of the embodiments, those skilled in the art will readily understand that the exemplary embodiments described herein may be implemented by software, or by software in combination with necessary hardware. Therefore, the technical solution according to the embodiments of the present disclosure may be embodied in the form of a software product, which may be stored in a non-volatile storage medium (which may be a CD-ROM, a usb disk, a removable hard disk, etc.) or on a network, and includes several instructions to enable a computing device (which may be a personal computer, a server, or a network device, etc.) to execute the above game character identification information generation method according to the embodiments of the present disclosure.

Other embodiments of the disclosure will be apparent to those skilled in the art from consideration of the specification and practice of the disclosure disclosed herein. This application is intended to cover any variations, uses, or adaptations of the disclosure following, in general, the principles of the disclosure and including such departures from the present disclosure as come within known or customary practice within the art to which the disclosure pertains. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the disclosure being indicated by the following claims.

Claims

1. A method for generating game character identification information is applied to a game server, and is characterized in that the method comprises the following steps:

2. The method for generating game character identification information according to claim 1, wherein the preset algorithm includes an RSA algorithm; the calculating the second numerical value corresponding to the game role according to a preset algorithm to obtain the unique identification information corresponding to the game role comprises:

3. The method for generating game character identification information according to claim 1, wherein the performing a preset calculation on a preset first numerical value in response to the creation request to obtain a second numerical value includes:

4. A game character identification information generation method according to any one of claims 1 to 3, wherein the unique identification information is a scrambled digital ID.

5. The method for generating game character identification information according to any one of claims 1 to 3, wherein the first numerical value is set in a memory of the game server.

6. The method for generating game character identification information according to any one of claims 1 to 3, further comprising:

7. The method for generating game character identification information according to claim 6, further comprising:

8. A game character identification information generating apparatus, comprising:

9. A computer-readable storage medium on which a computer program is stored, the program, when executed by a processor, implementing the steps of the game character identification information generation method according to any one of claims 1 to 7.

10. An electronic device, comprising:

a processor; and

a memory for storing executable instructions of the processor;

wherein the processor is configured to perform the steps of the game character identification information generation method of any one of claims 1 to 7 via execution of the executable instructions.