CN113824807B - Invitation code generation method, device, electronic device and storage medium - Google Patents
Invitation code generation method, device, electronic device and storage medium Download PDFInfo
- Publication number
- CN113824807B CN113824807B CN202110255960.2A CN202110255960A CN113824807B CN 113824807 B CN113824807 B CN 113824807B CN 202110255960 A CN202110255960 A CN 202110255960A CN 113824807 B CN113824807 B CN 113824807B
- Authority
- CN
- China
- Prior art keywords
- invitation code
- length
- array
- invitation
- generated
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L61/00—Network arrangements, protocols or services for addressing or naming
- H04L61/30—Managing network names, e.g. use of aliases or nicknames
- H04L61/3015—Name registration, generation or assignment
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/903—Querying
- G06F16/90335—Query processing
- G06F16/90344—Query processing by using string matching techniques
Landscapes
- Engineering & Computer Science (AREA)
- Databases & Information Systems (AREA)
- Theoretical Computer Science (AREA)
- Computational Linguistics (AREA)
- Data Mining & Analysis (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
本发明提供了一种邀请码生成方法、装置、电子设备及存储介质，该方法包括：接收用户的邀请码生成请求；根据所述邀请码生成请求携带的待生成邀请码长度生成一邀请码数组；根据所述邀请码生成请求携带的全局唯一标识、以及待生成邀请码长度对应的基础数据信息，对邀请码数组进行基于用于邀请码的字符序列长度的缩倍赋值、按位扩散、和按位混淆，以使邀请码数组中的元素取值落入取值区间[0，L1‑1]，其中，待生成邀请码长度对应的基础数据信息和所述用于邀请码的字符序列是预先配置的，L1是所述用于邀请码的字符序列的长度；提取所述用于邀请码的字符序列中对应于邀请码数组的每一元素取值的字符，将提取的字符构成的字符串确定为用户的邀请码。
The present invention provides an invitation code generation method, device, electronic device and storage medium. The method comprises: receiving an invitation code generation request from a user; generating an invitation code array according to the length of the invitation code to be generated carried by the invitation code generation request; performing multiple assignment, bitwise diffusion and bitwise confusion on the invitation code array based on the length of the character sequence used for the invitation code according to the global unique identifier carried by the invitation code generation request and the basic data information corresponding to the length of the invitation code to be generated, so that the element values in the invitation code array fall into the value interval [0, L1-1 ], wherein the basic data information corresponding to the length of the invitation code to be generated and the character sequence used for the invitation code are pre-configured, and L1 is the length of the character sequence used for the invitation code; extracting characters corresponding to the values of each element of the invitation code array in the character sequence used for the invitation code, and determining the character string composed of the extracted characters as the invitation code of the user.
Description
Technical Field
The present invention relates to the field of information processing technologies, and in particular, to an invitation code generating method, an invitation code generating device, an electronic device, and a storage medium.
Background
There are several schemes for generating an invitation code that is not repeatable and cannot be guessed:
1. After each generation of the invitation code, determining whether the invitation code is repeated or not by checking the database, and if the invitation code is repeated, regenerating the invitation code. This approach is extremely inefficient.
2. The main key of the database is used as a unique key to carry out scrambling or inserting operation, if the main key is 8000001, N-bit (set according to the requirement) random numbers or letters are generated after the main key is taken out and inserted into the main key value to form a string such as 8000E0V0S1D, thereby ensuring that the invitation code is not repeated. The method needs to pre-generate a large number of main keys at one time, increases complexity, and has the problem of insufficient number of main keys after explosive growth of users.
3. An algorithm is utilized to ensure the uniqueness of the invitation code. For example, the invitation code is generated by using a UUID algorithm, a SHA algorithm, an RC4 algorithm, etc., however, the length of the invitation code generated by using the UUID and SHA algorithm is too long to be practical, while the invitation code generated by using the RC4 algorithm has symbols which do not belong to letters and numbers, is not suitable for being used as the invitation code of the user, and has the problem of too long length, which is not practical.
Disclosure of Invention
In view of the foregoing, an object of the present invention is to provide a method, apparatus, electronic device, and storage medium for generating an invitation code, which can improve the efficiency of generating the invitation code, reduce the complexity, and control the length of the generated invitation code.
In order to achieve the above purpose, the present invention provides the following technical solutions:
An invitation code generation method, comprising:
Receiving an invitation code generation request of a user;
generating an invitation code array according to the length of the invitation code to be generated carried by the invitation code generation request;
Performing scaled assignment, bit diffusion and bit confusion on an invitation code array based on the character sequence length of the invitation code according to the global unique identifier id carried by the invitation code generation request and the basic data information corresponding to the length of the invitation code to be generated, so that the element values in the invitation code array fall into a value interval [0, L 1 -1], wherein the basic data information corresponding to the length of the invitation code to be generated and the character sequence of the invitation code are preconfigured, and L 1 is the length of the character sequence of the invitation code;
And extracting the character of each element value corresponding to the invitation code array in the character sequence for the invitation code, and determining the character string formed by the extracted characters as the invitation code of the user.
An invitation code generating apparatus comprising:
A receiving unit, configured to receive an invitation code generation request of a user;
The generating unit is used for generating an invitation code array according to the length of the invitation code to be generated carried by the invitation code generating request;
The processing unit is configured to perform scaled assignment, bit diffusion, and bit confusion on the invitation code array based on the length of the character sequence for the invitation code according to the global unique identifier id carried by the invitation code generation request and the basic data information corresponding to the length of the invitation code to be generated, so that the element values in the invitation code array fall into a value interval [0, L 1 -1], where the basic data information corresponding to the length of the invitation code to be generated and the character sequence for the invitation code are preconfigured, and L 1 is the length of the character sequence for the invitation code;
And the extraction unit is used for extracting the character of each element value corresponding to the invitation code array in the character sequence for the invitation code, and determining the character string formed by the extracted characters as the invitation code of the user.
An electronic device includes a processor and a memory;
the memory stores one or more computer programs executable by the processor, and the processor implements the steps in the invitation code generation method when executing the one or more computer programs.
A non-transitory computer readable storage medium storing instructions that, when executed by a processor, cause the processor to implement steps in an invitation code generation method as described above.
According to the technical scheme, after receiving an invitation code generation request of a user, generating an invitation code array according to the length of the invitation code to be generated carried by the invitation code generation request, and carrying out operations of shrinking and assigning, bit diffusing and bit confusion on the invitation code array based on the length of a character sequence for the invitation code which is pre-configured according to the global unique identification id carried by the invitation code generation request and basic data information which is pre-configured for the length of the invitation code to be generated, so that characters for the invitation code which are pre-configured are uniformly distributed, and further, the invitation code obtained by extracting the characters which are corresponding to the value of each element of the invitation code array in the character sequence for the invitation code is not repeated. It can be seen that the invention does not need to query the database and pre-generate the database primary key, and also supports the invitation code generation mechanism with specified length, thus being capable of improving the generation efficiency of the invitation code, reducing the complexity of the generation of the invitation code and controlling the length of the generated invitation code under the condition of ensuring that the invitation code is not repeated.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings that are needed in the description of the embodiments will be briefly described below, it being obvious that the drawings in the following description are only some embodiments of the present application, and that other drawings may be obtained according to these drawings without inventive effort to a person skilled in the art.
FIG. 1 is a flow chart of an invitation code generating method according to an embodiment of the present invention;
FIG. 2 is a flow chart of a method for generating a second invitation code according to an embodiment of the present invention;
FIG. 3 is a flow chart of a method for generating a three-invitation code in accordance with an embodiment of the invention;
FIG. 4 is a flow chart of a method for generating a fourth invitation code in accordance with an embodiment of the invention;
FIG. 5 is a schematic diagram of an invitation code generating device according to an embodiment of the present invention;
fig. 6 is a schematic structural diagram of an electronic device according to an embodiment of the present invention.
Detailed Description
The following description of the embodiments of the present application will be made clearly and completely with reference to the accompanying drawings, in which it is apparent that the embodiments described are only some embodiments of the present application, but not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the application without making any inventive effort, are intended to be within the scope of the application.
Referring to fig. 1, fig. 1 is a flowchart of an invitation code generating method according to an embodiment of the present invention, as shown in fig. 1, the method mainly includes the following steps:
step 101, receiving an invitation code generation request of a user;
step 102, generating an invitation code array according to the length of the invitation code to be generated carried by the invitation code generation request;
Step 103, performing scaled assignment, bit diffusion and bit confusion on the invitation code array based on the character sequence length for the invitation code according to the global unique identifier id carried by the invitation code generation request and the basic data information corresponding to the length of the invitation code to be generated, so that the element values in the invitation code array fall into a value interval [0, L 1 -1], wherein the basic data information corresponding to the length of the invitation code to be generated and the character sequence for the invitation code are both preconfigured, and L 1 is the length of the character sequence for the invitation code;
and 104, extracting the character of each element value corresponding to the invitation code array in the character sequence for the invitation code, and determining the character string formed by the extracted characters as the invitation code of the user.
As can be seen from the method shown in fig. 1, in this embodiment, in the process of generating the invitation code, according to the global unique identifier id carried by the invitation code generation request and the basic data information corresponding to the length of the invitation code to be generated, the operation of performing the operations of performing the scaled assignment, the bitwise diffusion and the bitwise confusion on the invitation code array based on the length of the character sequence of the preconfigured invitation code is performed, so that the characters of the preconfigured invitation code are uniformly distributed, and further, the invitation code obtained by extracting the characters corresponding to the value of each element of the invitation code array in the character sequence of the invitation code is not repeated. The invention does not need to query the database and pre-generate the main key of the database, and also supports the invitation code generation mechanism with specified length, thereby improving the generation efficiency of the invitation code, reducing the complexity of the generation of the invitation code and controlling the length of the generated invitation code under the condition of ensuring that the invitation code is not repeated.
Referring to fig. 2, fig. 2 is a flowchart of a second invitation code generating method according to an embodiment of the present invention, and as shown in fig. 2, the method mainly includes the following steps:
step 201, receiving an invitation code generation request of a user;
In this embodiment, the invitation code generation request carries information such as a length of an invitation code to be generated, a global unique identifier (id), and the like.
Step 202, generating an invitation code array according to the length of the invitation code to be generated carried by the invitation code generation request;
in this embodiment, the length of the invitation code array is the same as the length of the invitation code to be generated.
In the embodiment, corresponding basic data information is configured in advance for the length of the to-be-generated invitation code, and specifically comprises first basic data which is mutually equal to the length of a character sequence for the invitation code, second basic data which is mutually equal to the length of the to-be-generated invitation code and random data, wherein the character sequence for the invitation code is preconfigured.
Step 2031, calculating a product of an id carried by the invitation code generation request and first basic data corresponding to the length of the invitation code to be generated, and adding the product and random data corresponding to the length of the invitation code to be generated to obtain an initial value;
step 2032, performing scaled assignment and bitwise diffusion on the invitation code array based on the character sequence length for the invitation code according to the initial value and the assignment sequence corresponding to the length of the invitation code to be generated;
In this embodiment, a corresponding assignment sequence is configured in advance for the length of the invitation code to be generated.
In this embodiment, the assignment of the number of the invitation codes based on the length of the character sequence for the invitation codes is performed according to the assignment sequence corresponding to the length of the invitation codes to be generated, so that the element values in the number of the invitation codes fall into the value interval [0, l 1 -1], and the initial values are obtained by multiplying the id by the first basic data of the character sequence length for the invitation codes and then adding the multiplied values to the random data, so that the characters for the invitation codes can be uniformly distributed in the number of the invitation codes when the assignment of the number of the invitation codes based on the length of the character sequence for the invitation codes is performed and the diffusion of the number of the invitation codes by bits is performed.
Step 2033, performing bit confusion on the invitation code array by using the second basic data corresponding to the length of the invitation code to be generated.
In this embodiment, the elements in the invitation code array may be scrambled by bit confusion on the invitation code array, so as to further increase the difficulty of decoding the invitation code.
The above steps 2031 to 2033 are specific refinements of step 103 shown in fig. 1.
And 204, extracting the character of each element value corresponding to the invitation code array in the character sequence for the invitation code, and determining the character string formed by the extracted characters as the invitation code of the user.
According to the method shown in fig. 2, in this embodiment, when generating the invitation code, the number array of the invitation code is subjected to scaled assignment and bit-wise diffusion according to the global unique identifier id carried by the invitation code generation request, and the first basic data and the random data corresponding to the length of the invitation code to be generated, so that the characters of the pre-configured invitation code are uniformly distributed, and then the number array of the invitation code is subjected to bit-wise confusion by using the second basic data corresponding to the length of the invitation code to be generated, so as to increase the decoding difficulty of the invitation code obtained by subsequent extraction. The invention does not need to query the database and pre-generate the main key of the database, and also supports the invitation code generation mechanism with specified length, thereby improving the generation efficiency of the invitation code, reducing the complexity of the generation of the invitation code and controlling the length of the generated invitation code under the condition of ensuring that the invitation code is not repeated.
Referring to fig. 3, fig. 3 is a flowchart of a method for generating a three-invitation code according to an embodiment of the present invention, as shown in fig. 3, the method mainly includes the following steps:
step 301, receiving an invitation code generation request of a user;
step 302, generating an invitation code array according to the length of the invitation code to be generated carried by the invitation code generation request;
In this embodiment, the invitation code generation request carries information such as a length of an invitation code to be generated, a global unique identifier (id), and the like.
In the embodiment, corresponding basic data information is configured in advance for the length of the to-be-generated invitation code, and specifically comprises first basic data which is mutually equal to the length of a character sequence for the invitation code, second basic data which is mutually equal to the length of the to-be-generated invitation code and random data, wherein the character sequence for the invitation code is preconfigured. In addition, a corresponding assignment sequence is configured for the length of the invitation code to be generated in advance.
In this embodiment, the length of the random data corresponding to the length of the invitation code to be generated may be kept consistent with the length of the invitation code to be generated, so that the numerical range of the modulo calculation result may be larger in the subsequent diffusing process of the elements in the invitation code array.
Step 3031, calculating the product of the id carried by the invitation code generation request and the first basic data corresponding to the length of the invitation code to be generated, and adding the product and the random data corresponding to the length of the invitation code to be generated to obtain an initial value;
Step 3032a, performing scaled assignment on the first L 2 -1 elements of the invitation code array based on the character sequence length for the invitation code according to the initial value and the assignment sequence corresponding to the length of the invitation code to be generated (the length of the invitation code to be generated is recorded as L 2);
in this embodiment, the assignment sequence corresponding to the length of the invitation code to be generated may be the sequence of the sequence numbers of the first L 2 -1 sets of the invitation code sets. Here, the length of the invitation code to be generated is L 2, the length of the invitation code array is L 2, the first L 2 -1 elements of the invitation code array are subjected to scaled assignment, the last element of the invitation code array is used as an interference item, and other methods are adopted for assignment.
In this embodiment, performing, according to the initial value, a scaled assignment based on the length of the character sequence for the invitation code on the first L 2 -1 elements of the invitation code array according to an assignment sequence corresponding to the length of the invitation code to be generated, specifically includes:
s11, setting an element corresponding to the 1 st array serial number in the sequencing order in the invitation code array as the initial value;
And S12, setting an element corresponding to the i-th array serial number in the ordering sequence in the invitation code array as a quotient of an element value corresponding to the i-1-th array serial number in the ordering sequence in the invitation code array and the character sequence length L 1 for the invitation code, wherein i=2.
Assuming that the length of the to-be-generated invitation code is 5, the length of the invitation code Array is also 5, and the specific process of performing the scaled assignment on the first 4 elements of the invitation code Array according to the scaled assignment method given in the steps S11-S12 includes the steps of assigning the initial value to Array [0], assigning the quotient of Array [0] and L 1 to Array [1], assigning the quotient of Array [1] and L 1 to Array [2], and assigning the quotient of Array [2] and L 1 to Array [3].
Step 3032b, using the initial value and the character sequence length for the invitation code, performing bit-wise diffusion on the first L 2 -1 elements of the invitation code array based on the character sequence length for the invitation code;
In this embodiment, after performing assignment on the first L 2 -1 elements of the invite code array in step 3032a, bit-wise diffusion based on the character sequence length for the invite code is further performed on these elements in step 3032 b.
In this embodiment, using the initial value and the character sequence length for the invitation code, performing bit-wise diffusion on the first L 2 -1 elements of the invitation code array based on the character sequence length for the invitation code, including:
For each element in the first L 2 -1 elements of the invitation code array, calculating the product of the array serial number corresponding to the element and the initial value, calculating the addition result of the element value and the product, determining the modulo calculation result of the addition result on the character sequence length for the invitation code, and updating the element value to be the modulo calculation result.
Here, by performing the above-described diffusion operation on the first L 2 -1 elements of the invitation code array, the values of the first L 2 -1 elements of the invitation code array can all fall into the interval [0, L 1 -1].
Step 3032c, determining an interference value according to the first L 2 -1 elements in the invitation code array, calculating the product of the interference value and the first basic data corresponding to the length of the invitation code to be generated, determining the modulo calculation result of the product on the length of the character sequence for the invitation code, and setting the element value with the array sequence number of L 2 -1 in the invitation code array as the modulo calculation result.
In this embodiment, determining an interference value according to the first L 2 -1 elements in the invitation code array specifically includes:
And calculating the addition result of the element values from the L 2 -1-m element to the L 2 -1 element in the invitation code array, and determining the addition result as the interference value, wherein m is a preset integer value and is positioned in the interval [2, L 2 -1 ]. Here, L 2 is an integer greater than 2.
It can be seen that, in this embodiment, the last element (i.e. the L 2 th element) of the invitation code array does not refer to the operation of performing the scaled assignment on the previous L 2 -1 elements, but determines an interference value according to the previous L 2 -1 elements, calculates the product of the interference value and the first basic data corresponding to the length of the invitation code to be generated, and assigns the result of modulo calculation of the product on the length of the character sequence for the invitation code to the element, so as to further increase the decoding difficulty of the finally generated invitation code.
The above steps 3032a through 3032c are specific refinements of step 2032 shown in fig. 2.
Step 3033, using the second basic data corresponding to the length of the invitation code to be generated to mix the invitation code array according to the bits.
In this embodiment, the elements in the invitation code array may be scrambled by bit confusion on the invitation code array, so as to further increase the difficulty of decoding the invitation code.
The above steps 3031 to 3033 are specific refinements of step 103 shown in fig. 1.
And 304, extracting the character of each element value corresponding to the invitation code array in the character sequence for the invitation code, and determining the character string formed by the extracted characters as the invitation code of the user.
According to the method shown in fig. 3, in this embodiment, when generating the invitation code, the first L 2 -1 elements of the invitation code array are assigned by a reduced multiple and spread by bits according to the global unique id carried by the invitation code generation request, and the first basic data and the random data corresponding to the length of the invitation code to be generated, and the last element of the invitation code array is assigned by other methods, so that, on one hand, the characters of the preconfigured invitation code are uniformly distributed, and on the other hand, the decoding difficulty of the subsequently extracted invitation code is increased, and then, the second basic data corresponding to the length of the invitation code to be generated is utilized to carry out bit confusion on the invitation code array, thereby further increasing the decoding difficulty of the subsequently extracted invitation code. The invention does not need to query the database and pre-generate the main key of the database, and also supports the invitation code generation mechanism with specified length, thereby improving the generation efficiency of the invitation code, reducing the complexity of the generation of the invitation code and controlling the length of the generated invitation code under the condition of ensuring that the invitation code is not repeated.
Referring to fig. 4, fig. 4 is a flowchart of a method for generating a fourth invitation code according to an embodiment of the present invention, as shown in fig. 4, the method mainly includes the following steps:
Step 401, receiving an invitation code generation request of a user;
step 402, generating an invitation code array according to the length of the invitation code to be generated carried by the invitation code generation request;
In this embodiment, the invitation code generation request carries information such as a length of an invitation code to be generated, a global unique identifier (id), and the like.
In the embodiment, corresponding basic data information is configured in advance for the length of the to-be-generated invitation code, and specifically comprises first basic data which is mutually equal to the length of a character sequence for the invitation code, second basic data which is mutually equal to the length of the to-be-generated invitation code and random data, wherein the character sequence for the invitation code is preconfigured. In addition, a corresponding assignment sequence is configured for the length of the invitation code to be generated in advance.
In this embodiment, the character sequence for the invitation code may be any set of characters input by the user through the electronic device, specifically set by the user, for example, a plurality of characters may be selected from 10 number characters, 0-9, and 26 english alphabets, a-Z, as the characters for the invitation code, and arranged in any order into one character sequence, and the specific arrangement order may be set by the user, which is not limited by the present invention.
Step 4031, calculating the product of the id carried by the invitation code generation request and the first basic data corresponding to the length of the invitation code to be generated, and adding the product and the random data corresponding to the length of the invitation code to be generated to obtain an initial value;
step 4032, performing scaled assignment and bitwise diffusion on the invitation code array based on the character sequence length for the invitation code according to the initial value and the assignment sequence corresponding to the length of the invitation code to be generated;
In this embodiment, the assignment of the number of the invitation codes based on the length of the character sequence for the invitation codes is performed according to the assignment sequence corresponding to the length of the invitation codes to be generated, so that the element values in the number of the invitation codes fall into the value interval [0, l 1 -1], and the initial values are obtained by multiplying the id by the first basic data of the character sequence length for the invitation codes and then adding the multiplied values to the random data, so that the characters for the invitation codes can be uniformly distributed in the number of the invitation codes when the assignment of the number of the invitation codes based on the length of the character sequence for the invitation codes is performed and the diffusion of the number of the invitation codes by bits is performed.
Step 4033a, for each element in the invitation code array, determining a new array sequence number corresponding to the element according to the array sequence number corresponding to the element and the second basic data corresponding to the length of the invitation code to be generated;
In this embodiment, determining the new array sequence number corresponding to the element according to the array sequence number corresponding to the element and the second basic data corresponding to the length of the invitation code to be generated specifically includes:
And calculating the product of the array serial number corresponding to the element and the second basic data corresponding to the length of the invitation code to be generated, determining the modulo calculation result of the product to the length of the invitation code to be generated, and determining the modulo calculation result as the new array serial number corresponding to the element.
Step 4033b, performing position adjustment on the elements in the invitation code array according to the new array serial numbers corresponding to each element in the invitation code array.
In this embodiment, let the character sequence for the invitation code be ：'H','V','E','8','S','2','D','Z','X','9','C','7','P','1','5','I','K','3','M','J','U','F','R','4','W','Y','L','T','N','6','B','G','Q', as follows, L 1 =35.
Assuming that the length of the invitation code to be generated is 5, and that the values of the 1 st to 5 th elements of the invitation code Array are sequentially determined in step 4043a to be Array [0] =1, array [1] =5, array [2] =7, array [3] =4, and Array [4]8 ], and that the new sequence of the 1 st to 5 th elements is sequentially determined in step 4043b to be 0,1, 3, 2, and 4, the position-adjusted invitation code Array may be determined in which Array [0] =1, array [1] =5, array [2] =4, array [3] =7, and Array [4] =8.
The above steps 4033a to 4033b are specific refinements of step 2033 shown in fig. 2.
The above steps 4031 to 4033b are specific refinements of step 103 shown in fig. 1.
And step 404, extracting the character of each element value corresponding to the invitation code array in the character sequence for the invitation code, and determining the character string formed by the extracted characters as the user's invitation code.
In this embodiment, the character corresponding to the value of each element of the invitation code array in the character sequence for the invitation code may be extracted, for example, in the invitation code array obtained after the step 4043b is executed, the extracted characters are sequentially as follows:
Array [0] =1, corresponding to 'V' in the character sequence for the invitation code;
array [1] =5, corresponding to '2' in the character sequence for the invitation code;
array [2] =4, corresponding to 'S' in the character sequence for the invitation code;
Array [3] =7, corresponding to 'Z' in the character sequence for the invitation code;
Array [4] =8, corresponding to 'X' in the character sequence for the invitation code.
The invitation code of the user is thus available as V2SZX.
According to the method shown in fig. 4, in this embodiment, when generating the invitation code, the number sets of the invitation code are subjected to scaled assignment and bit-wise diffusion according to the global unique identifier id carried by the invitation code generation request, and the first basic data and the random data corresponding to the length of the invitation code to be generated, so that the characters of the pre-configured invitation code are uniformly distributed, and then the number sets of the invitation code are subjected to bit-wise confusion by using the second basic data corresponding to the length of the invitation code to be generated, so that the element positions in the number sets of the invitation code are disturbed, and the decoding difficulty of the invitation code obtained by subsequent extraction can be increased. The invention does not need to query the database and pre-generate the main key of the database, and also supports the invitation code generation mechanism with specified length, thereby improving the generation efficiency of the invitation code, reducing the complexity of the generation of the invitation code and controlling the length of the generated invitation code under the condition of ensuring that the invitation code is not repeated.
The embodiment of the invention also provides an invitation code generating device, as shown in fig. 5, which comprises:
A receiving unit 501, configured to receive an invitation code generation request of a user;
A generating unit 502, configured to generate an invitation code array according to the length of the to-be-generated invitation code carried by the invitation code generating request;
A processing unit 503, configured to perform, on the invitation code array, assignment by multiplication, diffusion by bit, and confusion by bit based on the length of the character sequence for the invitation code according to the global unique identifier id carried by the invitation code generation request and the basic data information corresponding to the length of the invitation code to be generated, so that the element values in the invitation code array fall into a value interval [0, L 1 -1], where the basic data information corresponding to the length of the invitation code to be generated and the character sequence for the invitation code are preconfigured, and L 1 is the length of the character sequence for the invitation code;
And an extracting unit 504, configured to extract a character corresponding to each element value of the invitation code array in the character sequence for the invitation code, and determine a character string formed by the extracted characters as the user's invitation code.
In the apparatus shown in figure 5 of the drawings,
The basic data information corresponding to the length of the invitation code to be generated comprises first basic data which are mutually equal to the length of the character sequence used for the invitation code, second basic data which are mutually equal to the length of the invitation code to be generated and random data;
The processing unit 503 performs, according to the id carried by the invitation code generation request and the basic data information corresponding to the length of the invitation code to be generated, assignment of a scaled number, diffusion by bit, and confusion by bit on the invitation code array based on the length of the character sequence for the invitation code, where the assignment includes:
calculating the product of the id and the first basic data corresponding to the length of the invitation code to be generated, and adding the product and the random data corresponding to the length of the invitation code to be generated to obtain an initial value;
Performing scaled assignment and bit-wise diffusion on the invitation code array based on the character sequence length for the invitation code according to the initial value and the assignment sequence corresponding to the length of the invitation code to be generated, wherein the assignment sequence corresponding to the length of the invitation code to be generated is preconfigured;
And carrying out bit confusion on the invitation code array by utilizing second basic data corresponding to the length of the invitation code to be generated.
In the apparatus shown in figure 5 of the drawings,
The assignment sequence corresponding to the length of the invitation code to be generated is the sequence of the sequence numbers of the first L 2 -1 arrays of the invitation code arrays, wherein L 2 is the length of the invitation code to be generated;
the processing unit 503 performs, according to the initial value, assignment of the number group of the invitation codes based on the multiple of the character sequence length for the invitation codes and bit-wise diffusion according to an assignment sequence corresponding to the length of the invitation codes to be generated, including:
performing scaled assignment on the first L 2 -1 elements of the invitation code array based on the character sequence length for the invitation code according to the initial value and an assignment sequence corresponding to the length of the invitation code to be generated;
performing bit-wise diffusion on the first L 2 -1 elements of the invitation code array based on the character sequence length for the invitation code by using the initial value and the character sequence length for the invitation code;
And determining an interference value according to the first L 2 -1 elements in the invitation code array, calculating the product of the interference value and first basic data corresponding to the length of the invitation code to be generated, determining the modulo calculation result of the product on the character sequence length for the invitation code, and setting the element value with the array serial number L 2 -1 in the invitation code array as the modulo calculation result.
In the apparatus shown in figure 5 of the drawings,
The processing unit 503 performs, according to the initial value, assignment of the first L 2 -1 elements of the invite code array according to an assignment sequence corresponding to a length of the invite code to be generated, where the assignment is based on a reduction of the length of the character sequence used for the invite code, where the assignment includes:
Setting an element corresponding to the 1 st digit group serial number in the ordering order in the invitation code digit group as the initial value;
Setting an element corresponding to the i-th array serial number in the ordering order in the invitation code array as a quotient of an element value corresponding to the i-1-th array serial number in the ordering order in the invitation code array and the character sequence length L 1 for the invitation code, wherein i=2.
In the apparatus shown in figure 5 of the drawings,
The processing unit 503 performs bit-wise diffusion on the first L 2 -1 elements of the invite code array based on the character sequence length for the invite code by using the initial value and the character sequence length for the invite code, including:
For each element in the first L 2 -1 elements of the invitation code array, calculating the product of the array serial number corresponding to the element and the initial value, calculating the addition result of the element value and the product, determining the modulo calculation result of the addition result on the character sequence length for the invitation code, and updating the element value to be the modulo calculation result.
In the apparatus shown in figure 5 of the drawings,
The processing unit 503 determines an interference value according to the first L 2 -1 elements in the invitation code array, including:
And calculating the addition result of the element values from the L 2 -1-m element to the L 2 -1 element in the invitation code array, and determining the addition result as the interference value, wherein m is a preset integer value and is positioned in the interval [2, L 2 -1 ].
In the apparatus shown in figure 5 of the drawings,
The processing unit 503 performs bit confusion on the invitation code array by using second basic data corresponding to the length of the invitation code to be generated, including:
for each element in the invitation code array, determining a new array sequence number corresponding to the element according to the array sequence number corresponding to the element and second basic data corresponding to the length of the invitation code to be generated;
And carrying out position adjustment on the elements in the invitation code array according to the new array serial numbers corresponding to each element in the invitation code array.
In the apparatus shown in figure 5 of the drawings,
The processing unit 503 determines a new array sequence number corresponding to the element according to the array sequence number corresponding to the element and the second basic data corresponding to the length of the invitation code to be generated, including:
And calculating the product of the array serial number corresponding to the element and the second basic data corresponding to the length of the invitation code to be generated, determining the modulo calculation result of the product to the length of the invitation code to be generated, and determining the modulo calculation result as the new array serial number corresponding to the element.
The embodiment of the invention also provides an electronic device, as shown in fig. 6, which comprises a processor 601 and a memory 602;
The memory 602 stores one or more computer programs executable by the processor 601, which when executed implement the steps in the invitation code generation method as shown in any of the flowcharts of figures 1-4.
Embodiments of the present invention also provide a non-transitory computer readable storage medium storing instructions, which when executed by a processor cause the processor to implement steps in an invitation code generation method as shown in any of the flowcharts of fig. 1-4.
The foregoing description of the preferred embodiments of the invention is not intended to be limiting, but rather to enable any modification, equivalent replacement, improvement or the like to be made within the spirit and principles of the invention.
Claims (9)
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110255960.2A CN113824807B (en) | 2021-03-09 | 2021-03-09 | Invitation code generation method, device, electronic device and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110255960.2A CN113824807B (en) | 2021-03-09 | 2021-03-09 | Invitation code generation method, device, electronic device and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113824807A CN113824807A (en) | 2021-12-21 |
| CN113824807B true CN113824807B (en) | 2025-01-03 |
Family
ID=78912403
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110255960.2A Active CN113824807B (en) | 2021-03-09 | 2021-03-09 | Invitation code generation method, device, electronic device and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113824807B (en) |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109977371A (en) * | 2019-03-21 | 2019-07-05 | 江苏工程职业技术学院 | A kind of generation method of character type garbage classification code |
| CN110619204A (en) * | 2019-08-28 | 2019-12-27 | 深圳市融壹买信息科技有限公司 | Invitation code generation method and device, terminal equipment and storage medium |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7995749B2 (en) * | 2007-10-30 | 2011-08-09 | Harris Corporation | Cryptographic system configured for extending a repetition period of a random sequence |
| ES2409458B1 (en) * | 2011-04-12 | 2014-06-24 | Telef�Nica, S.A. | METHOD AND SYSTEM TO IMPROVE THE SYNCHRONIZATION OF FLOW ENCRYPTIONS |
-
2021
- 2021-03-09 CN CN202110255960.2A patent/CN113824807B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109977371A (en) * | 2019-03-21 | 2019-07-05 | 江苏工程职业技术学院 | A kind of generation method of character type garbage classification code |
| CN110619204A (en) * | 2019-08-28 | 2019-12-27 | 深圳市融壹买信息科技有限公司 | Invitation code generation method and device, terminal equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113824807A (en) | 2021-12-21 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US7921145B2 (en) | Extending a repetition period of a random sequence | |
| US20080177812A1 (en) | Hash algorithm using randomization function | |
| US8345876B1 (en) | Encryption/decryption system and method | |
| US20040044896A1 (en) | Universal password generation method | |
| CN109325367B (en) | Information hiding method, device, equipment and computer readable storage medium | |
| CN108199828B (en) | A color image encryption method and device | |
| US20060193471A1 (en) | Encryption method and system | |
| WO2021138719A1 (en) | Systems and computer-implemented methods for generating pseudo random numbers | |
| CN111241568B (en) | Encryption method, decryption method, apparatus, computer equipment and storage medium | |
| Manankova et al. | Cryptanalysis the SHA-256 hash function using rainbow tables | |
| CN113824807B (en) | Invitation code generation method, device, electronic device and storage medium | |
| CN105991289B (en) | The side channel energy analysis method and device of SM3 cryptographic algorithm | |
| US10572654B2 (en) | Method for a repeatable creation of a random file | |
| KR101837589B1 (en) | Computer-executable random-number generation method and random-number generation apparatus performing the same | |
| CN110245501B (en) | Image encryption method based on infinite dimension hyperchaos | |
| CN104112096B (en) | Multi-point touch method and device | |
| US20250103638A1 (en) | Generalizing data records | |
| CN112272082B (en) | Image encryption/decryption method and device, electronic equipment and storage medium | |
| CN116301721B (en) | Random number generation method and device, electronic equipment and medium | |
| Sivakumar et al. | Generation of random key stream using word grid puzzle for the applications of cryptography | |
| CN113901437B (en) | Password generation method, device, computer equipment and storage medium | |
| CN115242450A (en) | Password data input method, device and storage medium | |
| CN112148584B (en) | Account information processing method and device, electronic equipment and storage medium | |
| CN114928437A (en) | Encryption method, device, equipment and storage medium | |
| Wang et al. | E-sc: collusion-resistant secure outsourcing of sequence comparison algorithm |
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 |