WO2019085350A1

WO2019085350A1 - Method and device for generating identifier, computer device, and storage medium

Info

Publication number: WO2019085350A1
Application number: PCT/CN2018/077283
Authority: WO
Inventors: 周泓宇
Original assignee: 平安科技（深圳）有限公司
Priority date: 2017-10-30
Filing date: 2018-02-26
Publication date: 2019-05-09
Also published as: CN107861833B; CN107861833A

Abstract

A method for generating an identifier. The method comprises: if an instruction for generating an identifier UUID is received, generating the UUID; acquiring an insertion position between the first bit and the tail bit of the UUID in a pre-set acquisition manner according to a value at a pre-designated position in the UUID; and inserting, at the insertion position, pre-set content for verifying the UUID, and generating a new identifier, with the pre-set content being generated according to a first pre-set rule.

Description

Method and device for generating identification code, computer device and storage medium

This application claims the priority of the Chinese Patent Application filed on October 30, 2017, the Chinese Patent Application No. 201711035194.9, the invention entitled "Identification Code Generation Method and Apparatus, Computer Equipment, Readable Storage Medium", all of which The content is incorporated herein by reference.

Technical field

The present application relates to the field of computer technology, and in particular, to a method and device for generating an identification code, a computer device, and a storage medium.

Background technique

UUID refers to the Universally Unique Identifier. The purpose of UUID is to make all elements in a distributed system uniquely identified without the need to identify the identification through the central console. In this way, each element in the distributed system can establish a UUID that does not conflict with other elements. In such a case, there is no need to consider the name duplication problem when the database is created. UUID is a number generated on a machine that is guaranteed to be unique to all machines in the same time and space. Usually the platform provides an API (Application Programming Interface) that generates UUIDs. According to the standards developed by the Open Software Foundation (OSF), Ethernet card addresses, nanosecond time, chip ID codes, and many possible numbers are used.

The above UUID generation algorithm randomly generates a 32-bit hexadecimal number, but the rules are uniform and can be generated by anyone, and it is difficult to verify the identification code.

Summary of the invention

According to various embodiments of the present application, a method and apparatus for generating an identification code, a computer device, and a storage medium are provided.

A method for generating an identification code, the method comprising: generating an UUID if an instruction to generate an identification code UUID is received; pre-specifying a value according to the UUID, according to a preset acquisition manner, in the UUID Obtaining an insertion position between the first position and the last position; and inserting a preset content for verifying the UUID at the insertion position to generate a new identification code, and the preset content is generated according to the first preset rule.

An apparatus for generating an identification code, the apparatus comprising: a generating module, configured to generate the UUID if an instruction to generate an identification code UUID is received; and an acquiring module, configured to pre-specify a value according to the UUID according to the UUID a preset acquisition mode, obtaining an insertion position between a first bit and a last bit of the UUID; and a generating module, configured to insert a preset content for verifying the UUID at the insertion position, and generate a new identification code, where the The content is generated according to the first preset rule.

A computer device comprising a memory and one or more processors, the memory storing computer readable instructions, the computer readable instructions being executed by the processor, causing the one or more processors to execute The following steps: if the instruction for generating the identifier UUID is received, the UUID is generated; the value at the location is pre-specified according to the UUID, and the insertion position is obtained between the first and last digits of the UUID according to a preset acquisition manner; And inserting a preset content for verifying the UUID at the insertion position, generating a new identification code, and the preset content is generated according to the first preset rule.

One or more non-transitory readable storage mediums storing computer readable instructions, when executed by one or more processors, cause the one or more processors to perform the following steps: Receiving an instruction to generate an identifier UUID, generating the UUID; pre-specifying a value according to the UUID, acquiring an insertion position between a first bit and a last bit of the UUID according to a preset acquisition manner; The insertion position is inserted to verify the preset content of the UUID, and a new identification code is generated, and the preset content is generated according to the first preset rule.

Details of one or more embodiments of the present application are set forth in the accompanying drawings and description below. Other features, objects, and advantages of the invention will be apparent from the description and appended claims.

DRAWINGS

In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings to be used in the embodiments or the prior art description will be briefly described below. Obviously, the drawings in the following description are only It is a certain embodiment of the present application, and other drawings can be obtained according to the drawings without any creative work for those skilled in the art.

1 is an application environment diagram of a method for generating an identification code in an embodiment;

2 is a flow chart of a method for generating an identification code in an embodiment;

3 is a structural diagram of an apparatus for generating an identification code in an embodiment;

4 is a diagram showing the internal structure of a computer device in an embodiment.

Detailed ways

In order to make the objects, technical solutions, and advantages of the present application more comprehensible, the present application will be further described in detail below with reference to the accompanying drawings and embodiments. It is understood that the specific embodiments described herein are merely illustrative of the application and are not intended to be limiting.

It will be understood that the terms "first," "second," and the like, as used herein, may be used to describe various elements, but these elements are not limited by these terms. These terms are only used to distinguish the first element from another element. For example, the first preset rule may be referred to as a second preset rule without departing from the scope of the present application, and similarly, the second preset rule may be referred to as a first preset rule. Both the first preset rule and the second preset rule are preset rules, but they are not the same preset rule.

Please refer to FIG. 1. FIG. 1 is an application environment diagram of a method for generating an identifier in an embodiment, where the application environment includes: a terminal 120, a connection network 140, and a server 160. The terminal 120 includes an electronic device such as a mobile terminal, a tablet computer, a smart wearable device, a desktop computer, or a notebook. The connection network 140 is a wired or wireless network, and the wireless connection method includes a mobile communication network or a connection method such as WIFI (WIreless-Fidelity). The server 160 is a local server or a cloud server.

The working process of each component in the application environment is: the terminal 120 sends a request to the server 160 through the connection network 140, for example, the terminal 120 sends an account login request by scanning the two-dimensional code to the server 160 through the connection network 140, and the server 160 receives the terminal 120. After the account login request is sent, the server 160 invokes a module for generating the universal unique identifier UUID on the server 160. After receiving the instruction to generate the identifier UUID, the module generates a UUID, and the server 160 pre-specifies the value according to the UUID, according to the pre-predetermined value. The acquisition mode is set to obtain an insertion position between the first and last positions of the UUID, and the preset content of the verification UUID generated according to the first preset rule is inserted at the insertion position to generate a new identification code, and the server 160 will be universally unique and new. The identification code is sent to the terminal 120 in the form of a two-dimensional code. The terminal 120 performs account verification by using the new identification code, and logs in to the server 160. When the terminal 120 logs in to the server 160 through the two-dimensional code including the new identification code, the server 160 passes the new one. The verification code contained in the identification code verifies the two-dimensional code, thereby implementing verification of the login account. .

Referring to FIG. 2, FIG. 2 is a flowchart of an embodiment of a method for generating an identifier provided by the present application, where the method includes:

Step 200: If an instruction to generate the identification code UUID is received, a UUID is generated.

Specifically, the most widely used UUIDs are Microsoft's Globally Unique Identifiers (GUIDs), while other applications include Linux ext2/ext3 file systems, LUKS encryption partitions, GNOME, KDE, Mac OS X, etc. Usually, the computer equipment platform provides an API module (Application Programming Interface) that generates a UUID.

The computer device receives the instruction to generate the identification code UUID, and the computer device generates an identification code UUID by calling the API interface of the UUID on the computer device, and the UUID is a 32-bit hexadecimal random number, which is converted into a binary, that is, 16 words. A 128-bit binary number.

The UUID can be generated as follows:

Java generated code: UUID.randomUUID().toString().replace("-",""), generates a 32-bit hexadecimal random number, such as: 406fb0188d884cc3aff84b0f7ea2953c.

Usually, the UUID consists of the following parts:

(1) The current date and time, the first part of the UUID is related to time. If a UUID is generated after a few seconds after generating a UUID, the first part is different and the others are the same.

(2) Clock sequence.

(3) Globally unique IEEE machine identification number (IEEE, the full name is Institute of Electrical and Electronics Engineers, Institute of Electrical and Electronics Engineers), if there is a network card, obtained from the MAC address of the network card (MAC, Media Access Control or Medium Access Control, media Access control, or physical address, hardware address, is used to define the location of a network device. No network card is otherwise available.

Step 220: Pre-specify the value according to the UUID, and obtain the insertion position between the first position and the last position of the UUID according to the preset acquisition manner.

Specifically, the computer device generates a UUID according to the received instruction for generating the UUID, pre-specifies the value according to the UUID, and obtains an insertion position between the first and last positions of the UUID according to the preset acquisition manner to ensure the first position of the identification code. The value of the last bit and the value of the last bit are unchanged. The reason why an insertion position is obtained between the first and last positions of the UUID is that the insertion position cannot be determined because the insertion position is not known, and the insertion content cannot be obtained, thereby ensuring that the identification code is not cracked or tampered, thereby ensuring that the identification code is not cracked or falsified. UUID security.

Step 240: Insert a preset content of the verification UUID at the insertion position, generate a new identification code, and generate the preset content according to the first preset rule.

Specifically, the first preset rule includes at least one of the following: generating a manner of generating a current time segment for verifying the validity of the UUID, and generating a check mode for verifying the authenticity of the UUID (or a check code).

The computer device acquires the insertion position in the UUID, inserts the preset content in the insertion position, and generates a new identification code. Since the original identification code when the preset content is not inserted is unique, the newly generated identification code is also based on the original unique identifier. It is unique, so as to ensure the uniqueness of the newly generated identification code, according to the insertion content of the new identification code, the verification of the new identification code is realized, and the generation method of the new identification code is simple, the calculation complexity is low, and the efficiency is high. Sex.

Further, when verifying the newly generated identification code, the steps taken are as follows:

(1) The insertion position is determined according to the first bit value on the first bit of the new identification code and the last bit value on the last bit, and the preset acquisition mode of the insertion position.

Specifically, since the inserted preset content is in the middle of the first bit and the last bit of the identification code, the first bit and the last bit of the newly generated identification code after the preset content is inserted are unchanged with respect to the first bit and the last bit of the original identifier, according to The first bit value of the first bit of the newly generated identification code and the last bit value of the last bit, and the preset acquisition mode of the insertion position, find the insertion position.

(2) Acquiring the insertion length of the inserted preset content according to the newly generated new UUID length -32 (32 is the original UUID length), and extracting the inserted preset content according to the insertion length from the acquired insertion position.

(3) Verify the newly generated identification code based on the inserted preset content.

Specifically, for example, if the insertion content is the current time segment and the check digit of the generated identification code, the current time segment of the generated identification code and the current time of the computer device can be compared, and the effective survival of the identification code set on the computer device can be performed. Time, verify the timeliness of the identification code, that is, verify that the identification code is still within the valid time. For example, if the effective duration of the identification code set on the computer device is 5 minutes, then the comparison time of the generation of the identification code to the current time on the computer device exceeds 5 minutes. If the identification code is less than 5 minutes, the identification code is within the valid time. The identification code is valid; if the identification code has exceeded the valid time for more than 5 minutes, the identification code is invalid.

It is also possible to verify the authenticity of the identification code by the check digit, that is, according to the verification rule of different verification methods adopted on the check digit, verify whether the check digit has consistency, and if the check digit has consistency, Indicates that the identification code is authentic. If there is an inconsistency in the check digit, it indicates that the identification code has been tampered with or cracked. For example, if the parity bit uses parity, the number of "1"s in the digits of the transmitted binary code is odd or even. The odd number is called odd parity, and the other is called even parity. Which calibration is used is prescribed in advance. Usually a parity bit is set specifically, which is used to make the number of "1"s in this group of codes odd or even. If odd parity is used, when the receiving end receives the set of codes, it is checked whether the number of "1" is an odd number, thereby determining the correctness of the transmission code.

A simple verification of the newly generated identification code can be implemented according to the inserted content with respect to the original UUID generated according to the unified rule.

In one embodiment, the UUID pre-specified value includes at least one of the following: a first value on the first bit of the UUID and a last value on the last bit of the UUID.

Specifically, the computer device generates an identification code UUID by calling an API interface that generates the UUID according to the instruction to generate the identification code UUID, and the identification code UUID generated by the computer device is a 32-bit hexadecimal random number, such as: 406fb0188d884cc3aff84b0f7ea2953c . The computer device determines that the position range of each bit of the identification code UUID is 0 to 31 bits, and the value on each bit is a value between 0 and 15, according to the rules of the computer, the value at each position of the identification code UUID and The decimal correspondence is shown in Table 1 below:

Table 1

十进制Decimal	00	11	22	33	44	55	66	77	88	99	1010	1111	1212	1313	1414	1515
十六进制Hexadecimal	00	11	22	33	44	55	66	77	88	99	aa	bb	cc	dd	ee	ff

According to the above Table 1, the identification code: 406fb0188d884cc3aff84b0f7ea2953c, the first digit is 4, and the last digit is c, the first digit of the first digit of the identification code "406fb0188d884cc3aff84b0f7ea2953c" is 4, and the last digit of the last digit is 12.

In an embodiment, according to the UUID pre-specifying the value in the position, the step of obtaining the insertion position between the first bit and the last bit of the UUID according to the preset acquisition manner includes: according to the first bit value, the last bit value or the first bit value and the last bit position Value, get a positive integer; get the insertion position between the first and last digits of the UUID according to the positive integer, in order from left to right, or from UYID to right-to-left.

Specifically, the computer device obtains the insertion position, and the insertion position is obtained according to the preset value of the pre-specified position and the insertion position of the UUID, and may be a positive integer obtained according to the first value or a positive integer obtained according to the last value. It is also possible to combine a first value with a last value to obtain a positive integer. For example, the above identification code: 406fb0188d884cc3aff84b0f7ea2953c, it can be seen that the first digit of the first digit of the identification code is 4, the last digit of the last digit is c, the decimal of the hexadecimal c is 12, and the computer device according to the first value of the identification code 4, and the last digit The value 12 is obtained by pre-specifying the value according to the UUID and acquiring the insertion position according to the preset insertion position. The obtained insertion position may be one of the following situations:

(1) The value at the position is pre-specified according to the UUID, and the insertion position is obtained by acquiring the insertion position in order from the left to the right according to the identification code.

If the insertion position is the first value of the identification code, since the first bit value of the identification code is 4, the insertion position is the 4th position of the identification code from left to right, that is, the first f after the identification code from left to right; Similarly, if the insertion position is the last value of the identification code, the insertion position is the 12th position of the identification code from left to right, that is, the 4th 8th from left to right in the identification code.

(2) The value of the insertion position is obtained in advance according to the UUID, and the insertion position is obtained by acquiring the insertion position in order from right to left according to the identification code.

If the insertion position is the first value of the identification code, since the first bit value of the identification code is 4, the insertion position is the 4th position of the identification code from right to left, that is, the position from the right to the left of the first 9 in the identification code. Similarly, if the insertion position is the last value of the identification code, the insertion position is the 12th position of the identification code, that is, the front of the first 4 from right to left in the identification code.

It can be seen that, through the above manner, flexible setting of the insertion position can be realized, and the security of the identification code is further ensured.

In one embodiment, the step of obtaining a positive integer according to the first value and the last value includes:

A positive integer is obtained based on the sum of the first value on the first digit of the UUID and the last value on the last digit.

Specifically, the computer device obtains a positive integer according to the sum of the first bit value on the first bit of the UUID and the last bit value on the last bit, and according to the obtained positive integer, according to the preset acquisition manner of the insertion position, the first and last positions of the UUID Get the insertion position between.

Taking the above identification code: 406fb0188d884cc3aff84b0f7ea2953c as an example, the computer device may use the sum of the first value 4 and the last value 12 of the identification code, in the order of the identification code from left to right, with the 16th position of the identification code as the preset content. The insertion position, that is, the preset content is inserted in the 16th position of the identification code: 406fb0188d884cc3 aff84b0f7ea2953c, that is, the space.

A positive integer is obtained based on the absolute value of the difference between the first value and the last value of the UUID.

Specifically, the computer device obtains a positive integer according to the absolute value of the difference between the first bit value on the first bit of the UUID and the last bit value on the last bit, and according to the obtained positive integer, according to the preset acquisition mode of the insertion position, the first position of the UUID Get the insertion position between the last bit and the last bit.

Taking the above identification code: 406fb0188d884cc3aff84b0f7ea2953c as an example, the computer device may use the absolute value 8 of the difference between the first value 4 and the last value 12 of the identification code, in the order of the identification code from left to right, and the eighth position of the identification code as a pre- Set the insertion position of the content, that is, insert the preset content in the eighth position of the identification code: 406fb018 8d884cc3aff84b0f7ea2953c, that is, the space.

In one embodiment, the step of obtaining a positive integer based on the first value, the last value, or the first value and the last value includes:

According to the first value plus n1, the last value plus n2, the sum of the first value and the last value plus one, or the absolute value of the difference between the first value and the last value plus n3, obtain a positive integer, where 1 ≤ n1 ≤ 16, 1 ≤ n2 ≤ 16, 1 ≤ n3 ≤ 16.

Specifically, the computer device obtains a positive integer according to one of the following situations, and further acquires the insertion position according to a preset acquisition manner of the positive integer and the insertion position:

(1) Add n1 according to the first value, 1 ≤ n1 ≤ 16. Since the UUID is a 32-bit natural number, the first value on the first digit is a maximum of 15 and the minimum is 0. To ensure that the insertion position is between the first and last digits, the first value is added to n1, and the range of n1 can only be 1≤n1. ≤16.

Similarly, the last value plus n2, n2 can only be 1 ≤ n2 ≤ 16.

(2) In order to avoid the sum of the first bit value on the first bit of the identification code and the last bit value on the last bit of the identification code being 0, that is, the case where the first bit value of the identification code and the last bit value of the identification code are both 0, The sum is 0, and 0, which means that the insertion position is the first position of the identification code, and the preset insertion content is in front of the identification code. In this case, the identification code is easily recognized, and the first value of the identification code and the identification code are Add the sum of the last value, that is, (first + last) +1, the range 1 ~ 31 is just in the middle of the first and last digits of the identification code, the insertion method can ensure that the values of the first and last digits are unchanged. It is convenient to determine the insertion position when performing verification, and obtain the preset insertion content according to the insertion position. For example, taking the above identification code: 406fb0188d884cc3aff84b0f7ea2953c as an example, the insertion point position is: 406fb0188d884cc3a insertion point ff84b0f7ea2953c.

(3) If n3 is added according to the absolute value of the difference between the first value and the last value, a positive integer is obtained.

Specifically, there are two situations:

1) The absolute value of the difference between the first bit value on the first bit of the identification code and the last bit value on the last bit of the identification code is 0, that is, the first bit value on the first bit of the identification code and the last bit on the last bit of the identification code The bit values are the same.

2) The absolute value of the difference between the first bit value on the first bit of the identification code and the last bit value on the last bit of the identification code is at most 15, that is, the first bit value on the first bit of the identification code and the last bit on the last bit of the identification code The bit values are one for 0 and one for 15.

The absolute value of the difference is 0, which means that the insertion position is the first position of the identification code, the preset insertion content is in front of the identification code, the absolute value of the difference is 15, and there are 17 positions, which means that the insertion position is the identification code. At the last position, the preset insertion content is behind the identification code, regardless of whether the insertion position is in front of or behind the identification code. In this case, the identification code is easily recognized, so that the insertion position is in the middle of the first and last positions of the UUID. , in the absolute value of the difference between the first value of the first digit of the identification code and the last digit of the last digit of the identification code, plus n3, that is, the first position - the end | + n3, in order to ensure that the obtained insertion position is in the UUID In the middle of the first and last positions, the value of n3 can be up to 16 and the minimum is 1. This insertion mode can ensure that the values of the first and last digits are unchanged, which is convenient for determining the insertion position during verification, and obtaining the pre-position according to the insertion position. Set the insertion content.

For example, taking the above identification code: 406fb0188d884cc3aff84b0f7ea2953c as an example, taking n3 as an example, the insertion point position is: 406fb0188 insertion point d884cc3a ff84b0f7ea2953c.

In one embodiment, the step of inserting the preset content of the verification UUID at the insertion location comprises:

Insert at least one of the following at the insertion position: current time segment, check digit.

Specifically, the current time segment refers to a time when the time stamp is acquired when the preset content is inserted at the insertion position, and is represented by a one-digit number, which is called a current time segment. The current time segment can be obtained by taking JavaScript as an example. JavaScript uses new Date().getTime() to get the timestamp, and obtains the decimal timestamp in milliseconds. The decimal timestamp removes the high-order k. Bit (the bit farther from the production time when the time stamp is generated, the value is unchanged for a long time, and the survival time is not affected after the removal), and then the last 3 bits are removed (divided by 1000, intercepted from the second), converted into hexadecimal , get the current time segment. For the value of k, the validity time of the time segment is not affected, for example, generating a decimal timestamp of 12345, assuming that the defined current time segment has a lifetime of 345, then 12345+345=12690, That is, the validity time limit of the current time segment is 12690. Compared with 12690, 12345 removes the high level of 12345, that is, the number of bits shared with 12690 far from the production time, which does not affect the judgment of the validity of the survival time. Then, the high bit 12 of 12345 is removed, and the remaining number of bits is 345. The decimal time stamp removes the upper k bits of the high order, which means that the first two bits 12 of the high order of the decimal time stamp 12345 are removed.

If PHP (which is the abbreviation of Hypertext Preprocessor in English), the obtained timestamp is a timestamp in seconds, which is directly converted into hexadecimal, and the current time segment is obtained by different methods. The timestamp is converted into the required time unit according to the relationship between the unit of time unit milliseconds, seconds, etc., and converted into hexadecimal to obtain the current time segment. Among them, the time stamp refers to the total number of seconds from 01:00 to 00:00 on January 01, 1970 (Beijing time, January 01, 1970, 08:00:00).

In one embodiment, according to the actual need for time sensitivity, in addition to the above-mentioned time segment for acquiring the current time segment in seconds, the time segment may also be acquired in units of minutes. For example, JavaScript is still used as an example. Since the timestamp generated by the terminal is calculated in milliseconds by default, since the second and milliseconds are multiples of 1000, if the time segment is acquired in seconds, the last 3 bits are removed, divided by 1000; if it is in minutes, it is divided by 60×1000.

In one embodiment, the setting of the time segment can also be customized by reversing the order of the time segments, such as from front to back. For example, the time segment obtained by the above algorithm is 12345, and the sequence of 12345 can be reversed. The time segment is represented by 54321, thereby obtaining the customization of the time segment.

It can be seen that the manner of obtaining the current time segment in the above manner is various, thereby realizing the flexibility of the current time segment customization, and further ensuring the security of the identification code.

In an embodiment, according to the actual situation, the time-sensitive requirement of the identification code is based on the current time segment, and the survival time of the identification code can be defined by the server, and the survival time of the identification code, that is, the effective time of the identification code, During the survival time, the identification code is in a valid state, exceeding the survival time, and the identification code is in a failure state. For example, if the survival time of the identification code is 5 minutes, the identification code is valid within 5 minutes from the time when the identification code is generated. The identification code is invalid for more than 5 minutes. When the server verifies the identification code, the server compares the generation time of the identification code represented by the current time segment of the generated identification code with the current time, and determines that the identification code is valid within the defined survival time, and if the server determines that the identification code exceeds the identification If the code defines the lifetime, the identifier will be invalid. That is, the survival time of the identification code can be customized according to the needs of the server, for example, 5 minutes, 3 minutes, etc. In the survival time, the UUID is valid, and the UUID is invalid after the survival time is exceeded, thereby verifying the timeliness of the UUID and satisfying the actual situation. In the case of need for the time-sensitive requirements of the identification code, such as scan code registration, scan code payment, etc., in order to ensure the security of the account, the identification code needs to meet certain timeliness requirements, scan code registration, set the identification code to 2 minutes, in Within 2 minutes, the identification code is valid. If it is more than 2 minutes, the identification code will automatically expire.

Among them, the check digit is parity, CRC check, and check or MD5 check.

Among them, Parity Check is a method to verify the correctness of code transmission. The check is performed based on whether the number of "1"s in the digits of the transmitted binary code is odd or even. The odd number is called odd parity, and the other is called even parity. Which calibration is used is prescribed in advance. Usually a parity bit is set specifically, which is used to make the number of "1"s in this group of codes odd or even. If odd parity is used, when the receiving end receives the set of codes, it is checked whether the number of "1" is an odd number, thereby determining the correctness of the transmission code.

CRC is the Cyclic Redundancy Check (Cyclic Redundancy Check): It is the most commonly used error checking code in the field of data communication. Its characteristic is that the length of the information field and the check field can be arbitrarily selected. Cyclic Redundancy Check (CRC) is a data transmission error detection function that performs polynomial calculation on data and attaches the result to the back of the frame. The receiving device also performs a similar algorithm to ensure the correctness and completeness of the data transmission. Sex.

And check is to verify that the sum of a set of data items is correct. Usually expressed in hexadecimal notation. If the value of the checksum exceeds the hexadecimal FF, it is 255.

The practical application of MD5 is to generate a fingerprint for a piece of Message (byte string) to prevent tampering.

In one embodiment, the check digit is acquired by the current time segment according to a second preset rule.

Specifically, the second preset rule is a manner of acquiring a check digit. The check bit is obtained by: (the current time segment is followed by k bit + insert bit, k ≥ 1)% 16 ⁿ , if the check bit takes 1 bit, n is 1, that is, 16 ⁿ = 16 ¹ = 16, For example, when the parity bit takes 1 bit, the value of the parity bit can take: (3 bits after the current time segment + insertion bit) %16. The current time segment in the k-bit after the current time segment may be a current time segment expressed in hexadecimal or a current time segment expressed in decimal, thereby further implementing flexible diversity of the check bit acquisition manner. According to the uniqueness of the current time segment, the obtained check digit is also unique, and the authenticity of the identifier is verified according to whether the check digit corresponds to the current time segment.

Similarly, if the parity bit is 2 bits, n takes 2, which is 16 ⁿ = 16 ² . If the parity bit is 3 bits, 16 ⁿ = 16 ³ , and when the parity bit is n bits, it is 16 ⁿ . Therefore, the check bit obtained in this way is verified, and the current time segment related to the survival time is covered by the overlay insertion bit, the verification rule is simple, and the check bit can also be flexibly set.

Specifically, the current time segment is inserted at the insertion position, and the time represented by the current time segment is compared with the current time when the server determines the identification code, and the identification code is determined according to whether the difference of the time exceeds the survival time of the server-defined identification code. Timeliness, by inserting a check digit at the insertion position, it is used to set the authenticity of the identification code. If the current time segment and the check digit are simultaneously inserted in the position, the timeliness and authenticity of the identification code can be verified at the same time.

For example, taking the above identification code: 406fb0188d884cc3aff84b0f7ea2953c as an example, the insertion position is (first value + last value) +1, then the insertion position is: 4+c (12 in decimal) +1=17, that is, the insertion position is the identification code. 17th place, insert content: current time segment + check digit. Wherein, since the identification code adopts hexadecimal, the value at each position of the identification code is at most 15, so the insertion position obtained by (first value + last value) +1 is in the middle of the first and last bits of the identification code.

Among them, the current time segment: can be intercepted from the second, remove the upper k position (bit far from the production time), and turn to hexadecimal, for example, the current time segment of the obtained hexadecimal is: 1d8b6f84. At the same time, according to the timeliness requirements, for example, the survival time of the identifier set by the server is 3 minutes.

Check digit: 1 bit, the value is: (3 bits after the current time segment + insert bit) %16, for example, the current time segment is expressed in hexadecimal, the last 3 digits of the current time segment in decimal notation To obtain the check digit, the current time segment according to hexadecimal is: the check digit of the last 3 digits of the decimal representation of 1d8b6f84 is 5.

The new identifier generation result is as follows:

406fb0188d884cc3a ff84b0f7ea2953c;

406fb0188d884cc3a 1d8b6f84 5 ff84b0f7ea2953c.

For the newly generated identification code, when the server performs the newly generated identification code verification, the following manner may be adopted:

1) According to the first value 4 and the last value c, the 17th position of the insertion position is found, and according to the new UUID length -32 (the original UUID length), the insertion length 9 bits is acquired, and the insertion content 1d8b6f84 5 is intercepted from the insertion position.

2), take the last bit of the inserted content 5 for verification, verify the authenticity of the UUID.

3), take the rest of the inserted content to compare with the current time, check whether the identification code exceeds the server-defined survival time (such as 3 minutes), and check the timeliness of the UUID.

Therefore, the identification code generated by the above manner can verify the authenticity and timeliness of the identification code.

In one embodiment, the newly generated identification code according to the above manner is also unique and can be verified according to the counter-evidence method:

Prerequisite: The original UUID is unique

Assume that there are 2 identical UUIDs, u1 and u2;

prove:

U1 is the same as the end of u2, and the insertion point is the same.

If u1 and u2 are the same length, the insertion length is the same.

Delete the contents of u1 and u2, and u1 and u2 are still equal.

Therefore, the original UUID uniqueness principle is violated. Therefore, the assumption is not true and the new UUID is unique.

Under the premise of maintaining the uniqueness of the newly generated UUID, the improved new UUID has the following beneficial effects:

1) The new UUID is generated to verify that the new UUID is reliable and authentic;

2) Insert a time segment and include a check to set a valid survival time for the new UUID;

3) The inserted time segment, check field and its life cycle can be customized. Therefore, the new UUID generation rules are diverse;

4) The generation and verification algorithm has low complexity and short time.

In one embodiment, the current time segment and the check digit are inserted at the insertion position, wherein the current time segment is first, the parity bit is after, or the parity bit is first, and the current time segment is after.

Specifically, when the current time segment and the check bit are simultaneously inserted at the insertion position of the identification code, the order of the current time segment and the check bit may be set to the current time segment first, or may be set to the check bit first.

In the actual application, for example, when developing a QR code scan code registration function, a unique field is required to represent the two-dimensional code, and a unique field UUID is used to represent the two-dimensional code, and the authenticity is verified by the uniqueness of the UUID. The validity and failure of the two-dimensional code are ensured by the timeliness of the UUID. When verifying that the two-dimensional code is true and valid, the user is allowed to log in to the account by scanning the code, thereby ensuring the security of the login account.

The method for generating the identification code generates a UUID by receiving an instruction to generate the identification code UUID; pre-specifying the value according to the UUID, obtaining an insertion position between the first and last positions of the UUID; and inserting the verification UUID at the insertion position The preset content is generated, a new identification code is generated, and the simple verification of the identification code is realized by the inserted preset content.

Referring to FIG. 3, an embodiment of the present application further provides an apparatus for generating an identifier, where the apparatus includes:

The generating module 30 is configured to generate a UUID if receiving an instruction to generate the identification code UUID.

Specifically, the computer device receives the instruction for generating the identifier UUID, and the computer device generates an identifier UUID by calling an API interface for generating the UUID on the computer device, and the UUID is a 32-bit hexadecimal random number, which is converted into a binary, It is a 16-byte 128-bit binary number.

The UUID can be generated as follows:

The obtaining module 32 is configured to obtain the insertion position between the first position and the last position of the UUID according to the preset acquisition manner according to the UUID.

The generating module 34 is configured to insert a preset content of the verification UUID at the insertion position, generate a new identification code, and generate the preset content according to the first preset rule.

For example, if the inserted content is the current time segment and the check digit of the generated identification code, the current time segment of the generated identification code and the current time of the computer device can be compared, and the effective duration of the identification code set on the computer device can be verified. The timeliness of the identification code, that is, whether the identification code is still within the valid time. For example, if the effective duration of the identification code set on the computer device is 5 minutes, then the comparison time of the generation of the identification code to the current time on the computer device exceeds 5 minutes. If the identification code is less than 5 minutes, the identification code is within the valid time. The identification code is valid; if the identification code has exceeded the valid time for more than 5 minutes, the identification code is invalid.

Specifically, the computer device generates an identification code UUID by calling an API interface that generates the UUID according to the instruction to generate the identification code UUID, and the identification code UUID generated by the computer device is a 32-bit hexadecimal random number, such as: 406fb0188d884cc3aff84b0f7ea2953c . The computer device determines that the position range of each bit of the identification code UUID is 0 to 31 bits, and the value on each bit is a value between 0 and 15, according to the rules of the computer, the value at each position of the identification code UUID and The decimal correspondence is shown in Table 2 below:

Form 2

According to the above Table 2, the above identification code: 406fb0188d884cc3aff84b0f7ea2953c, the first digit is 4, and the last digit is c, the first digit of the first digit of the identification code "406fb0188d884cc3aff84b0f7ea2953c" is 4, and the last digit of the last digit is 12.

In an embodiment, the obtaining module 32 includes: a positive integer obtaining unit, configured to obtain a positive integer according to the first bit value, the last bit value or the first bit value and the last bit value; and an insertion position obtaining unit for using the UUID from left to right The order of the insertion, or the order of the UUID from right to left, according to a positive integer, obtains the insertion position between the first and last digits of the UUID.

Specifically, the computer device obtains the insertion position, and the insertion position is obtained according to the preset value of the pre-specified position and the insertion position of the UUID, and may be a positive integer obtained according to the first value or a positive integer obtained according to the last value. It is also possible to combine a first value with a last value to obtain a positive integer. For example, the above identification code: 406fb0188d884cc3aff84b0f7ea2953c, it can be seen that the first digit of the first digit of the identification code is 4, the last digit of the last digit is c, the decimal of the hexadecimal c is 12, and the computer device according to the first value of the identification code 4, and the last digit. The value 12 is obtained by pre-specifying the value according to the UUID and acquiring the insertion position according to the preset insertion position. The obtained insertion position may be one of the following situations:

In one embodiment, the positive integer acquisition unit includes: for obtaining a positive integer based on the sum of the first bit value on the first bit of the UUID and the last bit value on the last bit.

In one embodiment, the positive integer acquisition unit includes: for obtaining a positive integer based on the absolute value of the difference between the first value and the last value of the UUID.

In one embodiment, the positive integer obtaining unit includes: for adding n1 according to the first value, adding n2 for the last value, adding 1 to the sum of the first value and the last value, or adding the absolute value of the difference between the first value and the last value plus N3, obtaining a positive integer, where 1≤n1≤16, 1≤n2≤16, 1≤n3≤16.

Similarly, the last value plus n2, n2 can only be 1 ≤ n2 ≤ 16.

Specifically, there are two situations:

In one embodiment, the generating module 34 includes: for inserting at least one of the following at the insertion position: a current time segment, a parity bit.

Among them, the check digit is parity, CRC check, and check or MD5 check.

The new identifier generation result is as follows:

406fb0188d884cc3a ff84b0f7ea2953c;

406fb0188d884cc3a 1d8b6f84 5 ff84b0f7ea2953c.

3), the inserted time segment, check field and its life cycle can be customized, therefore, the new UUID generation rules are diverse;

4) The generation and verification algorithm has low complexity and short time.

The division of each module in the above-mentioned identification code generating device is for illustrative purposes only. In other embodiments, the identification code generating device may be divided into different modules as needed to complete all or part of the above-mentioned identification code generating device. Features.

The above-described identification code generating means can be implemented in the form of a computer readable instruction which can be run on a computer device as shown in FIG.

In one embodiment, one or more non-volatile readable storage media having computer readable instructions stored by one or more processors are provided, such that one or more processors are Performing the following steps: if receiving the instruction for generating the identification code UUID, generating the UUID; and pre-specifying the value according to the UUID, obtaining the insertion position between the first and last positions of the UUID according to the preset acquisition manner; inserting at the insertion position The preset content of the UUID is verified, and a new identification code is generated, and the preset content is generated according to the first preset rule.

In an embodiment, the step of obtaining the insertion position between the first position and the last position of the UUID according to the preset acquisition manner by the processor according to the UUID pre-specified value includes: according to the first value, the last value or The first value and the last value are obtained as positive integers; and the insertion position is obtained between the first and last positions of the UUID according to the positive integer in the order from left to right in UUID or from right to left in accordance with the UUID.

In an embodiment, the step of obtaining a positive integer according to the first bit value and the last bit value performed by the processor comprises: according to the sum of the first bit value and the last bit value, or according to the absolute value of the difference between the first bit value and the last bit value, Get a positive integer.

In an embodiment, the step of obtaining a positive integer according to the first bit value, the last bit value or the first bit value and the last bit value performed by the processor includes: adding n1 according to the first bit value, adding n2 to the last bit value, and the first bit value and the last bit value. The sum is incremented by 1, or the absolute value of the difference between the first bit value and the last bit value is added by n3 to obtain a positive integer, where 1 ≤ n1 ≤ 16, 1 ≤ n2 ≤ 16, and 1 ≤ n3 ≤ 16.

In one embodiment, the step of inserting, by the processor, the preset content of the verification UUID at the insertion position comprises: inserting at least one of the following contents at the insertion position: a current time segment, a parity bit.

The embodiment of the present application further provides a computer device, including a memory and a processor, where the computer stores readable instructions, and when the computer readable instructions are executed by the processor, the method for generating the identifier executed by the processor A step of. As shown in FIG. 4, for the convenience of description, only parts related to the embodiment of the present application are shown. The computer device can be a computer device including a personal computer or a server.

4 is a diagram showing the internal structure of a computer device provided by an embodiment of the present application. As shown in FIG. 4, the computer device includes a processor, a non-volatile storage medium, an internal memory, and a network interface connected by a system bus. Wherein, the non-volatile storage medium of the computer device stores an operating system and computer readable instructions. The computer readable instructions are executed by the processor to implement a method of generating an identification code. The processor of the computer device is used to provide computing and control capabilities to support the operation of the entire computer device. The network interface of the computer device is configured to communicate with an external terminal via a network connection, such as receiving a scan code request sent by the terminal and returning a two-dimensional code including the identification code to the terminal. The computer device can be implemented by a stand-alone server or a server cluster composed of multiple servers. It will be understood by those skilled in the art that the structure shown in FIG. 4 is only a block diagram of a part of the structure related to the solution of the present application, and does not constitute a limitation of the computer device to which the solution of the present application is applied. The specific computer device may It includes more or fewer components than those shown in the figures, or some components are combined, or have different component arrangements.

In one embodiment, a computer apparatus is provided comprising a memory and one or more processors having stored therein computer readable instructions that, when executed by a processor, cause one or more processes The device performs the following steps: if receiving the instruction for generating the identification code UUID, generating the UUID; and pre-specifying the value according to the UUID, and obtaining the insertion position between the first and last positions of the UUID according to the preset acquisition manner; The preset content of the verification UUID is inserted to generate a new identification code, and the preset content is generated according to the first preset rule.

Any reference to a memory, storage, database, or other medium used herein may include non-volatile. Suitable non-volatile memories can include read only memory (ROM), programmable ROM (PROM), electrically programmable ROM (EPROM), electrically erasable programmable ROM (EEPROM), or flash memory.

The above-mentioned embodiments are merely illustrative of several embodiments of the present application, and the description thereof is more specific and detailed, but is not to be construed as limiting the scope of the claims. It should be noted that a number of variations and modifications may be made by those skilled in the art without departing from the spirit and scope of the present application. Therefore, the scope of the invention should be determined by the appended claims.

Claims

A method for generating an identification code, comprising:

Generating the UUID if an instruction to generate the identification code UUID is received;

Obtaining an insertion position between the first position and the last position of the UUID according to a preset acquisition manner according to a value of the UUID pre-specified position; and

A preset content for verifying the UUID is inserted at the insertion position to generate a new identification code, and the preset content is generated according to a first preset rule.
The method according to claim 1, wherein the value of the UUID pre-specified position comprises at least one of the following:

a first value on the first bit of the UUID, and a last value on the last bit of the UUID.
The method according to claim 2, wherein the step of obtaining an insertion position between the first position and the last position of the UUID according to the preset acquisition manner according to the value of the UUID pre-specified position includes:

Obtaining a positive integer according to the first value, the last value, or the first value and the last value; and

The insertion position is obtained between the first and last digits of the UUID according to the positive integer in the order from left to right of the UUID or from right to left in accordance with the UUID.
The method according to claim 3, wherein the step of obtaining a positive integer according to the first bit value and the last bit value comprises:

A positive integer is obtained according to the sum of the first bit value and the last bit value, or according to the absolute value of the difference between the first bit value and the last bit value.
The method according to claim 3, wherein the step of obtaining a positive integer according to the first bit value, the last bit value or the first bit value and the last bit value comprises:

Adding n1 according to the first bit value, adding n2 to the last bit value, adding 1 to the sum of the first bit value and the last bit value, or adding n3 to the absolute value of the difference between the first bit value and the last bit value, A positive integer is obtained, where 1 ≤ n1 ≤ 16, 1 ≤ n2 ≤ 16, and 1 ≤ n3 ≤ 16.
The method according to claim 1, wherein the step of inserting the preset content for verifying the UUID at the insertion position comprises:

At least one of the following contents is inserted at the insertion position: a current time segment, a parity bit.
The method according to claim 6, wherein the check bit is acquired by the current time segment according to a second preset rule.
An apparatus for generating an identification code, characterized in that the apparatus comprises:

a generating module, configured to generate the UUID if receiving an instruction to generate an identifier UUID;

An obtaining module, configured to obtain an insertion position between a first position and a last position of the UUID according to a preset acquisition manner according to a value in a pre-specified position of the UUID; and

And a generating module, configured to insert a preset content for verifying the UUID at the insertion position, and generate a new identification code, where the preset content is generated according to a first preset rule.
A computer device comprising a memory and one or more processors, the memory storing computer readable instructions, the computer readable instructions being executed by the processor, causing the one or more processors to execute The following steps:

Generating the UUID if an instruction to generate the identification code UUID is received;

Obtaining an insertion position between the first position and the last position of the UUID according to a preset acquisition manner according to a value of the UUID pre-specified position; and

A preset content for verifying the UUID is inserted at the insertion position to generate a new identification code, and the preset content is generated according to a first preset rule.
The computer apparatus according to claim 9, wherein the value of the UUID pre-specified location comprises at least one of the following:

a first value on the first bit of the UUID, and a last value on the last bit of the UUID.
The computer device according to claim 10, wherein the value of the pre-specified position according to the UUID executed by the processor is obtained between the first bit and the last bit of the UUID according to a preset acquisition manner. The steps to insert a location include:

Obtaining a positive integer according to the first value, the last value, or the first value and the last value; and

The insertion position is obtained between the first and last digits of the UUID according to the positive integer in the order from left to right of the UUID or from right to left in accordance with the UUID.
The computer device according to claim 11, wherein the step of obtaining, by the processor, the obtaining of a positive integer according to the first bit value and the last bit value comprises:

A positive integer is obtained according to the sum of the first bit value and the last bit value, or according to the absolute value of the difference between the first bit value and the last bit value.
The computer device according to claim 12, wherein the step of the processor to obtain a positive integer according to the first bit value, the last bit value or the first bit value and the last bit value comprises:

Adding n1 according to the first bit value, adding n2 to the last bit value, adding 1 to the sum of the first bit value and the last bit value, or adding n3 to the absolute value of the difference between the first bit value and the last bit value, A positive integer is obtained, where 1 ≤ n1 ≤ 16, 1 ≤ n2 ≤ 16, and 1 ≤ n3 ≤ 16.
The computer device according to claim 10, wherein the step of inserting, by the processor, the verification of the preset content of the UUID at the insertion position comprises:

At least one of the following contents is inserted at the insertion position: a current time segment, a parity bit.
One or more non-transitory readable storage mediums storing computer readable instructions, when executed by one or more processors, cause the one or more processors to perform the following steps:

Generating the UUID if an instruction to generate the identification code UUID is received;

Obtaining an insertion position between the first position and the last position of the UUID according to a preset acquisition manner according to a value of the UUID pre-specified position; and

A preset content for verifying the UUID is inserted at the insertion position to generate a new identification code, and the preset content is generated according to the first preset rule.
The storage medium according to claim 15, wherein the value of the UUID pre-specified position comprises at least one of the following:

a first value on the first bit of the UUID, and a last value on the last bit of the UUID.
The storage medium according to claim 16, wherein the value of the pre-specified position according to the UUID executed by the processor is obtained between the first bit and the last bit of the UUID according to a preset acquisition manner. The steps to insert a location include:

Obtaining a positive integer according to the first value, the last value, or the first value and the last value; and

The insertion position is obtained between the first and last digits of the UUID according to the positive integer in the order from left to right of the UUID or from right to left in accordance with the UUID.
The storage medium according to claim 17, wherein the step of obtaining, by the processor, the obtaining of a positive integer according to the first bit value and the last bit value comprises:

A positive integer is obtained according to the sum of the first bit value and the last bit value, or according to the absolute value of the difference between the first bit value and the last bit value.
The storage medium according to claim 17, wherein the step of the processor to obtain a positive integer according to the first bit value, the last bit value or the first bit value and the last bit value comprises:

Adding n1 according to the first bit value, adding n2 to the last bit value, adding 1 to the sum of the first bit value and the last bit value, or adding n3 to the absolute value of the difference between the first bit value and the last bit value, A positive integer is obtained, where 1 ≤ n1 ≤ 16, 1 ≤ n2 ≤ 16, and 1 ≤ n3 ≤ 16.
The storage medium according to claim 15, wherein the step of inserting, by the processor, the verification of the preset content of the UUID at the insertion position comprises:

At least one of the following contents is inserted at the insertion position: a current time segment, a parity bit.