CN111144872B - Transaction code generation and transaction code-based processing method, device and system - Google Patents
Transaction code generation and transaction code-based processing method, device and system Download PDFInfo
- Publication number
- CN111144872B CN111144872B CN201911377610.2A CN201911377610A CN111144872B CN 111144872 B CN111144872 B CN 111144872B CN 201911377610 A CN201911377610 A CN 201911377610A CN 111144872 B CN111144872 B CN 111144872B
- Authority
- CN
- China
- Prior art keywords
- transaction code
- target
- terminal
- transaction
- sequence
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000003672 processing method Methods 0.000 title claims description 9
- 238000000034 method Methods 0.000 claims abstract description 63
- 238000012545 processing Methods 0.000 claims abstract description 37
- 230000006870 function Effects 0.000 claims description 10
- 230000000737 periodic effect Effects 0.000 claims description 10
- 230000004044 response Effects 0.000 claims description 6
- 238000010586 diagram Methods 0.000 description 15
- 238000012795 verification Methods 0.000 description 8
- 238000004590 computer program Methods 0.000 description 7
- 230000008901 benefit Effects 0.000 description 5
- 230000009286 beneficial effect Effects 0.000 description 4
- 230000000694 effects Effects 0.000 description 4
- 230000008569 process Effects 0.000 description 4
- 230000008859 change Effects 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- PCTMTFRHKVHKIS-BMFZQQSSSA-N (1s,3r,4e,6e,8e,10e,12e,14e,16e,18s,19r,20r,21s,25r,27r,30r,31r,33s,35r,37s,38r)-3-[(2r,3s,4s,5s,6r)-4-amino-3,5-dihydroxy-6-methyloxan-2-yl]oxy-19,25,27,30,31,33,35,37-octahydroxy-18,20,21-trimethyl-23-oxo-22,39-dioxabicyclo[33.3.1]nonatriaconta-4,6,8,10 Chemical compound C1C=C2C[C@@H](OS(O)(=O)=O)CC[C@]2(C)[C@@H]2[C@@H]1[C@@H]1CC[C@H]([C@H](C)CCCC(C)C)[C@@]1(C)CC2.O[C@H]1[C@@H](N)[C@H](O)[C@@H](C)O[C@H]1O[C@H]1/C=C/C=C/C=C/C=C/C=C/C=C/C=C/[C@H](C)[C@@H](O)[C@@H](C)[C@H](C)OC(=O)C[C@H](O)C[C@H](O)CC[C@@H](O)[C@H](O)C[C@H](O)C[C@](O)(C[C@H](O)[C@H]2C(O)=O)O[C@H]2C1 PCTMTFRHKVHKIS-BMFZQQSSSA-N 0.000 description 1
- BQCADISMDOOEFD-UHFFFAOYSA-N Silver Chemical compound [Ag] BQCADISMDOOEFD-UHFFFAOYSA-N 0.000 description 1
- 238000013475 authorization Methods 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 230000008602 contraction Effects 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 239000003550 marker Substances 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000000750 progressive effect Effects 0.000 description 1
- 229910052709 silver Inorganic materials 0.000 description 1
- 239000004332 silver Substances 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
- 230000003442 weekly effect Effects 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q20/00—Payment architectures, schemes or protocols
- G06Q20/08—Payment architectures
- G06Q20/20—Point-of-sale [POS] network systems
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q20/00—Payment architectures, schemes or protocols
- G06Q20/38—Payment protocols; Details thereof
- G06Q20/382—Payment protocols; Details thereof insuring higher security of transaction
- G06Q20/3829—Payment protocols; Details thereof insuring higher security of transaction involving key management
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
- G06Q40/04—Trading; Exchange, e.g. stocks, commodities, derivatives or currency exchange
Landscapes
- Business, Economics & Management (AREA)
- Accounting & Taxation (AREA)
- Engineering & Computer Science (AREA)
- Finance (AREA)
- General Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- Physics & Mathematics (AREA)
- Strategic Management (AREA)
- Theoretical Computer Science (AREA)
- Development Economics (AREA)
- Economics (AREA)
- Marketing (AREA)
- Technology Law (AREA)
- Computer Security & Cryptography (AREA)
- Financial Or Insurance-Related Operations Such As Payment And Settlement (AREA)
Abstract
The invention provides a transaction code generation method, a transaction code-based processing device and a transaction code-based processing system, wherein the transaction code generation method comprises the following steps: receiving a transaction code application sent by a first terminal, wherein the transaction code application carries transaction information of the first terminal; generating 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; and sending the target transaction code to the first terminal. By using the method, the target transaction code with high randomness can be generated, and the generation space of the target transaction code is enlarged.
Description
Technical Field
The invention belongs to the technical field of computers, and particularly relates to a transaction code generation and transaction code-based processing method, device and system.
Background
This section is intended to provide a background or context to the embodiments of the invention that are recited in the claims. The description herein is not admitted to be prior art by inclusion in this section.
In the current transaction scenario, generally, a consumer terminal sends a payment request to a payment system, the payment system performs identity verification on the consumer terminal after receiving the payment request, generates a corresponding transaction code and sends the transaction code to the consumer terminal, the consumer terminal displays the received transaction code for a merchant terminal to scan, and then the merchant terminal transmits the transaction code obtained by scanning to the payment system for payment authorization.
In the prior art, a transaction code is generated by adopting a mode of randomly taking a value in a time sequence within a limited code space range, for example, as shown in fig. 1, the existing transaction code generally comprises 18-19 bits, wherein the first 2-3 bits are identification codes for indicating a code sending mechanism, for example, a silver-linked sign is 62, a payment bank sign is 28, a WeChat sign is 13 and the like, the last 16 bits are valid coding bits, wherein a 6-bit random number is generally taken, and a 10-bit self-increment number ensures uniqueness. Because of the huge concurrent quantity of the current online payment transactions, the method easily causes similar generated transaction codes and is easily imitated or improved in series, and further causes low online payment safety.
Disclosure of Invention
In order to solve the problems in the prior art, a method, a device, a system and a computer readable storage medium for generating transaction codes and a method and a device for processing transaction codes are provided.
The present invention provides the following.
In a first aspect, a transaction code generating method is provided, including: receiving a transaction code application sent by a first terminal, wherein the transaction code application carries transaction information of the first terminal; generating 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; and sending the target transaction code to the first terminal.
In one possible embodiment, the method further comprises: and receiving transaction code resources generated and transmitted by a target resource node, wherein the target resource node is any one of a plurality of resource nodes in distributed deployment.
In one possible implementation, the transaction code resource includes: a region factor for indicating a target resource node; an incremented sequence number maintained by the target resource node; a period factor for indicating a transaction period of the transaction code resource; a key updated according to the periodicity factor.
In one possible implementation, generating the preset sequence according to the transaction code application and the transaction code resource includes: determining a time factor according to the current local time; the region factor, the time factor, the increment sequence number, and the period factor are combined into a unique preset sequence.
In one possible implementation, the transaction code resource is deactivated after the transaction period indicated by the period factor ends.
In one possible embodiment, the method further comprises: the method comprises the steps that before a transaction code application sent by a first terminal is received, transaction code resources generated and sent by a target resource node are received in advance; and/or, in response to receiving the transaction code application, transmitting a transaction code resource request to the target resource node, and receiving the transaction code resource generated and transmitted by the target resource node.
In one possible implementation, the encrypting the preset sequence according to the preset encrypting algorithm to generate the target transaction code includes: determining a first partial sequence of a preset sequence, wherein the first partial sequence comprises a region factor, a time factor and the first N bits of an increasing sequence number, and N is a positive integer; encrypting the first partial sequence according to the secret key to obtain a random sequence; determining a second partial sequence of the preset sequence, wherein the second partial sequence comprises the (N+1) -th bit to the last bit of the increasing sequence number and a periodic factor; and forming a target transaction code according to the preset mark head, the random sequence and the second partial sequence.
In one possible embodiment, the method further comprises: and determining a target storage node in the plurality of storage nodes distributed according to the second partial sequence, and storing the target transaction code and the transaction information of the first terminal into the target storage node.
In one possible embodiment, 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 bits of the incremental serial number comprise preset bits for indicating batch serial numbers; and acquiring a batch of target transaction codes according to a batch of preset sequences, sending the batch of target transaction codes to the first terminal, and storing the batch of target transaction codes to a target storage node.
In one possible implementation, the encrypting the preset sequence according to the preset encrypting algorithm to generate the target transaction code includes: and carrying out encryption processing on the preset sequence according to the encryption algorithm and the secret key to obtain the target transaction code.
In one possible embodiment, the method further comprises: and carrying out hash processing on the target transaction code, determining a target storage node in a plurality of storage nodes distributed according to the value after the hash processing, and storing the target transaction code and the transaction information of the first terminal into the target storage node.
In one possible implementation, the encryption algorithm has a reserved format encryption function, and the encryption algorithm is a symmetric encryption algorithm.
In one possible implementation, the target transaction code stored to the target storage node carries expiration 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 sending the transaction information of the first terminal to the second terminal, so that the second terminal completes transaction based on the transaction information of the first terminal; wherein the target transaction code is generated and transmitted to the first terminal using the method as in the first aspect, and then obtained by the second terminal through the first terminal.
In a third aspect, a transaction code generation apparatus includes: the receiving unit is used for receiving a transaction code application sent by the first terminal, wherein the transaction code application carries transaction information of the first terminal; the sequence unit is used for generating a preset sequence according to the transaction code application and the transaction code resource; the encryption unit is used for carrying out encryption processing on the preset sequence according to a preset encryption algorithm to generate a target transaction code; and the sending unit is used for sending the target transaction code to the first terminal.
In a possible embodiment, the sequence unit is further configured to: and receiving transaction code resources generated and transmitted by a target resource node, wherein the target resource node is any one of a plurality of resource nodes in distributed deployment.
In one possible implementation, the transaction code resources include: a region factor for indicating a target resource node; an incremented sequence number maintained by the target resource node; a period factor for indicating a transaction period of the transaction code resource; a key updated according to the periodicity factor.
In a possible embodiment, the sequence unit is further configured to: determining a time factor according to the current local time; the region factor, the time factor, the increment sequence number, and the period factor are combined into a unique preset sequence.
In one possible implementation, the transaction code resource is deactivated after the transaction period indicated by the period factor ends.
In a possible embodiment, the sequence unit is further configured to: the method comprises the steps that before a transaction code application sent by a first terminal is received, transaction code resources generated and sent by a target resource node are received in advance; and/or, in response to receiving the transaction code application, transmitting a transaction code resource request to the target resource node, and receiving the transaction code resource generated and transmitted by the target resource node.
In a possible implementation, the encryption unit is further configured to: determining a first partial sequence of a preset sequence, wherein the first partial sequence comprises a region factor, a time factor and the first N bits of an increasing sequence number, and N is a positive integer; encrypting the first partial sequence according to the secret key to obtain a random sequence; determining a second partial sequence of the preset sequence, wherein the second partial sequence comprises the (N+1) -th bit to the last bit of the increasing sequence number and a periodic factor; and forming a target transaction code according to the preset mark head, the random sequence and the second partial sequence.
In a possible embodiment, the device further comprises a storage unit for: and determining a target storage node in the plurality of storage nodes distributed according to the second partial sequence, and storing the target transaction code and the transaction information of the first terminal into the target storage node.
In one possible embodiment, if the transaction code application is a batch transaction code application, the apparatus is further configured to: generating a preset sequence in batches according to the transaction code application and the transaction code resource, wherein the first N bits of the incremental serial number comprise preset bits for indicating batch serial numbers; and acquiring a batch of target transaction codes according to a batch of preset sequences, sending the batch of target transaction codes to the first terminal, and storing the batch of target transaction codes to a target storage node.
In a possible implementation, the encryption unit is further configured to: and carrying out encryption processing on the preset sequence according to the encryption algorithm and the secret key to obtain the target transaction code.
In a possible implementation, the memory unit is further configured to: and carrying out hash processing on the target transaction code, determining a target storage node in a plurality of storage nodes distributed according to the value after the hash processing, and storing the target transaction code and the transaction information of the first terminal into the target storage node.
In one possible implementation, the encryption algorithm has a reserved format encryption function, and the encryption algorithm is a symmetric encryption algorithm.
In one possible implementation, the target transaction code stored to the target storage node carries expiration information.
In a fourth aspect, a transaction code-based processing apparatus is provided, including: the inquiry receiving unit is used for receiving an inquiry request sent by the second terminal, wherein the inquiry request carries a target transaction code; the transaction information sending unit is used for determining the transaction information of the first terminal according to the target transaction code and sending the transaction information of the first terminal to the second terminal so that the second terminal can complete the transaction based on the transaction information of the first terminal; wherein the target transaction code is generated and transmitted to the first terminal using the apparatus as in the second aspect and then obtained by the second terminal through the first terminal.
In a fifth aspect, there is provided a transaction code generation system including: a plurality of transaction code generating nodes, a plurality of resource nodes and a plurality of storage nodes which are distributed; wherein each transaction code generation node is configured to perform the method of the first aspect.
In a sixth aspect, there is provided a transaction code generation apparatus including: one or more multi-core processors; a memory for storing one or more programs; when executed by one or more multi-core processors, cause the one or more multi-core processors to implement: receiving a transaction code application sent by a first terminal, wherein the transaction code application carries transaction information of the first terminal; generating 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; and sending the target transaction code to the first terminal.
In a seventh aspect, there is provided a computer readable storage medium storing a program which, when executed by a multi-core processor, causes the multi-core processor to perform a method as in the first aspect.
The above at least one technical scheme adopted by the embodiment of the application can achieve the following beneficial effects: in this embodiment, by adopting the encryption algorithm, randomness of the generated target transaction code is ensured, that is, the next transaction code cannot be predicted based on the previously known transaction code, and the generation space of the target transaction code can be enlarged.
It should be understood that the foregoing description is only an overview of the technical solutions of the present invention, so that the technical means of the present invention may be more clearly understood and implemented in accordance with the content of the specification. The following specific embodiments of the present invention are described in order to make the above and other objects, features and advantages of the present invention more comprehensible.
Drawings
The advantages and benefits described herein, as well as other advantages and benefits, will become apparent to those of ordinary skill in the art upon reading the following detailed description of the exemplary embodiments. The drawings are only for purposes of illustrating exemplary embodiments and are not to be construed as limiting the invention. Also, like reference numerals are used to designate like parts throughout the figures. In the drawings:
FIG. 1 is an example of a transaction code in the prior art;
FIG. 2 is a flow chart of a transaction code generation method according to an embodiment of the invention;
FIG. 3 is a schematic diagram of a transaction code generation system according to an embodiment of the invention;
FIG. 4 is a schematic diagram of a target transaction code according to an embodiment of the invention;
FIG. 5 is a flow chart of a transaction code based processing method according to an embodiment of the invention;
FIG. 6 is a schematic diagram of a transaction code generating device according to an embodiment of the invention;
FIG. 7 is a schematic diagram of a transaction code based processing device according to an embodiment of the invention;
fig. 8 is a schematic diagram of a transaction code generating device according to another embodiment of the invention.
In the drawings, the same or corresponding reference numerals indicate the same or corresponding parts.
Detailed Description
Exemplary embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. While exemplary embodiments of the present disclosure are shown in the drawings, it should be understood that the present disclosure may be embodied in various forms and should not be limited to the embodiments set forth herein. Rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the disclosure to those skilled in the art.
In the present invention, it should be understood that terms such as "comprises" or "comprising," etc., are intended to indicate the presence of features, numbers, steps, acts, components, portions, or combinations thereof disclosed in the specification, and are not intended to exclude the possibility of the presence of one or more other features, numbers, steps, acts, components, portions, or combinations thereof.
In addition, it should be noted that, without conflict, the embodiments of the present invention and the features of the embodiments may be combined with each other. The invention will be described in detail below with reference to the drawings in connection with embodiments.
The inventor provides a transaction code generation method, when a user needs to show a transaction code to realize transaction, a first terminal carried by the user can initiate a transaction code application, the transaction code application sent by the first terminal is received, and the transaction code application carries transaction information of the first terminal; generating 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; and further the target transaction code may be transmitted to the first terminal. Thus, the target transaction code is generated by encrypting the generated preset sequence through the encryption algorithm, so that the randomness of the generated target transaction code can be ensured, and the generation space of the transaction code is enlarged.
Having described the basic principles of the present invention, various non-limiting embodiments of the invention are described in detail below.
Fig. 2 schematically shows a flow diagram of a transaction code generation method 200 according to an embodiment of the invention. It will be appreciated that in this flow, from a device perspective, the executing subject may be one or more electronic devices; from the program perspective, the execution subject may be a program mounted on these electronic devices, accordingly.
Fig. 3 shows an exemplary transaction code generation system 30 comprising a distributed deployment of a number of transaction code generation nodes 31, a number of resource nodes 32 and a number of storage nodes 33, wherein each transaction code generation node 31 may be used to independently perform the steps shown in fig. 2. The present embodiment describes steps 201 to S204 in fig. 2 with any one of the transaction code generation nodes 31 in fig. 3 as an execution subject, but is not limited thereto.
As shown in fig. 2, the method 200 may include:
Step 201, receiving a transaction code application sent by a first terminal, wherein the transaction code application carries transaction information of the first terminal;
The first terminal may be a user terminal provided with a designated APP or plug-in, and when a user needs to present a transaction code to a merchant terminal (for example, a POS machine), the user may send a transaction code application to the transaction code generation system through the APP or plug-in provided with the first terminal. The transaction information of the first terminal carried by the transaction code application can comprise user information, payment information, wind control information and the like of the first terminal, and the user information can comprise an IP address.
For example, as shown in fig. 3, the nearest transaction code generation node 31 may be deployed in the transaction code generation system 30 according to the IP address of the first terminal carried in the transaction code application, so as to receive the transaction code application sent by the first terminal.
As shown in fig. 2, the method 200 may further include:
Step 202, generating a preset sequence according to a transaction code application and a transaction code resource;
In some possible embodiments, to obtain the transaction code resource in step 202, the method may further include: and receiving transaction code resources generated and transmitted by a target resource node, wherein the target resource node is any one of a plurality of resource nodes in distributed deployment.
As shown in fig. 3, the transaction code generation system 30 includes a distributed deployment of several resource nodes 32, each resource node 32 being operable to independently generate and provide transaction code resources. For example, where each resource node may independently manage one or more resource factors, such as: increment sequence numbers, region factors, period 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, a certain resource node may be fixedly matched and/or randomly matched and/or matched through a load balancing algorithm as a target resource node, and the transaction code resource provided by the resource node may be acquired. Each resource node may be a data center or a device cluster, which is not particularly limited in the present application.
In the present embodiment, the management and allocation of the transaction code resources are performed by using a plurality of resource nodes distributed and disposed, whereby the transaction code resources having extremely low repeatability can be obtained. And the distributed deployed resource nodes have the capability of transverse expansion and contraction, so that the problem of limited capacity of a single resource node is avoided.
In some possible embodiments, the method may further comprise: receiving transaction code resources generated and transmitted by a target resource node in advance; and/or, in response to receiving the transaction code application, transmitting a transaction code resource request to the target resource node, and receiving the transaction code resource generated and transmitted by the target resource node.
Specifically, in one case, one or more transaction code resources may be passively pre-acquired from the target resource node in order to quickly generate and return the target transaction code to the user upon receipt of a transaction code request. In another case, after receiving the transaction code request, if the transaction code resource is found to be insufficient, the transaction code resource request may be actively sent to the target resource node, so as to acquire the transaction code resource provided by the target resource node in real time, so as to generate the target transaction code and return the target transaction code to the user.
In some possible implementations, the transaction code resources include: a region factor for indicating a target resource node; an incremented sequence number maintained by the target resource node; a period factor for indicating a transaction period of the transaction code resource; a key updated according to the periodicity factor.
Specifically, the area factor may be determined according to a unique identifier of the target resource node, for example, as shown in fig. 3, the plurality of resource nodes 31 included in the transaction code generation system 30 have identifiers 1 to 9, respectively, where it is assumed that the resource node having the identifier 3 therein is the target resource node, and the area factor a=3 may be determined. In the transaction code generation system 30 in fig. 3, each of the plurality of resource nodes independently maintains a set of incremental sequence numbers, which may or may not be the same, and in this embodiment, the incremental sequence numbers carried in the transaction code resources are from the target resource node, for example, the incremental sequence number c=123456789. The period factor is used to indicate a trading period of the trading code resource. For example, the cycle factor of the first day in each cycle may be preset to be 1, the cycle factor of the second day to be 2, and so on every ten days as a cycle based on a certain initial time as a start point. To ensure that the transaction code resource is sufficient, the target resource node may provide in advance the transaction code resource required for the next day (for example, 11/2019), and may calculate the cycle factor, for example, the cycle factor d=1, by calculating the number of days modulo 10 that is a distance of 11/2019 from some initial time (for example, 1/1970). For example, the cycle factor may be determined by weekly cycles based on an initial time, by monday, friday, … days, by 1 for monday, 2 for monday, and so on. The secret key is updated along with the change of the periodic factors, the secret key adopted under each periodic factor is the same, and the secret key adopted under each periodic factor can be replaced periodically to ensure randomness.
In some possible implementations, the transaction code resources are invalidated after the transaction period indicated by the period factor ends. For example, when the transaction period indicated by the period factor carried in the obtained transaction code resource corresponds to 11.11.2019, the transaction code resource is invalidated after 11.11.2019 ends.
In some possible embodiments, the step 202 may further include: determining a time factor according to the current local time; the region factor, the time factor, the increment sequence number, and the period factor are combined into a unique preset sequence.
In particular, the time factor is typically taken as a distance in seconds of the current local time from some initial time. For example, the initial time may be a zero point of the day, or the like. If the current local time for generating the target transaction code is: the current local time is calculated from the current local time by the time of 2019, 11, 9 minutes, 00 seconds, and the time factor b=32400.
For example, if the region factor a=3, the time factor b=32400, the increment sequence number c=123456789, and the period factor d=1, the ABCD may be combined into a preset sequence: 3324001234567891. since the combination of the above factors has uniqueness, the preset sequence has uniqueness.
As shown in fig. 2, the method 200 may further include:
step 203, carrying out encryption processing on a preset sequence according to a preset encryption algorithm to generate a target transaction code;
in some possible embodiments, the encryption algorithm has a reserved format encryption function and is a symmetric encryption algorithm.
In some possible embodiments, the step 203 may further include: and carrying out encryption processing on the preset sequence according to the encryption algorithm and the secret key to obtain the target transaction code. The key is a key carried in the transaction code resource.
Specifically, the key is a key carried in the transaction code resource. For example, assume that the sequence number c=123456789 is incremented by the region factor a=3, the time factor b=32400, and the period factor d=1 is combined into a preset sequence: 3324001234567891. and then the preset sequence can be based on the key pair in the transaction code resource: 3324001234567891, and combining the identification head (such as 26) to obtain the target transaction code.
In some possible embodiments, the step 203 may further include: determining a first partial sequence of a preset sequence, wherein the first partial sequence comprises a region factor, a time factor and the first N bits of an increasing sequence number, and N is a positive integer; encrypting the first partial sequence according to the secret key to obtain a random sequence; determining a second partial sequence of the preset sequence, wherein the second partial sequence comprises the (N+1) -th bit to the last bit of the increasing sequence number and a periodic factor; and forming a target transaction code according to the preset mark head, the random sequence and the second partial sequence.
For example, as shown in fig. 4, assume that the sequence number c=123456789 is incremented by the region factor a=3, the time factor b=32400, and the period factor d=1 is combined into a preset sequence of 16 bits: 3324001234567891. the first 7 digits of the incremented sequence number may then be combined by the region factor, the time factor, as a first partial sequence of 13 digits: 3324001234567, performing reserved format encryption processing on the first partial sequence according to the key to obtain a 13-bit random sequence: 76285894725, a second partial sequence of 3 bits combined according to the (n+1) -th bit to the last bit of the incremented sequence number: 891. the target transaction code is formed according to the preset mark head (26), the random sequence (7628589472567) and the second partial sequence (891) and is as follows: 267628589472567891. it should be understood that the bit numbers of the above-mentioned marker head, the region factor, the time factor, the increment sequence and the period factor are empirical values preset according to practice, and can be adjusted accordingly according to actual requirements.
As shown in fig. 2, the method 200 may further include:
Step S204, a target transaction code is sent to the first terminal.
Optionally, as shown in fig. 3, the transaction code generating system 30 further includes a plurality of storage nodes 33 configured in a distributed manner, for storing the target transaction code and the transaction information of the first terminal, so that after other devices acquire the target transaction code through the first terminal, the transaction information of the matched first terminal can be acquired from the storage nodes based on the acquired target transaction code, and transaction verification can be performed.
In some possible embodiments, if the target transaction code is obtained by encrypting the whole preset sequence based on the key in the transaction code resource, the step S204 may further include: and carrying out hash processing on the target transaction code, determining a target storage node in a plurality of storage nodes distributed according to the value after the hash processing, and storing the target transaction code and the transaction information of the first terminal into the target storage node. According to the embodiment, after the target transaction code is acquired by the other device through the first terminal, the same hash processing can be performed on the target transaction code, the target storage node for storing the target transaction code and the transaction information of the first terminal is found out from the plurality of storage nodes in the distributed arrangement according to the value after the hash processing, and further the transaction information of the first terminal can be acquired through verification and matching of the target transaction code.
In some possible embodiments, if the target transaction code is composed of a preset flag, a random sequence, and a second partial sequence, the step S204 may further include: and determining a target storage node in the plurality of storage nodes distributed according to the second partial sequence, and storing the target transaction code and the transaction information of the first terminal into the target storage node.
For example, as shown in fig. 4, the target transaction code composed according to the preset flag head (26), the random sequence (7628589472567) and the second partial sequence (891) is: 267628589472567891. a unique corresponding target storage node may be determined from the plurality of storage nodes of the distributed deployment using the second partial sequence (891) and the target transaction code and the transaction information of the first terminal are stored to the target storage node. According to the implementation mode, after the target transaction code is acquired by another device through the first terminal, the second partial sequence (891) can be extracted from the target transaction code, a target storage node for storing the target transaction code and the transaction information of the first terminal is found out from a plurality of storage nodes distributed according to the second partial sequence (891), and further the transaction information of the first terminal can be acquired through verification and matching of the target transaction code.
In some possible embodiments, 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, wherein the first N bits of the incremental serial number comprise preset bits for indicating batch serial numbers; and acquiring a batch of target transaction codes according to a batch of preset sequences, sending the batch of target transaction codes to the first terminal, and storing the batch of target transaction codes to a target storage node.
For example, if the transaction code application request sent by the first terminal applies for 90 target transaction codes in batches, for the batch transaction code application, a plurality of target transaction codes may be generated in batches by using a single transaction code resource, and the region factor, the time factor, the increment sequence number and the period factor are combined into a unique preset sequence. In the first N bits of the increment sequence number (i.e., the increment sequence number in the first partial sequence), the first 2 bits of the increment sequence number are split according to the requirement to store a batch sequence, where the batch sequence includes, for example, 01, 02, …,90, for respectively indicating each of the batch target transaction codes, and the remaining digits in the preset sequence remain consistent. Based on the plurality of preset sequences generated in batch by the combination, further, the (n+1) -th bit to the last bit of the increment sequence number and the periodic factor can be determined as a second partial sequence; and determining a target storage node in the plurality of storage nodes distributed according to the second partial sequence, and storing the target transaction code and the transaction information of the first terminal into the target storage node. Because the plurality of target transaction codes generated in batch have the completely identical second partial sequence, the target transaction codes generated in batch can be stored in the same storage node.
In some possible implementations, the target transaction code stored to the target storage node carries expiration information. The target storage node performs a delete operation when the stored target transaction code exceeds its expiration date.
Fig. 5 illustrates a transaction code-based processing method 500, which includes:
step 501: receiving a query request sent by a second terminal, wherein the query request carries a target transaction code;
Specifically, the second terminal may be a merchant terminal installed with a designated APP or plug-in, such as a POS machine. The target transaction code may be generated and transmitted to the first terminal using the method illustrated in fig. 2, 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, or the like and display the graphic code, the two-dimensional code, or the like on a screen thereof, and then the second terminal scans the first terminal to obtain the target transaction code. And the second terminal initiates a query request to the system after acquiring the target transaction code, and is used for carrying the target transaction code to request the system for the transaction information of the first terminal corresponding to the target transaction code.
Step 502: determining transaction information of the first terminal according to the target transaction code, and sending the transaction information of the first terminal to the second terminal, so that the second terminal completes transaction based on the transaction information of the first terminal;
Specifically, after receiving the query request sent by the second terminal, the target storage node storing the target transaction code and the transaction information of the first terminal can be correspondingly found from the plurality of storage nodes distributed and deployed according to the storage rules of the target transaction code and the transaction information of the first terminal. For example, a preset hash process may be performed on the target transaction code, and a target storage node for storing the target transaction code and the transaction information of the first terminal may be found in a plurality of storage nodes disposed in a distributed manner according to the value after the hash process, so that the transaction information of the first terminal may be obtained through verification and matching of the target transaction code. For another example, the second partial sequence may be extracted from the target transaction code, and a target storage node for storing the target transaction code and the transaction information of the first terminal may be found in the plurality of storage nodes distributed according to the second partial sequence, so that the transaction information of the first terminal may be obtained through verification and matching of the target transaction code. In addition, the query request can carry application information, further application verification can be performed according to the application information sent by the second terminal and the stored transaction information of the first terminal, and if the application verification result does not accord with the preset, the transaction failure information can be sent to the second terminal.
Based on the same technical concept, the embodiment of the invention also provides a transaction code generation system 30. Fig. 3 is a schematic structural diagram of a transaction code generating system 30 according to an embodiment of the present invention. The transaction code generation system 30 includes a plurality of transaction code generation nodes 31, a plurality of resource nodes 32 and a plurality of storage nodes 33 distributed therein, wherein each transaction code generation node 31 is operable to independently perform the steps illustrated in fig. 2.
Based on the same technical concept, the embodiment of the invention also provides a transaction code generation device, which is used for executing the transaction code generation method provided by any embodiment. Fig. 6 is a schematic structural diagram of a device according to an embodiment of the present invention.
As shown in fig. 6, the apparatus 600 includes:
a receiving unit 601, configured to receive a transaction code application sent by a first terminal, where the transaction code application carries transaction information of the first terminal;
A sequence unit 602, configured to generate a preset sequence according to the transaction code application and the transaction code resource;
an encryption unit 603, configured to encrypt the preset sequence according to a preset encryption algorithm, and generate a target transaction code;
a transmitting unit 604, configured to transmit the target transaction code to the first terminal.
In a possible implementation, the sequence unit 602 is further configured to: and receiving transaction code resources generated and transmitted by a target resource node, wherein the target resource node is any one of a plurality of resource nodes in distributed deployment.
In one possible implementation, the transaction code resources include: a region factor for indicating a target resource node; an incremented sequence number maintained by the target resource node; a period factor for indicating a transaction period of the transaction code resource; a key updated according to the periodicity factor.
In a possible implementation, the sequence unit 602 is further configured to: determining a time factor according to the current local time; the region factor, the time factor, the increment sequence number, and the period factor are combined into a unique preset sequence.
In one possible implementation, the transaction code resource is deactivated after the transaction period indicated by the period factor ends.
In a possible implementation, the sequence unit 602 is further configured to: the method comprises the steps that before a transaction code application sent by a first terminal is received, transaction code resources generated and sent by a target resource node are received in advance; and/or, in response to receiving the transaction code application, transmitting a transaction code resource request to the target resource node, and receiving the transaction code resource generated and transmitted by the target resource node.
In a possible implementation, the encryption unit 603 is further configured to: determining a first partial sequence of a preset sequence, wherein the first partial sequence comprises a region factor, a time factor and the first N bits of an increasing sequence number, and N is a positive integer; encrypting the first partial sequence according to the secret key to obtain a random sequence; determining a second partial sequence of the preset sequence, wherein the second partial sequence comprises the (N+1) -th bit to the last bit of the increasing sequence number and a periodic factor; and forming a target transaction code according to the preset mark head, the random sequence and the second partial sequence.
In a possible embodiment, the device further comprises a storage unit for: and determining a target storage node in the plurality of storage nodes distributed according to the second partial sequence, and storing the target transaction code and the transaction information of the first terminal into the target storage node.
In one possible embodiment, if the transaction code application is a batch transaction code application, the apparatus is further configured to: generating a preset sequence in batches according to the transaction code application and the transaction code resource, wherein the first N bits of the incremental serial number comprise preset bits for indicating batch serial numbers; and acquiring a batch of target transaction codes according to a batch of preset sequences, sending the batch of target transaction codes to the first terminal, and storing the batch of target transaction codes to a target storage node.
In one possible implementation, the encrypting the preset sequence according to the preset encrypting algorithm to generate the target transaction code includes: and carrying out encryption processing on the preset sequence according to the encryption algorithm and the secret key to obtain the target transaction code.
In a possible implementation manner, the storage unit is further configured to further include: and carrying out hash processing on the target transaction code, determining a target storage node in a plurality of storage nodes distributed according to the value after the hash processing, and storing the target transaction code and the transaction information of the first terminal into the target storage node.
In one possible implementation, the encryption algorithm has a reserved format encryption function, and the encryption algorithm is a symmetric encryption algorithm.
In one possible implementation, the target transaction code stored to the target storage node carries expiration information.
Based on the same technical concept, the embodiment of the invention also provides a processing device based on the transaction code, which is used for executing the processing method based on the transaction code provided by any embodiment. Fig. 7 is a schematic structural diagram of a processing device 700 based on transaction codes according to an embodiment of the present invention.
As shown in fig. 7, the apparatus 700 includes:
a query receiving unit 701, configured to receive a query request sent by a second terminal, where the query request carries a target transaction code;
The transaction information sending unit 702 is configured to determine 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 a transaction based on the transaction information of the first terminal;
Wherein the target transaction code is generated and transmitted to the first terminal using the apparatus as shown in fig. 6, and then obtained by the second terminal through the first terminal.
It should be noted that, the transaction code generating device and the transaction code-based processing device in the embodiments of the present application may implement the processes of the embodiments of the foregoing transaction code generating method and the transaction code-based processing method, and achieve the same effects and functions, which are not described herein.
Fig. 8 is a transaction code generation apparatus for performing the transaction code generation method shown in fig. 2 according to an embodiment of the present application, the apparatus including: at least one processor; and a memory communicatively coupled to the at least one processor; wherein the memory stores instructions executable by the at least one processor, the instructions being executable by the at least one processor to enable the at least one processor to perform:
Receiving a transaction code application sent by a first terminal, wherein the transaction code application carries transaction information of the first terminal; generating 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; and sending the target transaction code to the first terminal, and storing the target transaction code and the transaction information of the first terminal.
According to some embodiments of the present application, there is provided a non-transitory computer storage medium having stored thereon computer executable instructions configured to, when executed by a processor, perform:
Receiving a transaction code application sent by a first terminal, wherein the transaction code application carries transaction information of the first terminal; generating 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; and sending the target transaction code to the first terminal, and storing the target transaction code and the transaction information of the first terminal.
The embodiments of the present application are described in a progressive manner, and the same and similar parts of the embodiments are all referred to each other, and each embodiment is mainly described in the differences from the other embodiments. In particular, for apparatus, devices and computer readable storage medium embodiments, the description thereof is simplified as it is substantially similar to the method embodiments, as relevant points may be found in part in the description of the method embodiments.
The apparatus, the device, and the computer readable storage medium provided in the embodiments of the present application are in one-to-one correspondence with the methods, so that the apparatus, the device, and the computer readable storage medium also have similar beneficial technical effects as the corresponding methods, and since the beneficial technical effects of the methods have been described in detail above, the beneficial technical effects of the apparatus, the device, and the computer readable storage medium are not repeated herein.
It will be appreciated by those skilled in the art that embodiments of the present invention may be provided as a method, system, or computer program product. Accordingly, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present invention may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present invention is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the invention. It will be understood that each flow and/or block of the flowchart illustrations and/or block diagrams, and combinations of flows and/or blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
In one typical configuration, a computing device includes one or more processors (CPUs), input/output interfaces, network interfaces, and memory.
The memory may include volatile memory in a computer-readable medium, random Access Memory (RAM) and/or nonvolatile memory, such as Read Only Memory (ROM) or flash memory (flash RAM). Memory is an example of computer-readable media.
Computer readable media, including both non-transitory and non-transitory, removable and non-removable media, may implement information storage by any method or technology. The information may be computer readable instructions, data structures, modules of a program, or other data. Examples of storage media for a computer 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, compact disc read only memory (CD-ROM), digital Versatile Discs (DVD) or other optical storage, magnetic cassettes, magnetic tape magnetic disk storage or other magnetic storage devices, or any other non-transmission medium, which can be used to store information that can be accessed by a computing device. Furthermore, although the operations of the methods of the present invention are depicted in the drawings in a particular order, this is not required or suggested that these operations must be performed in this particular order or that all of the illustrated operations must be performed in order to achieve desirable results. Additionally or alternatively, certain steps may be omitted, multiple steps combined into one step to perform, and/or one step decomposed into multiple steps to perform.
While the spirit and principles of the present invention have been described with reference to several particular embodiments, it is to be understood that the invention is not limited to the disclosed embodiments nor does it imply that features of the various aspects are not useful in combination, nor are they useful in any combination, such as for convenience of description. The invention is intended to cover various modifications and equivalent arrangements included within the spirit and scope of the appended claims.
Claims (31)
1.A transaction code generation method, comprising:
Receiving a transaction code application sent by a first terminal, wherein the transaction code application carries transaction information of the first terminal;
generating 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; the target transaction code is determined based on a first partial sequence and a second partial sequence of the preset sequence, wherein the first partial sequence comprises a region factor, a time factor and the first N bits of an increasing sequence number, N is a positive integer, and the second partial sequence comprises the (n+1) -th bit of the increasing sequence number, the last bit and a period factor;
And sending the target transaction code to the first terminal.
2. The method as recited in claim 1, further comprising:
The transaction code resource generated and transmitted by a target resource node is received, wherein the target resource node is any one of a plurality of resource nodes in distributed deployment.
3. The method of claim 2, wherein the transaction code resource comprises: a region factor for indicating the target resource node; an incremented sequence number maintained by the target resource node; a period factor for indicating a transaction period of the transaction code resource; a key updated according to the periodicity factor.
4. The method of claim 3, wherein generating a predetermined sequence from the transaction code application and the transaction code resource comprises:
Determining a time factor according to the current local time;
and combining the region factor, the time factor, the increment sequence number and the period factor into a unique preset sequence.
5. A method according to claim 3, wherein the transaction code resource is deactivated after the transaction period indicated by the period factor has ended.
6. The method as recited in claim 2, further comprising:
the method comprises the steps that before a transaction code application sent by a first terminal is received, transaction code resources which are generated and sent by a target resource node are received in advance; and/or the number of the groups of groups,
And in response to receiving the 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.
7. The method of claim 4, wherein encrypting the predetermined sequence according to a predetermined encryption algorithm to generate the target transaction code comprises:
Determining a first partial sequence of the preset sequence, wherein the first partial sequence comprises the regional factor, the time factor and the first N bits of the incremental sequence number, and N is a positive integer;
Encrypting the first partial sequence according to the secret key to obtain a random sequence;
Determining a second partial sequence of the preset sequence, wherein the second partial sequence comprises the (N+1) -th bit to the last bit of the incremental sequence number and the periodic factor;
And forming the target transaction code according to the preset mark head, the random sequence and the second partial sequence.
8. The method as recited in claim 7, further comprising:
and determining a target storage node in a plurality of storage nodes distributed according to the second partial sequence, and storing the target transaction code and the transaction information of the first terminal into the target storage node.
9. The method of claim 8, wherein if the transaction code application is a bulk 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 serial number comprise preset bits for indicating batch serial numbers;
And acquiring a batch of target transaction codes according to the preset sequence of the batch, sending the batch of target transaction codes to the first terminal, and storing the batch of target transaction codes to the target storage node.
10. The method of claim 4, wherein encrypting the predetermined sequence according to a predetermined encryption algorithm to generate the target transaction code comprises:
And carrying out encryption processing on the preset sequence according to an encryption algorithm and the secret key to obtain the target transaction code.
11. The method as recited in claim 10, further comprising:
And carrying out hash processing on the target transaction code, determining a target storage node in a plurality of storage nodes distributed according to the value after the hash processing, and storing the target transaction code and the transaction information of the first terminal into the target storage node.
12. The method of claim 1, wherein the encryption algorithm has a reserved format encryption function, and wherein the encryption algorithm is a symmetric encryption algorithm.
13. The method of claim 8 or 9 or 11, wherein the target transaction code stored to the target storage node carries expiration information.
14. A transaction code-based processing method, comprising:
Receiving a query request sent by a second terminal, wherein the query request carries a target transaction code;
determining transaction information of a first terminal according to the target transaction code, and sending the transaction information of the first terminal to the second terminal, so that the second terminal completes transaction based on the transaction information of the first terminal;
wherein the target transaction code is generated and transmitted to the first terminal using the method of any one of claims 1-13, and then obtained by the second terminal through the first terminal.
15. A transaction code generation device, comprising:
the receiving unit is used for receiving a transaction code application sent by a first terminal, wherein the transaction code application carries transaction information of the first terminal;
The sequence unit is used for generating a preset sequence according to the transaction code application and the transaction code resource;
The encryption unit is used for carrying out encryption processing on the preset sequence according to a preset encryption algorithm to generate a target transaction code; the target transaction code is determined based on a first partial sequence and a second partial sequence of the preset sequence, wherein the first partial sequence comprises a region factor, a time factor and the first N bits of an increasing sequence number, N is a positive integer, and the second partial sequence comprises the (n+1) -th bit of the increasing sequence number, the last bit and a period factor;
and the sending unit is used for sending the target transaction code to the first terminal.
16. The apparatus of claim 15, wherein the sequence unit is further configured to:
The transaction code resource generated and transmitted by a target resource node is received, wherein the target resource node is any one of a plurality of resource nodes in distributed deployment.
17. The apparatus of claim 16, wherein the transaction code resources comprise: a region factor for indicating the target resource node; an incremented sequence number maintained by the target resource node; a period factor for indicating a transaction period of the transaction code resource; a key updated according to the periodicity factor.
18. The apparatus of claim 17, wherein the sequence unit is further configured to:
Determining a time factor according to the current local time;
and combining the region factor, the time factor, the increment sequence number and the period factor into a unique preset sequence.
19. The apparatus of claim 17, wherein the transaction code resource is deactivated after a transaction period indicated by the periodicity factor is over.
20. The apparatus of claim 16, wherein the sequence unit is further configured to:
the method comprises the steps that before a transaction code application sent by a first terminal is received, transaction code resources which are generated and sent by a target resource node are received in advance; and/or the number of the groups of groups,
And in response to receiving the 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.
21. The apparatus of claim 18, wherein the encryption unit is further configured to:
Determining a first partial sequence of the preset sequence, wherein the first partial sequence comprises the regional factor, the time factor and the first N bits of the incremental sequence number, and N is a positive integer;
Encrypting the first partial sequence according to the secret key to obtain a random sequence;
Determining a second partial sequence of the preset sequence, wherein the second partial sequence comprises the (N+1) -th bit to the last bit of the incremental sequence number and the periodic factor;
And forming the target transaction code according to the preset mark head, the random sequence and the second partial sequence.
22. The apparatus of claim 21, further comprising a storage unit configured to:
and determining a target storage node in a plurality of storage nodes distributed according to the second partial sequence, and storing the target transaction code and the transaction information of the first terminal into the target storage node.
23. The apparatus of claim 22, wherein if the transaction code application is a bulk transaction code application, the apparatus 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 serial number comprise preset bits for indicating batch serial numbers;
And acquiring a batch of target transaction codes according to the preset sequence of the batch, sending the batch of target transaction codes to the first terminal, and storing the batch of target transaction codes to the target storage node.
24. The apparatus of claim 18, wherein the encryption unit is further configured to:
And carrying out encryption processing on the preset sequence according to an encryption algorithm and the secret key to obtain the target transaction code.
25. The apparatus of claim 24, further comprising a storage unit configured to:
And carrying out hash processing on the target transaction code, determining a target storage node in a plurality of storage nodes distributed according to the value after the hash processing, and storing the target transaction code and the transaction information of the first terminal into the target storage node.
26. The apparatus of claim 15, wherein the encryption algorithm is a reserved format encryption algorithm, and wherein the encryption algorithm is a symmetric encryption algorithm.
27. The apparatus of claim 22, 23 or 25, wherein the target transaction code stored to the target storage node carries expiration information.
28. A transaction code-based processing device, comprising:
The inquiry receiving unit is used for receiving an inquiry request sent by the second terminal, wherein the inquiry request carries a target transaction code;
The transaction information sending unit is used for determining the transaction information of the first terminal according to the target transaction code and sending the transaction information of the first terminal to the second terminal so that the second terminal can complete the transaction based on the transaction information of the first terminal;
wherein the target transaction code is generated and transmitted to the first terminal using the apparatus of any of claims 15-27, and then obtained by the second terminal through the first terminal.
29. A transaction code generation system, comprising: a plurality of transaction code generating nodes, a plurality of resource nodes and a plurality of storage nodes which are distributed;
Wherein each of the transaction code generation nodes is configured to perform the method of any of claims 1-13.
30. A transaction code generation device, comprising:
One or more multi-core processors;
A memory for storing one or more programs;
the one or more programs, when executed by the one or more multi-core processors, cause the one or more multi-core processors to implement:
Receiving a transaction code application sent by a first terminal, wherein the transaction code application carries transaction information of the first terminal;
generating 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; the target transaction code is determined based on a first partial sequence and a second partial sequence of the preset sequence, wherein the first partial sequence comprises a region factor, a time factor and the first N bits of an increasing sequence number, N is a positive integer, and the second partial sequence comprises the (n+1) -th bit of the increasing sequence number, the last bit and a period factor;
And sending the target transaction code to the first terminal, and storing the target transaction code and the transaction information of the first terminal.
31. A computer readable storage medium storing a program which, when executed by a multi-core processor, causes the multi-core processor to perform the method of any of claims 1-14.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911377610.2A CN111144872B (en) | 2019-12-27 | 2019-12-27 | Transaction code generation and transaction code-based processing method, device and system |
| PCT/CN2020/109082 WO2021128871A1 (en) | 2019-12-27 | 2020-08-14 | Transaction code generation method, apparatus and system, and method, apparatus and system for processing based on transaction code |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911377610.2A CN111144872B (en) | 2019-12-27 | 2019-12-27 | Transaction code generation and transaction code-based processing method, device and system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111144872A CN111144872A (en) | 2020-05-12 |
| CN111144872B true CN111144872B (en) | 2024-04-26 |
Family
ID=70520979
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911377610.2A Active CN111144872B (en) | 2019-12-27 | 2019-12-27 | Transaction code generation and transaction code-based processing method, device and system |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN111144872B (en) |
| WO (1) | WO2021128871A1 (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111144872B (en) * | 2019-12-27 | 2024-04-26 | 中国银联股份有限公司 | Transaction code generation and transaction code-based processing method, device and system |
| CN113011980B (en) * | 2021-03-30 | 2023-02-17 | 建信金融科技有限责任公司 | Transaction code request routing method and device of distributed transaction system |
| CN113191901B (en) * | 2021-05-17 | 2024-04-26 | 中国建设银行股份有限公司 | Transaction service processing method, device, equipment and storage medium |
| CN113094736A (en) * | 2021-06-04 | 2021-07-09 | 工业信息安全(四川)创新中心有限公司 | Identity card number encryption method, identity card number decryption method, identity card number encryption system and identity card number decryption system |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103401689A (en) * | 2013-08-22 | 2013-11-20 | 赵忠华 | Positional information based dynamic token and encryption method thereof |
| CN106855974A (en) * | 2015-12-09 | 2017-06-16 | 华为技术有限公司 | A kind of method of mobile payment and device |
| CN110322237A (en) * | 2019-05-23 | 2019-10-11 | 平安银行股份有限公司 | A kind of method, apparatus and storage medium generating transaction code |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20130013502A1 (en) * | 2011-07-07 | 2013-01-10 | Bank Of America Corporation | Facilitation of Transactions Using a Transaction Code |
| CN104574047A (en) * | 2015-01-21 | 2015-04-29 | 孙国华 | Financial IC card payment platform based on Internet |
| CN107657441B (en) * | 2017-09-15 | 2021-04-13 | 深圳怡化电脑股份有限公司 | Self-service transaction method, system, server and mobile terminal |
| US20190139022A1 (en) * | 2017-11-07 | 2019-05-09 | Mezu, Inc. | Currency transfer platform receiver device |
| CN111144872B (en) * | 2019-12-27 | 2024-04-26 | 中国银联股份有限公司 | Transaction code generation and transaction code-based processing method, device and system |
-
2019
- 2019-12-27 CN CN201911377610.2A patent/CN111144872B/en active Active
-
2020
- 2020-08-14 WO PCT/CN2020/109082 patent/WO2021128871A1/en active Application Filing
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103401689A (en) * | 2013-08-22 | 2013-11-20 | 赵忠华 | Positional information based dynamic token and encryption method thereof |
| CN106855974A (en) * | 2015-12-09 | 2017-06-16 | 华为技术有限公司 | A kind of method of mobile payment and device |
| CN110322237A (en) * | 2019-05-23 | 2019-10-11 | 平安银行股份有限公司 | A kind of method, apparatus and storage medium generating transaction code |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2021128871A1 (en) | 2021-07-01 |
| CN111144872A (en) | 2020-05-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111144872B (en) | Transaction code generation and transaction code-based processing method, device and system | |
| CN110599173B (en) | Block chain consensus node determination method, device, equipment and storage medium | |
| CN109635573B (en) | Data distributed encryption and decryption system, method, device, electronic equipment and medium | |
| CN109409472B (en) | Two-dimensional code generation method, data processing device and server | |
| CN110009349B (en) | Method and device for generating and verifying linkable ring signature in block chain | |
| CN104052742A (en) | Internet of things communication protocol capable of being encrypted dynamically | |
| CN108596627B (en) | Big data calculation method and system based on block chain and fog calculation | |
| CN111597567B (en) | Data processing method, data processing device, node equipment and storage medium | |
| CN111224786A (en) | Block chain-based data security sharing method, device and medium | |
| CN109981586B (en) | Node marking method and device | |
| CN114127724A (en) | Integrity audit for multi-copy storage | |
| CN110855441A (en) | Method, device and equipment for authenticating electronic identity and storage medium | |
| CN111669434A (en) | Method, system, device and equipment for establishing communication group | |
| CN114710504A (en) | Rotation method of common nodes in block chain system, nodes and block chain system | |
| CN112580114B (en) | Information processing method, device, equipment and storage medium | |
| CN115705601A (en) | Data processing method and device, computer equipment and storage medium | |
| US20200313891A1 (en) | Generating a plurality of one time tokens | |
| CN112150158B (en) | Block chain transaction delivery verification method and device | |
| CN114124469B (en) | Data processing method, device and equipment | |
| CN111784338A (en) | Information processing method, device, system and storage medium | |
| WO2017058967A1 (en) | Code signing service | |
| CN115426106A (en) | Identity authentication method, device, system, electronic equipment and storage medium | |
| CN111935059B (en) | Processing method, device and system for equipment identification | |
| Vijayakumaran | An introduction to bitcoin | |
| CN112862488A (en) | Data signature method and device, electronic equipment and computer readable storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |