WO2021128871A1

WO2021128871A1 - Transaction code generation method, apparatus and system, and method, apparatus and system for processing based on transaction code

Info

Publication number: WO2021128871A1
Application number: PCT/CN2020/109082
Authority: WO
Inventors: 刘永振; 张波; 向洁敏; 查骏; 牛天耘; 冀乃庚
Original assignee: 中国银联股份有限公司
Priority date: 2019-12-27
Filing date: 2020-08-14
Publication date: 2021-07-01
Also published as: CN111144872A; CN111144872B

Abstract

Provided are a transaction code generation method, apparatus and system, and a method, apparatus and system for processing based on a transaction code. The transaction code generation method comprises: receiving a transaction code application sent by a first terminal, the transaction code application carrying transaction information of the first terminal; generating a preset sequence according to the transaction code application and a transaction code resource; encrypting the preset sequence according to a preset encryption algorithm to generate a target transaction code; and sending the target transaction code to the first terminal. By means of the method, a target transaction code with high randomness can be generated, and a generation space of the target transaction code is expanded.

Description

Transaction code generation and processing method, device and system based on transaction code

Technical field

The invention belongs to the field of computer technology, and specifically relates to a transaction code generation and processing method, device and system based on the transaction code.

Background technique

This section is intended to provide background or context for the embodiments of the invention stated in the claims. The description here is not recognized as prior art just because it is included in this section.

In the current transaction scenario, generally the consumer terminal sends a payment request to the payment system. After receiving the payment request, the payment system authenticates the consumer terminal and generates the corresponding transaction code and sends it to the consumer terminal. The consumer terminal displays the receipt The transaction code is for the merchant terminal to scan, and then the merchant terminal transmits the scanned transaction code to the payment system for payment authorization.

In the prior art, a transaction code is generated by randomly fetching values in a time sequence within a limited code space. For example, as shown in Figure 1, the existing transaction code generally includes 18-19 digits, of which the first 2-3 digits It is the identification code used to indicate the code issuing agency. For example, UnionPay’s logo is 62, Alipay’s logo is 28, WeChat’s logo is 13, etc. The last 16 bits are valid coding bits, of which 6 random numbers are usually taken, and 10 bits are self-contained. Incremental numbers ensure uniqueness. Due to the large number of concurrent transactions of online payment, this method is likely to cause the generated transaction codes to be similar, easy to be imitated or colluded, and thus the security of online payment is not high.

Summary of the invention

In response to the above-mentioned problems in the prior art, a transaction code generation method, device, system, and computer-readable storage medium, as well as a transaction code-based processing method and device are proposed, using this method, device, system, and computer-readable storage The medium can solve the above-mentioned problems.

The present invention provides the following solutions.

In a first aspect, a method for generating a transaction code is provided, including: receiving a transaction code application sent by a first terminal, the transaction code application carrying transaction information of the first terminal; generating a preset sequence according to the transaction code application and transaction code resources; The preset encryption algorithm encrypts the preset sequence to generate the target transaction code; and sends the target transaction code to the first terminal.

In a possible implementation manner, the method further includes: receiving a transaction code resource generated and sent by a target resource node, where the target resource node is any one of a plurality of resource nodes deployed in a distributed manner.

In a possible implementation manner, the transaction code resource includes: a region factor used to indicate the target resource node; an incremental sequence number maintained by the target resource node; a period factor used to indicate the transaction period of the transaction code resource; according to the period The key updated by the factor.

In a possible implementation manner, generating a preset sequence based on the transaction code application and the transaction code resource includes: determining the time factor according to the current local time; combining the regional factor, the time factor, the incremental sequence number, and the cycle factor into a unique preset sequence Set sequence.

In a possible implementation manner, the transaction code resource becomes invalid after the end of the transaction period indicated by the period factor.

In a possible implementation, the method further includes: before receiving the transaction code application sent by the first terminal, pre-receiving the transaction code resource generated and sent by the target resource node; and/or, in response to receiving the transaction code To apply, send a transaction code resource request to the target resource node, and receive the transaction code resource generated and sent by the target resource node.

In a possible implementation manner, encrypting a preset sequence according to a preset encryption algorithm to generate a target transaction code includes: determining a first partial sequence of the preset sequence, the first partial sequence including a regional factor, a time factor, and an increasing sequence The first N bits of the number, N is a positive integer; the first partial sequence is encrypted according to the key to obtain a random sequence; the second partial sequence of the preset sequence is determined, and the second partial sequence includes the (N+1 ) Bit to last bit and cycle factor; the target transaction code is formed according to the preset flag header, random sequence and the second partial sequence.

In a possible implementation manner, the method further includes: determining a target storage node among the plurality of storage nodes deployed in a distributed manner according to the second partial sequence, and storing the target transaction code and the transaction information of the first terminal in the target storage node.

In a possible implementation, if the transaction code application is a batch transaction code application, the method further includes: generating a preset sequence in batches according to the transaction code application and the transaction code resource, wherein the first N digits of the incremental sequence number contain instructions The preset position of the batch sequence number; the batch target transaction code is obtained according to the batch preset sequence, the batch target transaction code is sent to the first terminal, and the batch target transaction code is stored in the target storage node.

In a possible implementation manner, encrypting the preset sequence according to the preset encryption algorithm to generate the target transaction code includes: encrypting the preset sequence according to the encryption algorithm and the key to obtain the target transaction code.

In a possible implementation manner, it further includes: hashing the target transaction code, determining the target storage node among the multiple storage nodes deployed in a distributed manner according to the hashed value, and combining the target transaction code and the first The transaction information of a terminal is stored in the target storage node.

In a possible implementation manner, the encryption algorithm has a format-preserving encryption function, and the encryption algorithm is a symmetric encryption algorithm.

In a possible implementation, the target transaction code stored in the target storage node carries validity period information.

In a second aspect, a transaction code-based processing method is provided, including: receiving a query request sent by a second terminal, wherein the query request carries a target transaction code; determining transaction information of the first terminal according to the target transaction code, and combining the first terminal The transaction information is sent to the second terminal, so that the second terminal completes the transaction based on the transaction information of the first terminal; wherein the target transaction code is generated and sent to the first terminal using the method of the first aspect, and then the second terminal passes through the first terminal One terminal obtains.

In a third aspect, a transaction code generation device includes: a receiving unit for receiving a transaction code application sent by a first terminal, the transaction code application carrying transaction information of the first terminal; a sequence unit for applying and transacting according to the transaction code The code resource generates the preset sequence; the encryption unit is used to encrypt the preset sequence according to the preset encryption algorithm to generate the target transaction code; the sending unit is used to send the target transaction code to the first terminal.

In a possible implementation manner, the sequence unit is further used to receive the transaction code resource generated and sent by the target resource node, where the target resource node is any one of a plurality of resource nodes deployed in a distributed manner.

In a possible implementation, the transaction code resource includes: an area factor used to indicate the target resource node; an incremental sequence number maintained by the target resource node; a period factor used to indicate the transaction cycle of the transaction code resource; according to the period factor And the updated key.

In a possible implementation, the sequence unit is further used to: determine the time factor according to the current local time; combine the regional factor, the time factor, the incremental sequence number, and the periodic factor into a unique preset sequence.

In a possible implementation, the sequence unit is further used to: before receiving the transaction code application sent by the first terminal, pre-receive the transaction code resource generated and sent by the target resource node; and/or, in response to receiving the transaction code resource Transaction code application, sending a transaction code resource request to the target resource node, and receiving the transaction code resource generated and sent by the target resource node.

In a possible implementation, the encryption unit is further configured to: determine the first partial sequence of the preset sequence, the first partial sequence includes the area factor, the time factor, and the first N bits of the increasing sequence number, where N is a positive integer; Encrypt the first partial sequence to obtain a random sequence; determine the second partial sequence of the preset sequence, the second partial sequence includes the (N+1)th to the last bit of the increasing sequence number and the period factor; according to the preset flag header , The random sequence and the second part of the sequence constitute the target transaction code.

In a possible implementation manner, a storage unit is further included for: determining a target storage node among the plurality of storage nodes deployed in a distributed manner according to the second partial sequence, and storing the target transaction code and the transaction information of the first terminal Go to the target storage node.

In a possible implementation manner, if the transaction code application is a batch transaction code application, the device is also used to: generate a preset sequence in batches according to the transaction code application and transaction code resources, where the first N bits of the incremental sequence number include Indicate the preset position of the batch sequence number; obtain batch target transaction codes according to the batch preset sequence, send the batch target transaction codes to the first terminal, and store the batch target transaction codes in the target storage node.

In a possible implementation manner, the encryption unit is further configured to: perform encryption processing on the preset sequence according to the encryption algorithm and the key to obtain the target transaction code.

In a possible implementation, the storage unit is also used to: hash the target transaction code, determine the target storage node among the multiple storage nodes deployed in a distributed manner according to the hashed value, and combine the target transaction The code and the transaction information of the first terminal are stored in the target storage node.

In a fourth aspect, a transaction code-based processing device is provided, including: a query receiving unit for receiving a query request sent by a second terminal, wherein the query request carries a target transaction code; a transaction information sending unit for receiving a transaction code according to the target transaction code Determine the transaction information of the first terminal, and send the transaction information of the first terminal to the second terminal, so that the second terminal completes the transaction based on the transaction information of the first terminal; wherein, the target transaction code is generated and combined with the device of the second aspect. Sent to the first terminal, and then obtained by the second terminal through the first terminal.

In a fifth aspect, a transaction code generation system is provided, including: multiple transaction code generation nodes, multiple resource nodes, and multiple storage nodes that are distributedly deployed; wherein each transaction code generation node is used to execute the first aspect method.

In a sixth aspect, a transaction code generation device is provided, including: one or more multi-core processors; a memory for storing one or more programs; when one or more programs are executed by one or more multi-core processors, Make one or more multi-core processors realize: receive the transaction code application sent by the first terminal, the transaction code application carries the transaction information of the first terminal; generate the preset sequence according to the transaction code application and the transaction code resource; according to the preset encryption algorithm Encrypt the preset sequence to generate the target transaction code; send the target transaction code to the first terminal.

In a seventh aspect, a computer-readable storage medium is provided, and the computer-readable storage medium stores a program. When the program is executed by a multi-core processor, the multi-core processor is caused to execute the method as in the first aspect.

The above-mentioned at least one technical solution adopted in the embodiment of this application can achieve the following beneficial effects: In this embodiment, the encryption algorithm is adopted to ensure the randomness of the generated target transaction code, that is, it cannot be predicted based on the previously known transaction code. The next transaction code can expand the generation space of the target transaction code.

It should be understood that the above description is only an overview of the technical solution of the present invention, so that the technical means of the present invention can be understood more clearly, so that it can be implemented in accordance with the content of the description. In order to make the above and other objects, features and advantages of the present invention more obvious and understandable, the following examples illustrate the specific embodiments of the present invention.

Description of the drawings

By reading the detailed description of the exemplary embodiments below, those of ordinary skill in the art will understand the advantages and benefits described herein as well as other advantages and benefits. The drawings are only used for the purpose of illustrating exemplary embodiments, and are not considered as a limitation to the present invention. Moreover, the same reference numerals are used to denote the same components throughout the drawings. In the attached picture:

Figure 1 is an example of a transaction code in the prior art;

2 is a schematic flowchart of a method for generating a transaction code according to an embodiment of the present invention;

Fig. 3 is a schematic structural diagram of a transaction code generation system according to an embodiment of the present invention;

4 is a schematic diagram of the structure of a target transaction code according to an embodiment of the present invention;

5 is a schematic flowchart of a processing method based on transaction codes according to an embodiment of the present invention;

Fig. 6 is a schematic structural diagram of a transaction code generating device according to an embodiment of the present invention;

FIG. 7 is a schematic structural diagram of a processing device based on a transaction code according to an embodiment of the present invention;

Fig. 8 is a schematic structural diagram of a transaction code generating device according to another embodiment of the present invention.

In the drawings, the same or corresponding reference numerals indicate the same or corresponding parts.

Detailed ways

Hereinafter, exemplary embodiments of the present disclosure will be described in more detail with reference to the accompanying drawings. Although the drawings show exemplary embodiments of the present disclosure, it should be understood that the present disclosure can be implemented in various forms and should not be limited by the embodiments set forth herein. On the contrary, these embodiments are provided to enable a more thorough understanding of the present disclosure and to fully convey the scope of the present disclosure to those skilled in the art.

In the present invention, it should be understood that terms such as "including" or "having" are intended to indicate the existence of the features, numbers, steps, actions, components, parts, or combinations thereof disclosed in this specification, and are not intended to exclude one Or the possibility of the existence of multiple other features, numbers, steps, behaviors, components, parts or combinations thereof.

In addition, it should be noted that the embodiments of the present invention and the features in the embodiments can be combined with each other if there is no conflict. Hereinafter, the present invention will be described in detail with reference to the drawings and in conjunction with the embodiments.

The inventor proposes a transaction code generation method. When the user needs to show the transaction code to realize the transaction, the first terminal carried by the user can initiate the transaction code application, and receive the transaction code application sent by the first terminal. The transaction code application carries the first terminal Transaction information of a terminal; generate a preset sequence according to the transaction code application and transaction code resources; encrypt the preset sequence according to the preset encryption algorithm to generate a target transaction code; and then send the target transaction code to the first terminal. In this way, by encrypting the generated preset sequence with an encryption algorithm to generate the target transaction code, the randomness of the generated target transaction code can be ensured, and the generation space of the transaction code is expanded.

After introducing the basic principles of the present invention, various non-limiting embodiments of the present invention will be described in detail below.

FIG. 2 schematically shows a flow chart of a method 200 for generating a transaction code according to an embodiment of the present invention. It can be understood that in this process, from the perspective of the device, the execution subject may be one or more electronic devices; from the perspective of the program, the execution subject may correspondingly be the programs carried on these electronic devices.

FIG. 3 shows a schematic transaction code generation system 30, which includes a number of transaction code generation nodes 31, a number of resource nodes 32, and a number of storage nodes 33 that are distributedly deployed, wherein each transaction code generation node 31 has It can be used to perform the steps shown in Figure 2 independently. In this embodiment, any transaction code generating node 31 in FIG. 3 is used as the execution subject to describe steps 201 to S204 in FIG. 2, but it is not limited to this.

As shown in FIG. 2, the method 200 may include:

Step 201: Receive a transaction code application sent by a first terminal, where the transaction code application carries transaction information of the first terminal;

Among them, the first terminal may be a user terminal installed with a designated APP or plug-in. When the user needs to show a transaction code to a merchant terminal (such as a POS machine), it may be sent to the transaction code generation system through the APP or plug-in installed in the first terminal Transaction code application. The transaction information of the first terminal carried in the transaction code application may include user information, payment information, and risk control information of the first terminal, and the user information may include an IP address.

For example, as shown in FIG. 3, the transaction code generation node 31 that is most recently deployed in the transaction code generation system 30 can be determined according to the IP address of the first terminal carried in the transaction code application to receive the transaction code application sent by the first terminal. In the embodiment, the transaction code generation node using distributed deployment has the capability of horizontal expansion and contraction, avoiding the problem of limited ability of a single transaction code generation node.

As shown in FIG. 2, the method 200 may further include:

Step 202: Generate a preset sequence according to the transaction code application and the transaction code resource;

In some possible implementation manners, in order to obtain the transaction code resource in step 202, the method may further include: receiving the transaction code resource generated and sent by the target resource node, where the target resource node is a plurality of resources deployed in a distributed manner. Any one of the nodes.

As shown in FIG. 3, the transaction code generation system 30 includes several resource nodes 32 distributed in a distributed manner, and each resource node 32 can be used to independently generate and provide transaction code resources. For example, each resource node can independently manage one or more resource factors, such as incrementing serial numbers, regional factors, periodic factors, etc., and generate and provide transaction code resources based on the resource factors. Based on this, before or after receiving the transaction code application, fixed matching/or random matching/or matching to a certain resource node as a target resource node through a load balancing algorithm, and obtaining the transaction code resource provided by the resource node. Each resource node can be a data center or a device cluster, which is not specifically limited in this application.

In this embodiment, by using multiple distributed resource nodes to be responsible for the management and allocation of transaction code resources, it is possible to obtain transaction code resources with extremely low repeatability. And the distributed deployment of resource nodes has the ability to expand and shrink horizontally, avoiding the problem of limited capacity of a single resource node.

In some possible implementation manners, the method may further include: pre-receiving transaction code resources generated and sent by the target resource node; and/or, in response to receiving the transaction code request, sending a transaction code resource request to the target resource node, And receive the transaction code resource generated and sent by the target resource node.

Specifically, in one case, one or more transaction code resources may be obtained in advance from the target resource node passively, so as to quickly generate the target transaction code and return it to the user when a transaction code request is received. In another case, after receiving the transaction code request, if the transaction code resource is found to be insufficient, you can actively send the transaction code resource request to the target resource node to obtain the transaction code resource provided by the target resource node in real time to generate the target The transaction code is returned to the user.

In some possible implementations, the transaction code resource includes: a regional factor used to indicate the target resource node; an incremental sequence number maintained by the target resource node; a period factor used to indicate the transaction cycle of the transaction code resource; The updated key.

Specifically, the area factor can be determined according to the unique identifier of the target resource node. For example, as shown in FIG. 3, the multiple resource nodes 31 included in the transaction code generation system 30 have identifiers 1-9, respectively. If the resource node is the target resource node, the area factor A=3 can be determined. In the transaction code generation system 30 in FIG. 3, each of the multiple resource nodes independently maintains a set of incremental sequence numbers, and the incremental sequence numbers maintained between different resource nodes may be the same or different. In this embodiment The incremental sequence number carried in the transaction code resource comes from the target resource node, for example, the incremental sequence number C=123456789. The cycle factor is used to indicate the transaction cycle of the transaction code resource. For example, based on a certain initial time as a starting point, every ten days can be used as a cycle, and the cycle factor on the first day of each cycle is preset to be 1, the cycle factor on the second day is 2, and so on. In order to ensure sufficient transaction code resources, the target resource node can provide the transaction code resources required for the next day (for example, November 11, 2019) in advance. Specifically, it can be calculated that the distance between November 11, 2019 and a certain initial time (for example, 1970) The period factor is obtained by modulo 10. The period factor is D=1. For another example, it is also possible to use a certain initial time as the starting point and to use each week as a cycle, then the cycle factor can be determined according to Monday, Tuesday, ... Sunday, the cycle factor corresponding to Monday is 1, and the cycle factor corresponding to Monday is 2. And so on. The key is updated with the change of the cycle factor. The key used under each cycle factor is the same. To ensure randomness, the key used under each cycle factor can be replaced periodically.

In some possible implementations, the transaction code resource becomes invalid after the end of the transaction period indicated by the period factor. For example, when the transaction cycle indicated by the cycle factor carried in the acquired transaction code resource corresponds to November 11, 2019, the transaction code resource becomes invalid after the end of November 11, 2019.

In some possible implementation manners, this step 202 may further include: determining a time factor according to the current local time; combining the regional factor, the time factor, the incrementing sequence number, and the periodic factor into a unique preset sequence.

Specifically, the time factor is usually the distance in seconds between the current local time and a certain initial time. For example, the initial time may be zero o'clock of the day, etc. If the current local time when the target transaction code is generated is: November 11, 2019, 9:00: 00 seconds, calculate the number of seconds from 0: 00 on November 11, 2019 according to the current local time, and obtain the time factor B = 32400 .

For example, if the area factor A=3, the time factor B=32400, the increasing sequence number C=123456789, and the period factor D=1, then the above ABCD can be combined into a preset sequence: 3324001234567891. Since the combination of the above multiple factors is unique, the preset sequence is unique.

As shown in FIG. 2, the method 200 may further include:

Step 203: Perform encryption processing on the preset sequence according to the preset encryption algorithm to generate a target transaction code;

In some possible implementation manners, the encryption algorithm has a format-preserving encryption function, and is a symmetric encryption algorithm.

In some possible implementation manners, the above step 203 may further include: performing encryption processing on the preset sequence according to the encryption algorithm and the key to obtain the target transaction code. Wherein, the above-mentioned key is the key carried in the transaction code resource.

Specifically, the key is the key carried in the transaction code resource. For example, suppose that the area factor A=3, the time factor B=32400, the increasing sequence number C=123456789, and the period factor D=1 are combined into a preset sequence: 3324001234567891. Furthermore, the preset sequence: 3324001234567891 can be encrypted based on the key in the transaction code resource, and the target transaction code can be obtained in combination with the identification header (for example, 26).

In some possible implementation manners, the above step 203 may further include: determining the first partial sequence of the preset sequence, the first partial sequence includes the area factor, the time factor, and the first N bits of the increasing sequence number, where N is a positive integer; The key encrypts the first partial sequence to obtain a random sequence; determines the second partial sequence of the preset sequence, the second partial sequence includes the (N+1)th to the last bit of the increasing sequence number and the cycle factor; according to the preset flag The header, the random sequence, and the second part of the sequence constitute the target transaction code.

For example, as shown in Figure 4, suppose that the area factor A=3, the time factor B=32400, the increasing sequence number C=123456789, and the period factor D=1 are combined into a 16-bit preset sequence: 3324001234567891. Furthermore, the first 7-digit combination of the regional factor, the time factor and the increasing serial number can be used as the 13-digit first partial sequence: 3324001234567, and the first partial sequence is encrypted according to the key to obtain a 13-digit random sequence: 76285894725, according to The combination of the (N+1)th to the last digit of the increasing sequence number and the period factor is a 3-digit second partial sequence: 891. According to the preset flag header (26), the random sequence (7628589472567) and the second partial sequence (891), the target transaction code is formed as: 267628589472567891. It should be understood that the digits of the aforementioned flag header, area factor, time factor, increasing sequence, and period factor are preset empirical values according to practice, and can be adjusted accordingly according to actual needs.

As shown in FIG. 2, the method 200 may further include:

Step S204: Send the target transaction code to the first terminal.

Optionally, as shown in FIG. 3, the transaction code generation system 30 further includes a plurality of storage nodes 33 distributed in a distributed manner, which are used to store the target transaction code and the transaction information of the first terminal, so that other devices can obtain it through the first terminal. After the target transaction code, the transaction information of the matched first terminal can be obtained from the storage node based on the obtained target transaction code, and transaction verification can be performed.

In some possible implementations, if the target transaction code is obtained by encrypting the entire preset sequence based on the key in the transaction code resource, this step S204 may also include: hashing the target transaction code, according to The hashed value determines the target storage node among the multiple storage nodes deployed in a distributed manner, and stores the target transaction code and the transaction information of the first terminal in the target storage node. Through this implementation, after another device obtains the target transaction code through the first terminal, it can perform the same hash processing on the target transaction code, and based on the hashed value, it can be deployed on multiple storage nodes in a distributed manner. A target storage node for storing the target transaction code and the transaction information of the first terminal is found in, and then the transaction information of the first terminal can be obtained through verification and matching of the target transaction code.

In some possible implementations, if the target transaction code is composed according to a preset flag header, a random sequence, and a second partial sequence, the step S204 may further include: multiple stores deployed in a distributed manner according to the second partial sequence The target storage node is determined in the node, and the target transaction code and the transaction information of the first terminal are stored in the target storage node.

For example, as shown in Figure 4, the target transaction code composed of the preset flag header (26), the random sequence (7628589472567), and the second partial sequence (891) is: 267628589472567891. Then, the second partial sequence (891) can be used to determine the uniquely corresponding target storage node from the multiple storage nodes deployed in a distributed manner, and store the target transaction code and the transaction information of the first terminal in the target storage node. Through this implementation, after another device obtains the target transaction code through the first terminal, the second partial sequence (891) can be extracted from the target transaction code, and the second partial sequence (891) can be used in the distributed system according to the second partial sequence (891). The target storage node for storing the target transaction code and the transaction information of the first terminal is found among the deployed storage nodes, and the transaction information of the first terminal can be obtained through verification and matching of the target transaction code.

In some possible implementation manners, if the transaction code application is a batch transaction code application, step S204 may further include: generating a preset sequence in batches according to the transaction code application and the transaction code resource, where the first N bits of the incremental sequence number include Indicate the preset position of the batch sequence number; obtain batch target transaction codes according to the batch preset sequence, send the batch target transaction codes to the first terminal, and store the batch target transaction codes in the target storage node.

For example, if the transaction code application sent by the first terminal requests a batch application of 90 target transaction codes, for this type of batch transaction code application, a single transaction code resource can be used to generate multiple target transaction codes in batches, and the area factor, time factor, and increment The combination of sequence number and periodicity factor becomes a unique preset sequence. In the first N bits of the increasing sequence number (that is, in the increasing sequence number in the first part of the sequence), the first 2 bits of the increasing sequence number are split out to store the batch sequence according to requirements. The batch sequence includes, for example, 01, 02 ,...,90, used to indicate each of the batch target transaction codes separately, and the remaining numbers in the preset sequence remain the same. Based on the multiple preset sequences generated in batches by the above combination, further, the (N+1)th to the last position of the incremental sequence number and the cycle factor can also be determined as the second partial sequence; according to the second partial sequence in distributed deployment The target storage node is determined from the plurality of storage nodes, and the target transaction code and the transaction information of the first terminal are stored in the target storage node. Since multiple target transaction codes generated in batches have a completely consistent second partial sequence, the target transaction codes generated in batches can be stored in the same storage node.

In some possible implementations, the target transaction code stored in the target storage node carries validity period information. The target storage node executes the deletion operation when the stored target transaction code exceeds its validity period.

FIG. 5 shows a processing method 500 based on transaction codes, which is characterized in that it includes:

Step 501: Receive a query request sent by a second terminal, where the query request carries the target transaction code;

Specifically, the second terminal may be a merchant terminal installed with a designated APP or plug-in, for example, it may be a POS machine. The method shown in FIG. 2 can be used to generate the target transaction code and send it to the first terminal, and then the second terminal obtains the target transaction code through the first terminal. For example, the first terminal may convert the target transaction code into a graphic code, a two-dimensional code, etc. and display it on its screen, and then the second terminal scans the first terminal to obtain the target transaction code. After obtaining the target transaction code, the second terminal initiates a query request to the system, which is used to carry the target transaction code and request the system for transaction information of the first terminal corresponding to the target transaction code.

Step 502: Determine the transaction information of the first terminal according to the target transaction code, and send the transaction information of the first terminal to the second terminal, so that the second terminal completes the transaction based on the transaction information of the first terminal;

Specifically, after receiving the query request sent by the second terminal, according to the target transaction code and the storage rules of the transaction information of the first terminal, the target transaction code can be correspondingly found from the multiple storage nodes deployed in a distributed manner. The target storage node of the transaction information with the first terminal. For example, it is possible to perform preset hash processing on the target transaction code, and find the target storage node used to store the target transaction code and the transaction information of the first terminal among the multiple storage nodes deployed in a distributed manner according to the hashed value. Then, the transaction information of the first terminal can be obtained through verification and matching of the target transaction code. For another example, the second partial sequence can be extracted from the target transaction code, and the target storage node for storing the target transaction code and the transaction information of the first terminal can be found among the multiple storage nodes deployed in a distributed manner according to the second partial sequence. Then, the transaction information of the first terminal can be obtained through verification and matching of the target transaction code. In addition, the query request can carry usage information, and then the usage verification can be performed based on the usage information sent by the second terminal and the stored transaction information of the first terminal. If the usage verification result does not meet the preset, the transaction failure can be sent to the second terminal information.

Based on the same technical concept, the embodiment of the present invention also provides a transaction code generation system 30. FIG. 3 is a schematic structural diagram of a transaction code generation system 30 provided by an embodiment of the present invention. The transaction code generation system 30 includes a number of transaction code generation nodes 31, a number of resource nodes 32 and a number of storage nodes 33 that are distributedly deployed, and each transaction code generation node 31 can be used to independently execute the code shown in Figure 2 A step of.

Based on the same technical concept, an embodiment of the present invention also provides a transaction code generation device for executing the transaction code generation method provided in any of the foregoing embodiments. Fig. 6 is a schematic structural diagram of an apparatus provided by an embodiment of the present invention.

As shown in FIG. 6, the apparatus 600 includes:

The receiving unit 601 is configured to receive a transaction code application sent by the first terminal, where the transaction code application carries transaction information of the first terminal;

The sequence unit 602 is configured to generate a preset sequence according to the transaction code application and transaction code resources;

The encryption unit 603 is configured to perform encryption processing on the preset sequence according to the preset encryption algorithm to generate a target transaction code;

The sending unit 604 is configured to send the target transaction code to the first terminal.

In a possible implementation manner, the sequence unit 602 is further configured to receive transaction code resources generated and sent by a target resource node, where the target resource node is any one of a plurality of resource nodes deployed in a distributed manner.

In a possible implementation manner, the sequence unit 602 is further configured to: determine the time factor according to the current local time; combine the regional factor, the time factor, the incremental sequence number, and the periodic factor into a unique preset sequence.

In a possible implementation manner, the sequence unit 602 is further configured to: before receiving the transaction code application sent by the first terminal, pre-receive the transaction code resource generated and sent by the target resource node; and/or, in response to receiving To the transaction code application, send a transaction code resource request to the target resource node, and receive the transaction code resource generated and sent by the target resource node.

In a possible implementation, the encryption unit 603 is further configured to: determine the first partial sequence of the preset sequence, the first partial sequence includes the area factor, the time factor, and the first N bits of the increasing sequence number, where N is a positive integer; The key encrypts the first partial sequence to obtain a random sequence; determines the second partial sequence of the preset sequence, the second partial sequence includes the (N+1)th to the last bit of the increasing sequence number and the cycle factor; according to the preset flag The header, the random sequence, and the second part of the sequence constitute the target transaction code.

In a possible implementation, if the transaction code application is a batch transaction code application, the device is also used to: generate a preset sequence in batches according to the transaction code application and transaction code resources, where the first N bits of the incremental sequence number include Indicate the preset position of the batch sequence number; obtain batch target transaction codes according to the batch preset sequence, send the batch target transaction codes to the first terminal, and store the batch target transaction codes in the target storage node.

In a possible implementation manner, the storage unit is further configured to further include: hashing the target transaction code, determining the target storage node among the multiple storage nodes deployed in a distributed manner according to the hashed value, and The target transaction code and the transaction information of the first terminal are stored in the target storage node.

Based on the same technical concept, an embodiment of the present invention also provides a transaction code-based processing device for executing the transaction code-based processing method provided in any of the foregoing embodiments. FIG. 7 is a schematic structural diagram of a processing device 700 based on a transaction code provided by an embodiment of the present invention.

As shown in FIG. 7, the apparatus 700 includes:

The query receiving unit 701 is configured to receive a query request sent by the second terminal, where the query request carries a target transaction code;

The transaction information sending unit 702 is configured to determine the transaction information of the first terminal according to the target transaction code, and send the transaction information of the first terminal to the second terminal, so that the second terminal completes the transaction based on the transaction information of the first terminal;

Wherein, the target transaction code is generated by the device shown in FIG. 6 and sent to the first terminal, and then obtained by the second terminal through the first terminal.

It should be noted that the transaction code generation device and the transaction code-based processing device in the embodiments of the present application can respectively implement the processes of the foregoing transaction code generation method and transaction code-based processing method embodiments, and achieve the same effect and Function, I won’t go into details here.

FIG. 8 is a transaction code generation device according to an embodiment of the present application, which is used to execute the transaction code generation method shown in FIG. 2, and the device includes: at least one processor; and a memory communicatively connected with the at least one processor; The memory stores instructions that can be executed by at least one processor, and the instructions are executed by at least one processor, so that the at least one processor can execute:

Receive the transaction code application sent by the first terminal, the transaction code application carries the transaction information of the first terminal; generate the preset sequence according to the transaction code application and the transaction code resource; encrypt the preset sequence according to the preset encryption algorithm, and generate the target Transaction code: Send the target transaction code to the first terminal, and store the target transaction code and the transaction information of the first terminal.

According to some embodiments of the present application, a non-volatile computer storage medium of a method for generating a transaction code is provided, and computer-executable instructions are stored thereon, and the computer-executable instructions are set to be executed when run by a processor:

The various embodiments in this application are described in a progressive manner, and the same or similar parts between the various embodiments can be referred to each other, and each embodiment focuses on the differences from other embodiments. In particular, for the device, device, and computer-readable storage medium embodiments, since they are basically similar to the method embodiments, their descriptions are simplified, and for related parts, please refer to the part of the description of the method embodiments.

The apparatus, equipment, and computer-readable storage medium provided in the embodiments of the present application correspond to the method in a one-to-one manner. Therefore, the apparatus, equipment, and computer-readable storage medium also have beneficial technical effects similar to their corresponding methods. The beneficial technical effects of the method are described in detail, and therefore, the beneficial technical effects of the device, equipment and computer-readable storage medium are not repeated here.

Those skilled in the art should understand that the embodiments of the present invention can be provided as a method, a system, or a computer program product. Therefore, the present invention may adopt the form of a complete hardware embodiment, a complete software embodiment, or an embodiment combining software and hardware. Moreover, the present invention may adopt the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program codes.

The present invention is described with reference to flowcharts and/or block diagrams of methods, devices (systems), and computer program products according to embodiments of the present invention. It should be understood that each process and/or block in the flowchart and/or block diagram, and the combination of processes and/or blocks in the flowchart and/or block diagram can be realized by computer program instructions. These computer program instructions can be provided to the processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing equipment to generate a machine, so that the instructions executed by the processor of the computer or other programmable data processing equipment are used to generate It is a device that realizes the functions specified in one process or multiple processes in the flowchart and/or one block or multiple blocks in the block diagram.

These computer program instructions can also be stored in a computer-readable memory that can guide a computer or other programmable data processing equipment to work in a specific manner, so that the instructions stored in the computer-readable memory produce an article of manufacture including the instruction device. The device implements the functions specified in one process or multiple processes in the flowchart and/or one block or multiple blocks in the block diagram.

These computer program instructions can also be loaded on a computer or other programmable data processing equipment, so that a series of operation steps are executed on the computer or other programmable equipment to produce computer-implemented processing, so as to execute on the computer or other programmable equipment. The instructions provide steps for implementing the functions specified in one process or multiple processes in the flowchart and/or one block or multiple blocks in the block diagram.

In a typical configuration, the computing device includes one or more processors (CPUs), input/output interfaces, network interfaces, and memory.

The memory may include non-permanent memory in a computer-readable medium, random access memory (RAM) and/or non-volatile memory, such as read-only memory (ROM) or flash memory (flash RAM). Memory is an example of computer readable media.

Computer-readable media include permanent and non-permanent, removable and non-removable media, and information storage can be realized by any method or technology. The information can be computer-readable instructions, data structures, program modules, or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory or other memory technology, CD-ROM, digital versatile disc (DVD) or other optical storage, Magnetic cassettes, magnetic tape magnetic disk storage or other magnetic storage devices or any other non-transmission media can be used to store information that can be accessed by computing devices. In addition, although the operations of the method of the present invention are described in a specific order in the drawings, this does not require or imply that these operations must be performed in the specific order, or that all the operations shown must be performed to achieve the desired result. Additionally or alternatively, some steps may be omitted, multiple steps may be combined into one step for execution, and/or one step may be decomposed into multiple steps for execution.

Although the spirit and principle of the present invention have been described with reference to several specific embodiments, it should be understood that the present invention is not limited to the disclosed specific embodiments, and the division of various aspects does not mean that the features in these aspects cannot be combined for performance. Benefit, this division is only for the convenience of presentation. The present invention is intended to cover various modifications and equivalent arrangements included within the spirit and scope of the appended claims.

Claims

A method for generating transaction codes is characterized in that it comprises:

Receiving a transaction code application sent by a first terminal, the transaction code application carrying transaction information of the first terminal;

Generate a preset sequence according to the transaction code application and the transaction code resource;

Performing encryption processing on the preset sequence according to a preset encryption algorithm to generate a target transaction code;

Sending the target transaction code to the first terminal.
The method according to claim 1, further comprising:

Receive the transaction code resource generated and sent by a target resource node, where the target resource node is any one of a plurality of resource nodes deployed in a distributed manner.
The method according to claim 2, wherein the transaction code resource comprises: an area factor used to indicate the target resource node; an incremental sequence number maintained by the target resource node; used to indicate the transaction The cycle factor of the transaction cycle of the code resource; the key updated according to the cycle factor.
The method according to claim 3, wherein generating a preset sequence according to the transaction code application and the transaction code resource comprises:

Determine the time factor according to the current local time;

The area factor, the time factor, the increasing sequence number, and the period factor are combined into a unique preset sequence.
The method according to claim 3, wherein the transaction code resource becomes invalid after the transaction period indicated by the period factor ends.
The method according to claim 2, further comprising:

Before receiving the transaction code application sent by the first terminal, pre-receive the transaction code resource generated and sent by the target resource node; and/or,

In response to receiving the transaction code application, a transaction code resource request is sent to the target resource node, and the transaction code resource generated and sent by the target resource node is received.
The method according to claim 4, wherein the step of encrypting the preset sequence according to a preset encryption algorithm to generate a target transaction code comprises:

Determining a first partial sequence of the preset sequence, the first partial sequence including the area factor, the time factor, and the first N digits of the increasing sequence number, where N is a positive integer;

Performing encryption processing on the first partial sequence according to the key to obtain a random sequence;

Determining a second partial sequence of the preset sequence, the second partial sequence including the (N+1)th to the last position of the increasing sequence number and the period factor;

The target transaction code is formed according to the preset flag header, the random sequence, and the second partial sequence.
The method according to claim 7, further comprising:

According to the second partial sequence, a target storage node is determined among a plurality of storage nodes deployed in a distributed manner, and the target transaction code and transaction information of the first terminal are stored in the target storage node.
The method according to claim 8, wherein if the transaction code application is a batch transaction code application, the method further comprises:

Generating the preset sequence in batches according to the transaction code application and the transaction code resource, wherein the first N bits of the incremental sequence number include a preset bit for indicating a batch sequence number;

Obtain batches of target transaction codes according to the preset sequence of the batch, send the batches of target transaction codes to the first terminal, and store all the batches of target transaction codes in the target storage node.
The method according to claim 4, wherein the step of encrypting the preset sequence according to a preset encryption algorithm to generate a target transaction code comprises:

Encryption processing is performed on the preset sequence according to the encryption algorithm and the key to obtain the target transaction code.
The method according to claim 10, further comprising:

Perform hash processing on the target transaction code, determine the target storage node among the multiple storage nodes deployed in a distributed manner according to the hashed value, and combine the target transaction code with the transaction of the first terminal The information is stored in the target storage node.
The method according to claim 1, wherein the encryption algorithm has a format-preserving encryption function, and the encryption algorithm is a symmetric encryption algorithm.
The method according to claim 8 or 9 or 11, wherein the target transaction code stored in the target storage node carries validity period information.
A processing method based on transaction codes, which is characterized in that it includes:

Receiving a query request sent by the second terminal, wherein the query request carries the target transaction code;

Determine the transaction information of the first terminal according to the target transaction code, and send the transaction information of the first terminal to the second terminal, so that the second terminal completes the transaction based on the transaction information of the first terminal;

Wherein, the target transaction code is generated using the method according to any one of claims 1-13 and sent to the first terminal, and then obtained by the second terminal through the first terminal.
A transaction code generating device, which is characterized in that it comprises:

A receiving unit, configured to receive a transaction code application sent by a first terminal, the transaction code application carrying transaction information of the first terminal;

The sequence unit is used to generate a preset sequence according to the transaction code application and the transaction code resource;

The encryption unit is configured to perform encryption processing on the preset sequence according to a preset encryption algorithm to generate a target transaction code;

The sending unit is configured to send the target transaction code to the first terminal.
The device according to claim 15, wherein the sequence unit is further used for:

Receive the transaction code resource generated and sent by a target resource node, where the target resource node is any one of a plurality of resource nodes deployed in a distributed manner.
The device according to claim 16, wherein the transaction code resource comprises: an area factor used to indicate the target resource node; an incremental sequence number maintained by the target resource node; and used to indicate the transaction The cycle factor of the transaction cycle of the code resource; the key updated according to the cycle factor.
The device according to claim 17, wherein the sequence unit is further used for:

Determine the time factor according to the current local time;

The area factor, the time factor, the increasing sequence number, and the period factor are combined into a unique preset sequence.
The device according to claim 17, wherein the transaction code resource becomes invalid after the end of the transaction period indicated by the period factor.
The device according to claim 16, wherein the sequence unit is further used for:

Before receiving the transaction code application sent by the first terminal, pre-receive the transaction code resource generated and sent by the target resource node; and/or,

In response to receiving the transaction code application, a transaction code resource request is sent to the target resource node, and the transaction code resource generated and sent by the target resource node is received.
The device according to claim 18, wherein the encryption unit is further configured to:

Determining a first partial sequence of the preset sequence, the first partial sequence including the area factor, the time factor, and the first N digits of the increasing sequence number, where N is a positive integer;

Performing encryption processing on the first partial sequence according to the key to obtain a random sequence;

Determining a second partial sequence of the preset sequence, the second partial sequence including the (N+1)th to the last position of the increasing sequence number and the period factor;

The target transaction code is formed according to the preset flag header, the random sequence, and the second partial sequence.
The device according to claim 21, further comprising a storage unit for:

According to the second partial sequence, a target storage node is determined among a plurality of storage nodes deployed in a distributed manner, and the target transaction code and transaction information of the first terminal are stored in the target storage node.
The device according to claim 22, wherein if the transaction code application is a batch transaction code application, the device is further configured to:

Generating the preset sequence in batches according to the transaction code application and the transaction code resource, wherein the first N bits of the incremental sequence number include a preset bit for indicating a batch sequence number;

Obtain batches of target transaction codes according to the preset sequence of the batch, send the batches of target transaction codes to the first terminal, and store all the batches of target transaction codes in the target storage node.
The device according to claim 18, wherein the encryption unit is further configured to:

Encryption processing is performed on the preset sequence according to the encryption algorithm and the key to obtain the target transaction code.
The device according to claim 24, further comprising a storage unit for:

Perform hash processing on the target transaction code, determine the target storage node among the multiple storage nodes deployed in a distributed manner according to the hashed value, and combine the target transaction code with the transaction of the first terminal The information is stored in the target storage node.
The device according to claim 15, wherein the encryption algorithm has a format-preserving encryption function, and the encryption algorithm is a symmetric encryption algorithm.
The device according to claim 22 or 23 or 25, wherein the target transaction code stored in the target storage node carries validity period information.
A processing device based on transaction code, which is characterized in that it comprises:

The query receiving unit is configured to receive the query request sent by the second terminal, wherein the query request carries the target transaction code;

The transaction information sending unit is configured to determine the transaction information of the first terminal according to the target transaction code, and send the transaction information of the first terminal to the second terminal, so that the second terminal is based on the first terminal. The transaction information of the terminal completes the transaction;

Wherein, the target transaction code is generated by the device according to any one of claims 15-27 and sent to the first terminal, and then obtained by the second terminal through the first terminal.
A transaction code generation system, which is characterized by comprising: a plurality of transaction code generation nodes, a plurality of resource nodes, and a plurality of storage nodes that are distributedly deployed;

Wherein, each transaction code generating node is used to execute the method according to any one of claims 1-14.
A transaction code generating device, which is characterized in that it comprises:

One or more multi-core processors;

Memory, used to store one or more programs;

When the one or more programs are executed by the one or more multi-core processors, the one or more multi-core processors are caused to realize:

Receiving a transaction code application sent by a first terminal, the transaction code application carrying transaction information of the first terminal;

Generate a preset sequence according to the transaction code application and the transaction code resource;

Encrypting the preset sequence according to a preset encryption algorithm to generate a target transaction code;

Send the target transaction code to the first terminal, and store the target transaction code and transaction information of the first terminal.
A computer-readable storage medium, the computer-readable storage medium stores a program, and when the program is executed by a multi-core processor, the multi-core processor is caused to execute the process described in any one of claims 1-14 method.