Transaction processing method and apparatus based on chaotic mapping

Abstract

The present application relates to the field of financial technology, and provides a transaction processing method and device based on chaotic mapping. The method comprises the following steps: receiving a transaction request sent by a client, generating first plaintext information according to the transaction request and anti-replay attack information; encrypting the first plaintext information by using a chaotic mapping encryption algorithm to obtain first encrypted information, and sending the first encrypted information to the client; receiving second encrypted information sent by the client; transforming the first plaintext information by using a hash algorithm to obtain real second plaintext information; decrypting the second encrypted information by using the chaotic mapping encryption algorithm to obtain to-be-verified second plaintext information, wherein the driving value of the chaotic mapping in the chaotic mapping encryption algorithm is a first key of the client; comparing the to-be-verified second plaintext information with the real second plaintext information, and if they are the same, responding to the transaction request. The present application can improve the transaction verification efficiency, save the operation resources, and reduce the difficulty of key management.

Description

Technical Field

[0001] This article relates to the field of financial technology, and in particular to a transaction processing method and apparatus based on chaotic mapping. Background Technology

[0002] In existing technologies, the client (e.g., a USB key) acts as a mobile digital certificate, storing a bank customer's personal digital certificate and the bank's public key, but it is not readable. Similarly, the bank also records this customer's digital certificate. When a bank customer attempts to conduct an online transaction through the client, the bank server sends the client an encrypted string A' obtained by encrypting transaction information A using the client's public key. The client first decrypts the encrypted string A' using the customer's personal digital certificate, then performs an irreversible operation on the decrypted data to obtain string B, and finally encrypts string B using the bank server's public key to obtain encrypted string B', which is then sent to the bank server. The bank server receives encrypted string B', decrypts it using its private key to obtain string B, and simultaneously performs the same irreversible operation on the transaction information. If the decrypted string B matches the bank server's irreversible operation result, the customer is considered legitimate, and the transaction is completed; otherwise, it is considered illegitimate, and the transaction fails.

[0003] The encryption scheme currently used in the client is asymmetric encryption technology. Both the client and the server need to store their own private keys and the other party's public keys. Furthermore, during the transaction verification process, the client and the server need to perform two asymmetric encryption and decryption processes. Therefore, there are problems such as low computational efficiency and easy waste of resources.

[0004] In existing technologies, symmetric encryption algorithms still exist in client-server transaction verification methods. Existing symmetric encryption algorithms require both parties to exchange keys before communication, and a new key needs to be used for each communication, causing the number of keys to grow exponentially, which is not conducive to key management. Summary of the Invention

[0005] This paper addresses the problems of complex asymmetric key management, low computational efficiency, and resource waste in the transaction verification process between the client and server using asymmetric keys in existing technologies, as well as the problems of complex key management and resource waste when using symmetric keys.

[0006] To address the aforementioned technical issues, this paper provides a transaction processing method based on chaotic mapping, applied to the server side. The server side stores the client's first key, including:

[0007] Receive transaction requests sent by clients and generate first plaintext information based on the transaction requests and anti-replay attack information;

[0008] The first plaintext information is encrypted using a chaotic mapping encryption algorithm to obtain the first encrypted information, and the first encrypted information is sent to the client. In the chaotic mapping encryption algorithm, the driving value of the chaotic mapping is the first key of the client.

[0009] The client receives a second encrypted message, which is obtained by encrypting the second plaintext message using the chaotic mapping encryption algorithm. The second plaintext message is obtained by transforming the plaintext message obtained by decrypting the first encrypted message using the chaotic mapping encryption algorithm.

[0010] The first plaintext information is transformed using a hash algorithm to obtain the true second plaintext information;

[0011] The second encrypted information is decrypted using the chaotic mapping encryption algorithm to obtain the second plaintext information to be verified;

[0012] Compare the second plaintext information to be verified with the real second plaintext information; if they are the same, respond to the transaction request.

[0013] Wherein, the first plaintext information, the second plaintext information, the first encrypted information, and the second encrypted information are N-bit number sequences.

[0014] In a further embodiment of this paper, generating the first plaintext information based on the transaction request and anti-replay attack information includes:

[0015] Generate the first string based on the time string, address string, transaction information string, and anti-replay attack string of the transaction request;

[0016] Perform a number sequence conversion on the first string to obtain N bits of first plaintext information.

[0017] In a further embodiment of this paper, the execution process of the chaotic mapping encryption algorithm includes:

[0018] The first key of the client is used to drive the chaotic mapping to obtain an N-bit chaotic number sequence;

[0019] The second object is obtained by XORing the N-bit chaotic number sequence with the first object.

[0020] Wherein, when the first object is plaintext information, the chaotic mapping encryption algorithm performs an encryption process, and the second object is encrypted information;

[0021] When the first object is encrypted information, the chaotic mapping encryption algorithm performs a decryption process; when the second object is plaintext information.

[0022] In a further embodiment of this paper, the chaotic mapping is driven by the first key of the client to obtain an N-bit chaotic number sequence, including:

[0023] The first key of the client is used to drive the chaotic mapping to obtain the first original chaotic sequence;

[0024] The last N bits of the first original chaotic sequence are standardized to obtain an N-bit chaotic number sequence.

[0025] In a further embodiment of this paper, the chaotic mapping is driven by the first key of the client to obtain an N-bit chaotic number sequence, including:

[0026] The first key of the client, stored locally, is used to drive the chaotic mapping to obtain the first original chaotic sequence;

[0027] The data after the first preposition in the first original chaotic sequence is standardized and segmented to obtain multiple sets of N-bit chaotic digital subsequences;

[0028] XORing multiple N-bit chaotic number subsequences yields an N-bit chaotic number sequence.

[0029] In a further embodiment of this article, the server also stores a second key of the client;

[0030] The execution process of the chaotic mapping encryption algorithm includes:

[0031] The first key of the client is used to drive the chaotic mapping to obtain the first chaotic digital sequence;

[0032] The number of blocks for the first object and the original number of bits for each block are determined based on the client's second key;

[0033] The first object is grouped according to the number of groups and the original number of bits in each group, resulting in multiple first groups;

[0034] Multiple first groups are obtained by padding and XORing multiple first groups according to a preset rule using the first chaotic digital full sequence, wherein the number of data bits in the second group is N;

[0035] Data extraction is performed on the corresponding second group using the original number of bits in each first group;

[0036] The data extracted from each group are concatenated to obtain the second object;

[0037] Wherein, when the first object is plaintext information, the chaotic mapping encryption algorithm performs an encryption process, and the second object is encrypted information;

[0038] When the first object is encrypted information, the chaotic mapping encryption algorithm performs a decryption process; when the second object is plaintext information.

[0039] In a further embodiment of this document, determining the number of blocks for the first object and the original number of bits for each block based on the client's second key includes:

[0040] The second key of the client is used to drive the chaotic mapping to obtain the second chaotic digital full sequence;

[0041] The data in the second chaotic digital sequence are amplified and modulo-processed to obtain a chaotic integer sequence;

[0042] The first object is grouped using the data after the second preposition in the chaotic integer sequence to obtain the number of groups and the original number of bits in each group.

[0043] In a further embodiment of this paper, multiple second groups are obtained by using the first chaotic digital full sequence to perform padding and XOR processing on multiple first groups according to preset rules, including:

[0044] The data in the first chaotic number sequence are sequentially filled into each first group to obtain the updated first group. The number of data bits in each updated first group is N.

[0045] The remaining first chaotic number sequence after the completion process is sequentially divided into multiple chaotic number subsequences, and the number of data bits in each chaotic number subsequence is N.

[0046] Each chaotic number subsequence is XORed with each updated first group to obtain multiple second groups.

[0047] In a further embodiment of this article, N equals 2 n , where n is greater than or equal to 7.

[0048] The second aspect of this paper provides a transaction processing method based on chaotic mapping, applied to a client, wherein the client stores a first key and the same chaotic mapping encryption algorithm as the server, including:

[0049] Receive the first encrypted message sent by the server;

[0050] The first encrypted information is decrypted using the chaotic mapping encryption algorithm to obtain the first plaintext information, wherein the driving value of the chaotic mapping in the chaotic mapping encryption algorithm is the first key of the client;

[0051] The first plaintext information is transformed using a hash algorithm to obtain the second plaintext information;

[0052] The second plaintext information is encrypted using a chaotic mapping encryption algorithm to obtain the second encrypted information;

[0053] Send the second encrypted message to the server.

[0054] The third aspect of this paper provides a transaction processing device based on chaotic mapping, applied to a server, wherein the server stores a first key of the client, including:

[0055] The first interaction unit is used to receive transaction requests sent by the client and generate first plaintext information based on the transaction request and anti-replay attack information.

[0056] An encryption unit is used to encrypt the first plaintext information using a chaotic mapping encryption algorithm to obtain the first encrypted information, and send the first encrypted information to the client, wherein the driving value of the chaotic mapping in the chaotic mapping encryption algorithm is the first key of the client.

[0057] The second interaction unit is used to receive the second encrypted information sent by the client. The second encrypted information is obtained by the client encrypting the second plaintext information using the chaotic mapping encryption algorithm. The second plaintext information is obtained by the client decrypting the first encrypted information using the chaotic mapping encryption algorithm and transforming the plaintext information.

[0058] The transformation unit is used to transform the first plaintext information using a hash algorithm to obtain the real second plaintext information;

[0059] The decryption unit is used to decrypt the second encrypted information using the chaotic mapping encryption algorithm to obtain the second plaintext information to be verified.

[0060] The comparison unit is used to compare the second plaintext information to be verified with the real second plaintext information. If they are the same, a transaction request is responded to.

[0061] Wherein, the first plaintext information, the second plaintext information, the first encrypted information, and the second encrypted information are N-bit number sequences.

[0062] The fourth aspect of this document provides a transaction processing device based on chaotic mapping, applied to a client, wherein the client stores a first key and the same chaotic mapping encryption algorithm as the server, including:

[0063] The first interaction unit is used to receive the first encrypted information sent by the server.

[0064] The decryption unit is used to decrypt the first encrypted information using the chaotic mapping encryption algorithm to obtain the first plaintext information, wherein the driving value of the chaotic mapping in the chaotic mapping encryption algorithm is the first key of the client.

[0065] The transformation unit is used to transform the first plaintext information using a hash algorithm to obtain the second plaintext information;

[0066] The encryption unit is used to encrypt the second plaintext information using a chaotic mapping encryption algorithm to obtain the second encrypted information;

[0067] The second interaction unit is used to send the second encrypted information to the server.

[0068] A fifth aspect of this document provides a computer device including a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the computer program to implement the method described in any of the foregoing embodiments.

[0069] A sixth aspect of this document provides a computer storage medium having a computer program stored thereon, which, when run by a processor of a computer device, executes instructions for the method according to any of the foregoing embodiments.

[0070] A sixth aspect of this document provides a computer program product comprising a computer program that, when executed by a processor, implements the method described in any of the foregoing embodiments.

[0071] This paper applies chaotic mapping to a client-server transaction verification scenario, allowing both the client and server to store only the client's initial key. Encryption and decryption can then be achieved using this initial key to drive the chaotic sequence generated by the chaotic mapping, offering the advantage of simple verification. Furthermore, the chaotic mapping model is simple, and the encryption algorithm based on chaotic mapping belongs to the symmetric encryption algorithm system, resulting in higher computational efficiency compared to asymmetric encryption algorithms. Therefore, this paper also boasts advantages in high computational efficiency and resource conservation. Simultaneously, based on the initial value sensitivity of chaotic mapping, this paper can provide at least 10... 30 The key space is much larger than that of existing authentication clients. 80 With a small key space, the first key of the chaotic mapping can be used as the customer's identification information, requiring only a small amount of storage space. The first key is the initial value of the chaotic mapping, and there is no need to generate a new key for each encryption. Therefore, there is no key management problem in traditional symmetric encryption algorithms.

[0072] To make the above and other objects, features and advantages of this document more apparent and understandable, preferred embodiments are described below in detail with reference to the accompanying drawings. Attached Figure Description

[0073] To more clearly illustrate the technical solutions in the embodiments or prior art described herein, the accompanying drawings used in the description of the embodiments or prior art will be briefly introduced below. Obviously, the accompanying drawings described below are only some embodiments of this article. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0074] Figure 1 The diagram shows the structure of the transaction processing system based on chaotic mapping in the embodiments of this paper;

[0075] Figure 2 The interactive flowchart of the transaction processing system based on chaotic mapping in the embodiments of this paper is shown;

[0076] Figure 3 A flowchart illustrating the transaction processing method based on chaotic mapping applied to the server in the embodiments of this paper is shown.

[0077] Figure 4 The first flowchart of the chaotic mapping encryption algorithm in the embodiments of this paper is shown;

[0078] Figure 5 The second flowchart of the chaotic mapping encryption algorithm in the embodiments of this paper is shown;

[0079] Figure 6 A flowchart illustrating the process of determining the number of groups and the original number of bits for each group in the embodiments described herein is shown.

[0080] Figure 7 A flowchart of the second grouping determination process in the embodiments of this article is shown;

[0081] Figure 8 A flowchart illustrating the transaction processing method based on chaotic mapping applied to a client in the embodiments of this paper is shown;

[0082] Figure 9 The diagram illustrates the structure of a transaction processing device based on chaotic mapping applied to the server in the embodiments of this paper.

[0083] Figure 10 A structural diagram of a chaotic mapping-based transaction processing device applied to a client in the embodiments of this paper is shown.

[0084] Figure 11 A structural diagram of the computer device described in this embodiment is shown.

[0085] Explanation of symbols in the attached drawings:

[0086] 110. Client;

[0087] 120. Server-side;

[0088] 901, First Interaction Unit;

[0089] 902. Encryption unit;

[0090] 903, Second Interaction Unit;

[0091] 904. Transformation Unit;

[0092] 905. Decryption Unit;

[0093] 906. Comparison Unit;

[0094] 1001, First Interaction Unit;

[0095] 1002, Decryption Unit;

[0096] 1003, Transformation Unit;

[0097] 1004. Encryption unit;

[0098] 1005, Second Interaction Unit;

[0099] 1102. Computer equipment;

[0100] 1104. Processor;

[0101] 1106. Memory;

[0102] 1108. Drive mechanism;

[0103] 1110. Input / output module;

[0104] 1112. Input devices;

[0105] 1114. Output devices;

[0106] 1116. Presentation device;

[0107] 1118. Graphical User Interface;

[0108] 1120. Network interface;

[0109] 1122. Communication link;

[0110] 1124. Communication bus. Detailed Implementation

[0111] The technical solutions in the embodiments described below will be clearly and completely described with reference to the accompanying drawings. Obviously, the described embodiments are only a part of the embodiments described herein, and not all of the embodiments. Based on the embodiments described herein, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of this document.

[0112] It should be noted that the terms "first," "second," etc., used in the specification, claims, and accompanying drawings herein are used to distinguish similar objects and are not necessarily used to describe a specific order or sequence. It should be understood that such data can be interchanged where appropriate so that the embodiments described herein can be implemented in orders other than those illustrated or described herein. Furthermore, the terms "comprising" and "having," and any variations thereof, are intended to cover a non-exclusive inclusion; for example, a process, method, apparatus, product, or device that comprises a series of steps or units is not necessarily limited to those steps or units explicitly listed, but may include other steps or units not explicitly listed or inherent to such processes, methods, products, or devices.

[0113] This specification provides the operational steps of the methods described in the embodiments or flowcharts, but based on conventional or non-inventive labor, more or fewer operational steps may be included. The order of steps listed in the embodiments is merely one possible execution order among many and does not represent the only possible execution order. In actual system or device products, the methods shown in the embodiments or drawings can be executed sequentially or in parallel.

[0114] In one embodiment of this paper, a transaction processing system based on chaotic mapping is provided to address the problems of complex asymmetric key management, low computational efficiency, and resource waste in the existing technology of transaction verification between clients and servers using asymmetric keys. Specifically, as shown in the embodiment... Figure 1 As shown, it includes: client 110 and server 120.

[0115] Client 110 is an authentication client, such as a USB key. Each client 110 belongs to one customer, and the client 110 stores the customer's first key. In practice, the client can be obtained by the customer when conducting business at a branch, or through online application; this document does not limit this. In addition to storing the first key, the client also stores a chaotic mapping encryption algorithm used for encrypting and decrypting information. The specific implementation of the chaotic mapping encryption algorithm is described in subsequent embodiments. The first key can be arbitrarily generated from 0.000000000000001 to 0.9999999999999999. This data serves as the client's first key and is simultaneously stored on both the client and server sides; once generated, it cannot be changed.

[0116] Server 120 is an authentication server. One server 120 can manage multiple clients 110. The server stores the first key of each client, as well as a chaotic mapping encryption algorithm used for encrypting and decrypting information. After receiving a transaction request from client 110, server 120 completes transaction verification by interacting with client 110.

[0117] Specifically, such as Figure 2 As shown, the transaction processing procedure between client 110 and server 120 based on chaotic mapping includes:

[0118] Step 201: The client sends a transaction request to the server based on the user's operation.

[0119] When this step is implemented, a transaction request can be initiated by the user when they initiate a transaction (such as payment, settlement, inquiry, transfer, etc.).

[0120] In detail, a transaction request includes at least a client identifier, a transaction identifier, time information, and address information. The client identifier uniquely identifies the client, and the transaction identifier indicates the specific transaction type. The time information indicates the time the transaction occurred and is a relatively random variable. The address information indicates the client's address, enabling communication with the server.

[0121] Step 202: The server receives the transaction request sent by the client and generates the first plaintext information based on the transaction request and the anti-replay attack information, for example, denoted as A1.

[0122] By adding anti-replay attack information in this step, we can prevent reverse replay attacks and improve the effectiveness of information verification.

[0123] When implementing this step, the transaction request and anti-replay attack information can be converted into strings first, the transaction request string and the anti-replay attack information string can be concatenated, and the concatenated string can be processed by number sequence conversion to generate N-bit first plaintext information.

[0124] It should be noted that the number sequence in this article refers to the hexadecimal 01 sequence.

[0125] Step 203: The server uses a chaotic mapping encryption algorithm to encrypt the first plaintext information to obtain the first encrypted information, for example, denoted as A1', and sends the first encrypted information to the client. In the chaotic mapping encryption algorithm, the driving value of the chaotic mapping is the first key of the client.

[0126] The parameters in the chaotic mapping encryption algorithm include a first key and a first object. During this step, the server first obtains the client's first key from the keystore based on the client identifier in the transaction request, sets the first plaintext information as the first object, and then starts the chaotic mapping encryption algorithm. The specific execution process of the chaotic mapping encryption algorithm includes: (1) using the client's first key as the driving value to drive the chaotic mapping to perform multiple iterations, obtaining an N-bit chaotic number sequence; (2) performing an XOR operation between the N-bit chaotic number sequence and the first object to obtain a second object, which is the output result of the chaotic mapping encryption algorithm. When the first object is plaintext information, the chaotic mapping encryption algorithm performs an encryption process, and the second object is encrypted information; when the first object is encrypted information, the chaotic mapping encryption algorithm performs a decryption process, and the second object is plaintext information.

[0127] Considering the uneven distribution of 0s and 1s in the chaotic digital sequence obtained by chaotic mapping, leading to poor encryption performance, an alternative chaotic mapping encryption algorithm is provided to address this issue. This algorithm requires both the service and the client to store a first key and a second key. The first key is used to encrypt data, and the second key is used to group the information to be encrypted / decrypted (i.e., the first object). The specific execution process of the chaotic mapping encryption algorithm includes: using the client's first key to drive chaotic mapping to obtain the first chaotic digital sequence; determining the number of groups and the original number of bits for each group based on the client's second key; and then... The original bit length of each group is used to group the first object, resulting in multiple first groups; the first chaotic digital sequence is used to pad and XOR the multiple first groups according to a preset rule to obtain multiple second groups, wherein the data bit length of the second group is N; data extraction is performed on the corresponding second group using the original bit length of each first group; the extracted data from each group is concatenated to obtain the second object; wherein, when the first object is plaintext information, the chaotic mapping encryption algorithm performs an encryption process, and the second object is encrypted information; when the first object is encrypted information, the chaotic mapping encryption algorithm performs a decryption process, and the second object is plaintext information.

[0128] When the chaotic mapping encryption algorithm is executed, the number of iterations is either a fixed value or a random number determined according to certain rules. As long as the number of iterations is the same during the interaction between the client and the server, the information can be correctly decrypted. In one specific implementation, the number of iterations is, for example, 100,000.

[0129] The chaotic mapping described in this paper can be the Logistic mapping, Lorenz mapping, Hennon mapping, etc., with the Logistic mapping being preferred. The data model of the Logistic mapping is represented as follows:

[0130] xn+1 =x n μ(1-x n ),μ∈[0,4],x n ∈(0,1);

[0131] Where, x n+1 x is the value after the (n+1)th iteration. n is the value after the nth iteration, and μ is the iteration parameter of the logistic mapping.

[0132] Step 204: The client receives the first encrypted information and decrypts it using a chaotic mapping encryption algorithm to obtain the first plaintext information. In the chaotic mapping encryption algorithm, the driving value of the chaotic mapping is the client's first key.

[0133] In this step, the client first obtains the first key stored locally, uses the first encrypted information as the first object, and then executes the chaotic mapping encryption algorithm. The execution process of the chaotic mapping encryption algorithm is described in step 203, and will not be detailed here.

[0134] Step 205: The client uses a hash algorithm to transform the decrypted 'ok' first plaintext information to obtain the second plaintext information, for example, denoted as A2. The client then uses a chaotic mapping encryption algorithm to encrypt the second plaintext information to obtain the second encrypted information, for example, denoted as A2'. Finally, the client sends the second encrypted information to the server.

[0135] The hash algorithm described in this step can be a hash algorithm (such as SHA-512). In practice, it is sufficient to ensure that the hash algorithm used by the client is the same as that used by the server.

[0136] Step 206: The server receives the second encrypted information sent by the client, and decrypts the second encrypted information using the chaotic mapping encryption algorithm to obtain the second plaintext information to be verified. In the chaotic mapping encryption algorithm, the driving value of the chaotic mapping is the client's first key.

[0137] The process of decrypting the second encrypted information using the chaotic mapping encryption algorithm in this step can be found in step 203, and will not be described in detail here.

[0138] Step 207: The server uses a hash algorithm to transform the first plaintext information to obtain the true second plaintext information. In this step, the same hash algorithm as the client is used to perform the hashing process; for example, a hash algorithm.

[0139] Step 208: The server compares the second plaintext information to be verified with the real second plaintext information. If they are the same, the server responds to the transaction request.

[0140] The first plaintext information, the second plaintext information, the first encrypted information, and the second encrypted information described in this article are N-bit number sequences, where N is a positive integer and can be set according to requirements.

[0141] In some preferred embodiments, to avoid reverse engineering to obtain plaintext or encrypted information, N equals 2. n , where n is greater than or equal to 7.

[0142] This embodiment applies chaotic mapping to a client-server transaction verification scenario, allowing both the client and server to store only the client's first key. Encryption and decryption can be achieved using this first key to drive the chaotic sequence generated by the chaotic mapping, offering the advantage of simple verification. Furthermore, the chaotic mapping model is simple, and the encryption algorithm based on chaotic mapping belongs to the symmetric encryption algorithm system, resulting in higher computational efficiency compared to asymmetric encryption algorithms. Therefore, this paper also offers the advantages of high computational efficiency and resource conservation. Simultaneously, based on the initial value sensitivity of chaotic mapping, this paper can provide at least 10... 30 The key space is much larger than that of existing authentication clients. 80 With a small key space, the first key of the chaotic mapping can serve as the customer's identification information, requiring only a small amount of storage space and eliminating the key management problem found in traditional symmetric encryption algorithms.

[0143] In one embodiment of this paper, a transaction processing method based on chaotic mapping applied to the server is provided, wherein the server stores the client's first key, such as... Figure 3 As shown, the method includes:

[0144] Step 301: Receive the transaction request sent by the client, and generate the first plaintext information based on the transaction request and the anti-replay attack information.

[0145] In this step, the first string is generated based on the time string, address string, transaction information string, and anti-replay attack string of the transaction request; then, the first string is processed by number sequence conversion to obtain N-bit first plaintext information.

[0146] In detail, the number of bits in the first plaintext information is related to the first string, and the preferred N is 128.

[0147] Step 302: Encrypt the first plaintext information using the chaotic mapping encryption algorithm to obtain the first encrypted information, and send the first encrypted information to the client. In the chaotic mapping encryption algorithm, the driving value of the chaotic mapping is the client's first key.

[0148] Step 303: Receive the second encrypted information sent by the client. The second encrypted information is obtained by the client encrypting the second plaintext information using the chaotic mapping encryption algorithm. The second plaintext information is obtained by the client transforming the plaintext information obtained by decrypting the first encrypted information using the chaotic mapping encryption algorithm.

[0149] Step 304: Use a hash algorithm to transform the first plaintext information to obtain the real second plaintext information.

[0150] Step 305: Decrypt the second encrypted information using the chaotic mapping encryption algorithm to obtain the second plaintext information to be verified, wherein the driving value of the chaotic mapping in the chaotic mapping encryption algorithm is the client's first key.

[0151] Step 306: Compare the second plaintext information to be verified with the real second plaintext information. If they are the same, respond to the transaction request; if they are different, reject the transaction request.

[0152] It should be noted that the first plaintext information, the second plaintext information, the first encrypted information, and the second encrypted information are N-bit number sequences.

[0153] In one embodiment of this article, such as Figure 4 As shown, the execution process of the chaotic mapping encryption algorithm includes:

[0154] Step 401: Use the client's first key to drive the chaotic mapping to obtain an N-bit chaotic number sequence.

[0155] One implementation of this step is as follows: The client's first key drives the chaotic mapping to obtain a first original chaotic sequence; the last N bits of the first original chaotic sequence are then subjected to digital standardization to obtain an N-bit chaotic number sequence. This implementation removes data with poor results from the first original chaotic sequence, retaining the last N bits with good chaotic results. For example, the digital standardization process in this implementation sets data greater than a certain value (e.g., 0.5, which can be set according to requirements) to 1 and data less than that value to 0.

[0156] Another implementation of this step is as follows: The chaotic mapping is driven by the first key stored locally on the client to obtain a first original chaotic sequence; the data after the first pre-positioning in the first original chaotic sequence is standardized and segmented to obtain multiple sets of N-bit chaotic digital subsequences; the multiple N-bit chaotic digital subsequences are XORed to obtain an N-bit chaotic digital sequence. This implementation can solve the problem of uneven 0 / 1 distribution in the chaotic mapping to a certain extent.

[0157] Step 402: XOR the N-bit chaotic number sequence with the first object to obtain the second object.

[0158] In this scenario, when the first object is plaintext information, the chaotic mapping encryption algorithm performs the encryption process; when the second object is encrypted information, the chaotic mapping encryption algorithm performs the decryption process; and when the second object is plaintext information.

[0159] This paper utilizes the reflexive property of XOR to achieve encryption of plaintext information and decryption of ciphertext information through a chaotic mapping encryption algorithm.

[0160] In one embodiment of this paper, both the server and the client store the client's first key, second key, and the same chaotic mapping encryption algorithm, such as... Figure 5 As shown, the execution process of the chaotic mapping encryption algorithm includes:

[0161] Step 501: Use the client's first key to drive the chaotic mapping to obtain the first chaotic digital sequence.

[0162] In this step, the first chaotic digital sequence refers to the digital sequence obtained by standardizing the iterative sequence obtained after chaotic iteration of the first key. For example, if the iterative sequence includes 100,000 data points, then the chaotic digital sequence also includes 100,000 data points.

[0163] Step 502: Determine the number of blocks for the first object and the original number of bits for each block based on the client's second key.

[0164] In some implementations, such as Figure 6 As shown, determining the number of blocks for the first object and the original bit length of each block based on the client's second key includes:

[0165] Step 601: Use the client's second key to drive the chaotic mapping to obtain the second chaotic digital sequence.

[0166] Step 602: Amplify and modulo the data in the second chaotic digital sequence to obtain a chaotic integer sequence.

[0167] This step converts the data in the second chaotic number sequence into decimal data between 0 and 1. In some preferred methods, the magnification factor is, for example, 100 times. The modulo operation includes rounding up or down, which ensures that the value of each number is not greater than the modulo value. In some preferred methods, the modulo value is 30, so that the final chaotic integer sequence takes values ​​between 0 and 29.

[0168] Step 603: Use the data after the second preposition in the chaotic integer sequence to group the first object, and obtain the number of groups and the original number of bits in each group.

[0169] In this step, the second preposition can be set according to requirements, and this article does not limit its specific value.

[0170] Assuming the second preposition is the Mth position, the (M+1)th digit is used as the original number of digits in the first group, the (M+2)th digit is used as the original number of digits in the second group, and so on, until the (M+X)th digit is obtained such that the number of digits from M+1 to M+X is greater than N. The original number of digits at the (M+X)th position is N (e.g., 128 digits) minus the sum of the original number of digits in groups M+1 to M+X-1.

[0171] Step 503: Group the first object according to the number of groups and the original number of bits in each group to obtain multiple first groups.

[0172] Step 504: Using the first chaotic digital sequence, multiple first groups are padded and XORed according to preset rules to obtain multiple second groups, wherein the number of data bits in the second group is N.

[0173] In this step, the preset rule is, for example, to first extract data from the first chaotic number sequence in order from front to back and fill it into each first group; then, to process the remaining data in the first chaotic number sequence into groups in order to obtain the same number of groups as the second group, and to perform XOR processing on each group obtained from the first chaotic number sequence with a second group.

[0174] In this step, such as Figure 7 As shown, multiple second groups are obtained by using the first chaotic digital sequence to complete and XOR multiple first groups according to preset rules, including:

[0175] Step 701: The data in the first chaotic number sequence are sequentially added to each first group to obtain the updated first group. The number of data bits in each updated first group is N.

[0176] Step 702: Divide the remaining first chaotic number sequence after the completion process into multiple chaotic number subsequences, with each chaotic number subsequence having N data bits.

[0177] In practice, each group can be padded and XORed. Specifically, padded and chaotic number subsequence extraction are performed sequentially on a group.

[0178] Step 703: XOR each chaotic number subsequence with each updated first group to obtain multiple second groups.

[0179] Step 505: Use the original bit value of each first group to perform data extraction operation on the corresponding second group.

[0180] Step 506: The data extracted from each group are spliced ​​together to obtain the second object.

[0181] When the first object is plaintext information, the chaotic mapping encryption algorithm performs the encryption process, and the second object is encrypted information; when the first object is encrypted information, the chaotic mapping encryption algorithm performs the decryption process, and the second object is plaintext information.

[0182] This embodiment solves the problem of uneven 0 / 1 distribution in chaotic mappings. It utilizes not only the chaotic mapping itself but also plaintext data, better ensuring the uniformity of the 0 / 1 count. Furthermore, it uses two independent chaotic mappings (a first key-driven chaotic mapping and a second key-driven chaotic mapping), directly expanding the key space to 10T. 30 This can further enhance the security of encryption.

[0183] The following is an illustration using a specific embodiment. Figure 6 The application process of the chaotic mapping encryption algorithm is shown. Specifically, assuming N is 128, the number of blocks and the original number of bits are determined by the second key. Assuming the plaintext of the first 10-bit block before encryption is 0101110100, this step takes padding to 12 bits as an example.

[0184] (1) During server-side encryption, a key-driven chaotic mapping is used to obtain the first chaotic digital sequence. Following step 504, the encrypted plaintext is padded to 12 bits, assuming it is 010111010010. Here, the bolded 10 is the sequence obtained sequentially after the chaotic sequence is quantized. After obtaining the 10, 12 bits are taken from the first bit after the 10 in the first chaotic digital sequence, assuming it is 011010110110. Then, this string is XORed with the padded plaintext string, as shown below: 010111010010 011010110110

[0187] —————— 001101100100

[0189] The first 10 characters of the XOR result string (0011011001) are used as the first encrypted information and sent to the client.

[0190] (2) The client receives the first encrypted information, drives the first chaotic mapping according to the first key fixed locally to obtain the first chaotic digital sequence, and obtains the encrypted string in the same way as in step 503 (for example, the length of the first group is 11, the length of the second group is 23, and so on). The encrypted string is grouped according to the obtained group information to obtain the first group of encrypted ciphertext 0011011001.

[0191] Following the same method as step 504, the first set of ciphertext after completion is obtained using the first chaotic number sequence as 001101100110. At the same time, the same bolded string 011010110110 is obtained as in step (1). The completed ciphertext 001101100110 is then XORed with the light blue string 011010110110, as shown below: 001101100110 011010110110

[0194] —————— 010111010000

[0196] Take the first 10 bits to get the original plaintext string 0101110100. Decrypt each other group in the same way. Finally, concatenate the decrypted strings to get the complete plaintext.

[0197] In one embodiment of this paper, a transaction processing method based on chaotic mapping applied to a client is also provided. The client stores a first key and the same chaotic mapping encryption algorithm as the server. Specifically, as shown below... Figure 8 As shown, the method includes:

[0198] Step 801: Receive the first encrypted information sent by the server.

[0199] Step 802: Decrypt the first encrypted information using the chaotic mapping encryption algorithm to obtain the first plaintext information, wherein the driving value of the chaotic mapping in the chaotic mapping encryption algorithm is the first key of the client.

[0200] In this step, the first encrypted information is input as the first object into the chaotic mapping encryption algorithm to obtain the second object, namely the first plaintext information.

[0201] Step 803: Transform the first plaintext information using a hash algorithm to obtain the second plaintext information.

[0202] Step 804: Use the chaotic mapping encryption algorithm to encrypt the second plaintext information to obtain the second encrypted information.

[0203] In this step, the second plaintext information is input as the first object into the chaotic mapping encryption algorithm to obtain the second object, namely the second encrypted information.

[0204] Step 805: Send the second encrypted information to the server.

[0205] This embodiment applies chaotic mapping to a client-server transaction verification scenario, allowing both the client and server to store only the client's first key. Encryption and decryption can be achieved using this first key to drive the chaotic sequence generated by the chaotic mapping, offering the advantage of simple verification. Furthermore, the chaotic mapping model is simple, and the encryption algorithm based on chaotic mapping belongs to the symmetric encryption algorithm system, resulting in higher computational efficiency compared to asymmetric encryption algorithms. Therefore, this paper also offers the advantages of high computational efficiency and resource conservation. Simultaneously, based on the initial value sensitivity of chaotic mapping, this paper can provide at least 10... 30 The key space is much larger than that of existing authentication clients. 80 With a small key space, the first key of the chaotic mapping can serve as the customer's identification information, requiring only a small amount of storage space and eliminating the key management problem found in traditional symmetric encryption algorithms.

[0206] Based on the same inventive concept, this document also provides a transaction processing apparatus based on chaotic mapping applied to a server and a client, as described in the following embodiments. Since the principle of the transaction processing apparatus based on chaotic mapping for both the server and the client is similar to that of the transaction processing method based on chaotic mapping for both the server and the client, the implementation of the transaction processing apparatus based on chaotic mapping for both the server and the client can refer to the transaction processing method based on chaotic mapping for both the server and the client; repeated details will not be elaborated further. The server and the client store the client's first key.

[0207] like Figure 9 As shown, the transaction processing device based on chaotic mapping applied to the server includes:

[0208] The first interaction unit 901 is used to receive transaction requests sent by the client and generate first plaintext information based on the transaction request and anti-replay attack information.

[0209] The encryption unit 902 is used to encrypt the first plaintext information using a chaotic mapping encryption algorithm to obtain the first encrypted information, and send the first encrypted information to the client, wherein the driving value of the chaotic mapping in the chaotic mapping encryption algorithm is the first key of the client.

[0210] The second interaction unit 903 is used to receive the second encrypted information sent by the client. The second encrypted information is obtained by the client encrypting the second plaintext information using the chaotic mapping encryption algorithm. The second plaintext information is obtained by the client decrypting the first encrypted information using the chaotic mapping encryption algorithm and transforming the plaintext information.

[0211] The transformation unit 904 is used to transform the first plaintext information using a hash algorithm to obtain the real second plaintext information.

[0212] The decryption unit 905 is used to decrypt the second encrypted information using the chaotic mapping encryption algorithm to obtain the second plaintext information to be verified, wherein the driving value of the chaotic mapping in the chaotic mapping encryption algorithm is the first key of the client.

[0213] The comparison unit 906 is used to compare the second plaintext information to be verified with the real second plaintext information. If they are the same, a transaction request is responded to.

[0214] Wherein, the first plaintext information, the second plaintext information, the first encrypted information, and the second encrypted information are N-bit number sequences.

[0215] like Figure 10 As shown, the transaction processing device based on chaotic mapping applied to the client includes:

[0216] The first interaction unit 1001 is used to receive the first encrypted information sent by the server.

[0217] The decryption unit 1002 is used to decrypt the first encrypted information using the chaotic mapping encryption algorithm to obtain the first plaintext information, wherein the driving value of the chaotic mapping in the chaotic mapping encryption algorithm is the first key of the client.

[0218] Transformation unit 1003 is used to transform the first plaintext information using a hash algorithm to obtain the second plaintext information;

[0219] The encryption unit 1004 is used to encrypt the second plaintext information using a chaotic mapping encryption algorithm to obtain the second encrypted information.

[0220] The second interaction unit 1005 is used to send the second encrypted information to the server.

[0221] The chaotic mapping-based transaction processing device for the server and the chaotic mapping-based transaction processing device for the client provided in this paper work together. The entire authentication process does not involve asymmetric encryption, which can greatly improve computational efficiency and save resources. Furthermore, based on the initial value sensitivity of chaotic mapping, this paper can also provide at least 10... 30 The key space is much larger than that of existing client-side (U-shield) asymmetric encryption, which can achieve a size of 2. 80 With a small key space, the initial values ​​of the chaotic mapping system can serve as customer identification information, requiring only a small amount of storage space and eliminating the key management problem found in traditional symmetric encryption algorithms.

[0222] In one embodiment of this document, a computer device is also provided, such as... Figure 11As shown, the computer device 1102 includes a memory 1106, a processor 1104, and a computer program stored in the memory and executable on the processor. When the processor executes the computer program, it implements the aforementioned... Figures 3-7 The method is described above. Processor 1104 includes one or more central processing units (CPUs), each of which can implement one or more hardware threads. Memory 1106 is used to store information of any kind, such as code, settings, data, etc. Non-limitingly, for example, memory 1106 may include any type of RAM, any type of ROM, flash memory, hard disk, optical disk, etc. More generally, any memory can use any technology to store information. Furthermore, any memory can provide volatile or non-volatile retention of information. Further, any memory can represent a fixed or removable component of computer device 1102. In one case, when processor 1104 executes associated instructions stored in any memory or combination of memories, computer device 1102 can perform any operation of the associated instructions. Computer device 1102 also includes one or more drive mechanisms 1108 for interacting with any memory, such as hard disk drive mechanisms, optical disk drive mechanisms, etc.

[0223] Computer device 1102 may further include an input / output module 1110 (I / O) for receiving various inputs (via input device 1112) and providing various outputs (via output device 1114). A specific output mechanism may include a presentation device 1116 and an associated graphical user interface 1118 (GUI). In other embodiments, the input / output module 1110 (I / O), input device 1112, and output device 1114 may be omitted, and the device may function solely as a computer device within a network. Computer device 1102 may also include one or more network interfaces 1120 for exchanging data with other devices via one or more communication links 1122. One or more communication buses 1124 couple the components described above together.

[0224] Communication link 1122 can be implemented in any way, such as via a local area network, a wide area network (e.g., the Internet), a point-to-point connection, or any combination thereof. Communication link 1122 may include any combination of hardwired links, wireless links, routers, gateway functions, name servers, etc., governed by any protocol or combination of protocols.

[0225] Corresponding to Figures 3-7 In addition to the methods described above, this embodiment also provides a computer-readable storage medium storing a computer program that, when executed by a processor, performs the steps of the above-described methods.

[0226] This embodiment also provides a computer-readable instruction, wherein when a processor executes the instruction, the program therein causes the processor to perform the following: Figures 3-7 The method shown.

[0227] It should be understood that in the various embodiments of this document, the sequence number of each process does not imply the order of execution. The execution order of each process should be determined by its function and internal logic, and should not constitute any limitation on the implementation process of the embodiments of this document.

[0228] It should also be understood that, in the embodiments herein, the term "and / or" is merely a description of the relationship between associated objects, indicating that three relationships can exist. For example, A and / or B can represent: A existing alone, A and B existing simultaneously, and B existing alone. Additionally, the character " / " in this document generally indicates that the preceding and following associated objects have an "or" relationship.

[0229] Those skilled in the art will recognize that the units and algorithm steps of the various examples described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, computer software, or a combination of both. To clearly illustrate the interchangeability of hardware and software, the components and steps of the various examples have been generally described in terms of functionality in the foregoing description. Whether these functions are implemented in hardware or software depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this document.

[0230] Those skilled in the art will clearly understand that, for the sake of convenience and brevity, the specific working processes of the systems, devices, and units described above can be referred to the corresponding processes in the foregoing method embodiments, and will not be repeated here.

[0231] In the embodiments provided herein, it should be understood that the disclosed systems, apparatuses, and methods can be implemented in other ways. For example, the apparatus embodiments described above are merely illustrative; for instance, the division of units is only a logical functional division, and in actual implementation, there may be other division methods. For example, multiple units or components may be combined or integrated into another system, or some features may be ignored or not executed. Furthermore, the couplings or direct couplings or communication connections shown or discussed may be indirect couplings or communication connections through some interfaces, devices, or units, or they may be electrical, mechanical, or other forms of connection.

[0232] The units described as separate components may or may not be physically separate. The components shown as units may or may not be physical units; that is, they may be located in one place or distributed across multiple network units. Some or all of the units can be selected to achieve the purpose of the embodiments described herein, depending on actual needs.

[0233] Furthermore, the functional units in the various embodiments of this document can be integrated into one processing unit, or each unit can exist physically separately, or two or more units can be integrated into one unit. The integrated unit can be implemented in hardware or as a software functional unit.

[0234] If the integrated unit is implemented as a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of this paper, in essence, or the part that contributes to the prior art, or all or part of the technical solution, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute all or part of the steps of the methods described in the various embodiments of this paper. The aforementioned storage medium includes various media capable of storing program code, such as USB flash drives, portable hard drives, read-only memory (ROM), random access memory (RAM), magnetic disks, or optical disks.

[0235] This document uses specific embodiments to illustrate the principles and implementation methods of this document. The descriptions of the embodiments above are only for the purpose of helping to understand the methods and core ideas of this document. At the same time, for those skilled in the art, there will be changes in the specific implementation methods and application scope based on the ideas of this document. Therefore, the content of this specification should not be construed as a limitation of this document.

Claims

1. A transaction processing method based on chaotic mapping, characterized in that, Applied to the server side, the server side stores the client's first key, including: Receive transaction requests sent by clients and generate first plaintext information based on the transaction requests and anti-replay attack information; The first plaintext information is encrypted using a chaotic mapping encryption algorithm to obtain the first encrypted information, and the first encrypted information is sent to the client. In the chaotic mapping encryption algorithm, the driving value of the chaotic mapping is the first key of the client. The client receives a second encrypted message, which is obtained by encrypting the second plaintext message using the chaotic mapping encryption algorithm. The second plaintext message is obtained by transforming the plaintext message obtained by decrypting the first encrypted message using the chaotic mapping encryption algorithm. The first plaintext information is transformed using a hash algorithm to obtain the true second plaintext information; The second encrypted information is decrypted using the chaotic mapping encryption algorithm to obtain the second plaintext information to be verified; Compare the second plaintext information to be verified with the real second plaintext information; if they are the same, respond to the transaction request. Wherein, the first plaintext information, the second plaintext information, the first encrypted information, and the second encrypted information are N-bit number sequences; The server also stores the client's second key; The execution process of the chaotic mapping encryption algorithm includes: The first chaotic mapping is driven by the first key of the client to obtain a first chaotic digital sequence; wherein, the first chaotic digital sequence is a digital sequence obtained by standardizing the iterative sequence obtained by chaotic iteration of the first key; The number of blocks for the first object and the original number of bits for each block are determined based on the client's second key; The first object is grouped according to the number of groups and the original number of bits in each group, resulting in multiple first groups; Multiple second groups are obtained by padding and XORing multiple first groups according to a preset rule using the first chaotic digital full sequence, wherein the number of data bits in the second group is N; Data extraction is performed on the corresponding second group using the original number of bits in each first group; The data extracted from each group are concatenated to obtain the second object; Wherein, when the first object is plaintext information, the chaotic mapping encryption algorithm performs an encryption process, and the second object is encrypted information; When the first object is encrypted information, the chaotic mapping encryption algorithm performs a decryption process; when the second object is plaintext information.

2. The method as described in claim 1, characterized in that, The first plaintext information generated based on the transaction request and anti-replay attack information includes: Generate the first string based on the time string, address string, transaction information string, and anti-replay attack string of the transaction request; Perform a number sequence conversion on the first string to obtain N bits of first plaintext information.

3. The method as described in claim 1, characterized in that, The step of using the client's first key to drive the chaotic mapping to obtain the first chaotic digital sequence includes: The first key of the client is used to drive the chaotic mapping to obtain an N-bit chaotic number sequence.

4. The method as described in claim 3, characterized in that, Using the client's first key to drive a chaotic mapping to obtain an N-bit chaotic number sequence, including: The first key of the client is used to drive the chaotic mapping to obtain the first original chaotic sequence; The last N bits of the first original chaotic sequence are standardized to obtain an N-bit chaotic number sequence.

5. The method as described in claim 3, characterized in that, Using the client's first key to drive a chaotic mapping to obtain an N-bit chaotic number sequence, including: The first key of the client, stored locally, is used to drive the chaotic mapping to obtain the first original chaotic sequence; The data after the first preposition in the first original chaotic sequence is standardized and segmented to obtain multiple sets of N-bit chaotic digital subsequences; XORing multiple N-bit chaotic number subsequences yields an N-bit chaotic number sequence.

6. The method as described in claim 1, characterized in that, The number of blocks and the original number of bits for each block are determined based on the client's second key, including: The second key of the client is used to drive the chaotic mapping to obtain the second chaotic digital full sequence; The data in the second chaotic digital sequence are amplified and modulo-processed to obtain a chaotic integer sequence; The first object is grouped using the data after the second preposition in the chaotic integer sequence to obtain the number of groups and the original number of bits in each group.

7. The method as described in claim 1, characterized in that, After using the first chaotic digital sequence to perform padding and XOR processing on multiple first groups according to preset rules, multiple second groups are obtained, including: The data in the first chaotic number sequence are sequentially filled into each first group to obtain the updated first group. The number of data bits in each updated first group is N. The remaining first chaotic number sequence after the completion process is sequentially divided into multiple chaotic number subsequences, and the number of data bits in each chaotic number subsequence is N. Each chaotic number subsequence is XORed with each updated first group to obtain multiple second groups.

8. The method as described in claim 1, characterized in that, N equals 2 n , where n is greater than or equal to 7.

9. A transaction processing method based on chaotic mapping, characterized in that, Applied to a client, the client stores a first key and the same chaotic mapping encryption algorithm as the server, including: Receive the first encrypted message sent by the server; The first encrypted information is decrypted using the chaotic mapping encryption algorithm to obtain the first plaintext information, wherein the driving value of the chaotic mapping in the chaotic mapping encryption algorithm is the first key of the client; The first plaintext information is transformed using a hash algorithm to obtain the second plaintext information; The second plaintext information is encrypted using a chaotic mapping encryption algorithm to obtain the second encrypted information; Send the second encrypted message to the server; The server also stores the client's second key; The execution process of the chaotic mapping encryption algorithm includes: The first chaotic mapping is driven by the first key of the client to obtain a first chaotic digital sequence; wherein, the first chaotic digital sequence is a digital sequence obtained by standardizing the iterative sequence obtained by chaotic iteration of the first key; The number of blocks for the first object and the original number of bits for each block are determined based on the client's second key; The first object is grouped according to the number of groups and the original number of bits in each group, resulting in multiple first groups; Multiple second groups are obtained by padding and XORing multiple first groups according to a preset rule using the first chaotic digital full sequence, wherein the number of data bits in the second group is N; Data extraction is performed on the corresponding second group using the original number of bits in each first group; The data extracted from each group are concatenated to obtain the second object; Wherein, when the first object is plaintext information, the chaotic mapping encryption algorithm performs an encryption process, and the second object is encrypted information; When the first object is encrypted information, the chaotic mapping encryption algorithm performs a decryption process; when the second object is plaintext information.

10. A transaction processing device based on chaotic mapping, characterized in that, Applied to the server side, the server side stores the client's first key, including: The first interaction unit is used to receive transaction requests sent by the client and generate first plaintext information based on the transaction request and anti-replay attack information. An encryption unit is used to encrypt the first plaintext information using a chaotic mapping encryption algorithm to obtain the first encrypted information, and send the first encrypted information to the client, wherein the driving value of the chaotic mapping in the chaotic mapping encryption algorithm is the first key of the client. The second interaction unit is used to receive the second encrypted information sent by the client. The second encrypted information is obtained by the client encrypting the second plaintext information using the chaotic mapping encryption algorithm. The second plaintext information is obtained by the client decrypting the first encrypted information using the chaotic mapping encryption algorithm and transforming the plaintext information. The transformation unit is used to transform the first plaintext information using a hash algorithm to obtain the real second plaintext information; The decryption unit is used to decrypt the second encrypted information using the chaotic mapping encryption algorithm to obtain the second plaintext information to be verified. The comparison unit is used to compare the second plaintext information to be verified with the real second plaintext information. If they are the same, a transaction request is responded to. Wherein, the first plaintext information, the second plaintext information, the first encrypted information, and the second encrypted information are N-bit number sequences; The server also stores the client's second key; The execution process of the chaotic mapping encryption algorithm includes: The first chaotic mapping is driven by the first key of the client to obtain a first chaotic digital sequence; wherein, the first chaotic digital sequence is a digital sequence obtained by standardizing the iterative sequence obtained by chaotic iteration of the first key; The number of blocks for the first object and the original number of bits for each block are determined based on the client's second key; The first object is grouped according to the number of groups and the original number of bits in each group, resulting in multiple first groups; Multiple second groups are obtained by padding and XORing multiple first groups according to a preset rule using the first chaotic digital full sequence, wherein the number of data bits in the second group is N; Data extraction is performed on the corresponding second group using the original number of bits in each first group; The data extracted from each group are concatenated to obtain the second object; Wherein, when the first object is plaintext information, the chaotic mapping encryption algorithm performs an encryption process, and the second object is encrypted information; When the first object is encrypted information, the chaotic mapping encryption algorithm performs a decryption process; when the second object is plaintext information.

11. A transaction processing device based on chaotic mapping, characterized in that, Applied to a client, the client stores a first key and the same chaotic mapping encryption algorithm as the server, including: The first interaction unit is used to receive the first encrypted information sent by the server. The decryption unit is used to decrypt the first encrypted information using the chaotic mapping encryption algorithm to obtain the first plaintext information, wherein the driving value of the chaotic mapping in the chaotic mapping encryption algorithm is the first key of the client. The transformation unit is used to transform the first plaintext information using a hash algorithm to obtain the second plaintext information; The encryption unit is used to encrypt the second plaintext information using a chaotic mapping encryption algorithm to obtain the second encrypted information; The second interaction unit is used to send the second encrypted information to the server. The server also stores the client's second key; The execution process of the chaotic mapping encryption algorithm includes: The first chaotic mapping is driven by the first key of the client to obtain a first chaotic digital sequence; wherein, the first chaotic digital sequence is a digital sequence obtained by standardizing the iterative sequence obtained by chaotic iteration of the first key; The number of blocks for the first object and the original number of bits for each block are determined based on the client's second key; The first object is grouped according to the number of groups and the original number of bits in each group, resulting in multiple first groups; Multiple second groups are obtained by padding and XORing multiple first groups according to a preset rule using the first chaotic digital full sequence, wherein the number of data bits in the second group is N; Data extraction is performed on the corresponding second group using the original number of bits in each first group; The data extracted from each group are concatenated to obtain the second object; Wherein, when the first object is plaintext information, the chaotic mapping encryption algorithm performs an encryption process, and the second object is encrypted information; When the first object is encrypted information, the chaotic mapping encryption algorithm performs a decryption process; when the second object is plaintext information.

12. A computer device, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that, When the processor executes the computer program, it implements the method as described in any one of claims 1 to 8.

13. A computer storage medium having a computer program stored thereon, characterized in that, When the computer program is run by the processor of the computer device, it executes the instructions of the method according to claim 9.

14. A computer program product, characterized in that, The computer program product includes a computer program that, when executed by a processor, implements the method as described in any one of claims 1 to 8 or the method as described in claim 9.

Images