CN115037511A - Data processing method, device, equipment and medium - Google Patents

Abstract

The application provides a data processing method, a data processing device, data processing equipment and a data processing medium, and relates to the technical field of data processing. The method comprises the following steps: acquiring a message to be encrypted; analyzing data to be encrypted and a first check code from the message to be encrypted; determining an encryption factor corresponding to the first check code according to the obtained mapping relation between the check code and the encryption factor; encrypting the data to be encrypted by using the encryption factor to obtain first ciphertext data; packaging the first ciphertext data and the first check code into a first encrypted message; and sending the first encrypted message. Therefore, the encryption of the data to be encrypted in the message to be encrypted is realized, and a physical transmission key is not required.

Description

A data processing method, device, equipment and medium

technical field

The present application relates to the technical field of data processing, and in particular, to a data processing method, apparatus, device and medium.

Background technique

The data transmitted in the network can be in plaintext or ciphertext. Once the data directly transmitted in plaintext is obtained illegally, the loaded data information will be directly obtained by others. In order to secure the transmission of sensitive data such as secrets, encryption technology is usually used to convert plaintext into ciphertext for network transmission. Common encryption technology classifications include symmetric encryption and asymmetric encryption. Asymmetric encryption can achieve stronger encryption, but its speed is slower. Compared with the asymmetric encryption method, the symmetric encryption method has the advantages of high speed, small amount of calculation, and high encryption efficiency, and is often used in the case of a large amount of data encryption. Symmetric encryption is an encryption technology that uses the same key for encryption and decryption by both data sender and receiver.

The key point of symmetric encryption is the generation and distribution of its keys. The main methods of key distribution are physical transmission or introduction of a third party for key transmission. Physical delivery of keys is highly restrictive and generally not suitable for mass data transmission, while third-party key delivery is not only complicated, but also requires more resource consumption due to the introduction of a third party.

Therefore, how to perform encrypted transmission of data without requiring physical transmission of keys is one of the technical issues worth considering.

SUMMARY OF THE INVENTION

In view of this, the present application provides a data processing method, apparatus, device and medium, which are used for encrypted transmission of data without requiring physical transmission of keys.

Specifically, the application is achieved through the following technical solutions:

According to a first aspect of the present application, a data processing method is provided, comprising:

Get the message to be encrypted;

Parse out the to-be-encrypted data and the first check code from the to-be-encrypted message;

According to the obtained mapping relationship between the check code and the encryption factor, determine the encryption factor corresponding to the first check code;

Encrypting the data to be encrypted by using the encryption factor to obtain first ciphertext data;

encapsulating the first ciphertext data and the first check code into a first encrypted message;

Send the first encrypted message.

Optionally, the data processing method provided in this embodiment further includes:

receiving the second encrypted message;

Parse out the second ciphertext data and the second check code from the second encrypted message;

Using the obtained mapping relationship between the check code and the decryption factor, determine the decryption factor corresponding to the second check code;

The second ciphertext data is decrypted by using the decryption factor to obtain decrypted data.

Optionally, the first check code is determined based on the data to be encrypted and a set polynomial.

Optionally, the mapping relationship between the check code and the encryption factor is obtained from the mapping relationship distribution center; and the mapping relationship between the check code and the decryption factor is obtained from the mapping relationship distribution center. .

According to a second aspect of the present application, a data processing device is provided, and an acquisition module is used to acquire a message to be encrypted;

a first parsing module, configured to parse out the to-be-encrypted data and the first check code from the to-be-encrypted message;

a first determination module, configured to determine the encryption factor corresponding to the first check code according to the obtained mapping relationship between the check code and the encryption factor;

an encryption module, configured to perform encryption processing on the data to be encrypted by using the encryption factor to obtain first ciphertext data;

an encapsulation module, configured to encapsulate the first ciphertext data and the first check code into a first encrypted message;

A sending module, configured to send the first encrypted message.

Optionally, the data processing apparatus provided in this embodiment further includes:

a receiving module for receiving the second encrypted message;

a second parsing module, configured to parse out the second ciphertext data and the second check code from the second encrypted message;

a second determination module, configured to determine the decryption factor corresponding to the second check code by using the obtained mapping relationship between the check code and the decryption factor;

A decryption module, configured to perform decryption processing on the second ciphertext data by using the decryption factor to obtain decrypted data.

Optionally, the first check code is determined based on the data to be encrypted and a set polynomial.

Optionally, the mapping relationship between the check code and the encryption factor is obtained from the mapping relationship distribution center; and the mapping relationship between the check code and the decryption factor is obtained from the mapping relationship distribution center. .

According to a third aspect of the present application, an electronic device is provided, including a processor and a machine-readable storage medium, where the machine-readable storage medium stores a computer program that can be executed by the processor, and the processor is prompted by the computer program to execute the implementation of the present application Example of the method provided in the first aspect.

According to a fourth aspect of the present application, a machine-readable storage medium is provided, where a computer program is stored in the machine-readable storage medium, and when called and executed by a processor, the computer program causes the processor to execute the first aspect of the embodiments of the present application. provided method.

The beneficial effects of the embodiments of the present application:

In the data processing method and device provided by the embodiments of the present application, after the to-be-encrypted message is obtained, the to-be-encrypted data and the first check code are parsed from the to-be-encrypted message; The mapping relationship between the factors is used to determine the encryption factor corresponding to the first check code; and the encryption factor is used to encrypt the data to be encrypted to obtain the first ciphertext data; then the first ciphertext data and the first check code are combined. It is encapsulated into a first encrypted message, and the first encrypted message is sent. Thereby, the encryption of the data to be encrypted in the to-be-encrypted message is realized, and the key is not required to be physically transmitted; in addition, the encryption factor for encrypting the to-be-encrypted data is obtained by using the check code, thereby ensuring the security of the encrypted data.

Description of drawings

1 is a schematic flowchart of a data processing method provided by an embodiment of the present application;

2 is a schematic flowchart of another data processing method provided by an embodiment of the present application;

3 is a schematic diagram of a data processing logic provided by an embodiment of the present application;

4 is a schematic structural diagram of a data processing apparatus provided by an embodiment of the present application;

FIG. 5 is a schematic diagram of a hardware structure of an electronic device implementing a data processing method provided by an embodiment of the present application.

Detailed ways

Exemplary embodiments will be described in detail herein, examples of which are illustrated in the accompanying drawings. Where the following description refers to the drawings, the same numerals in different drawings refer to the same or similar elements unless otherwise indicated. The implementations described in the illustrative examples below are not intended to represent all implementations consistent with this application. Rather, they are merely examples of apparatus and methods consistent with some aspects of the present application.

The terminology used in this application is for the purpose of describing particular embodiments only and is not intended to limit the application. As used in this application, the singular forms "a," "the," and "the" are intended to include the plural forms as well, unless the context clearly dictates otherwise. It will also be understood that the term "and/or" as used herein refers to and includes any and all possible combinations of one or more of the corresponding listed items.

It should be understood that although the terms first, second, third, etc. may be used in this application to describe various information, such information should not be limited by these terms. These terms are only used to distinguish the same type of information from each other. For example, the first information may also be referred to as the second information, and similarly, the second information may also be referred to as the first information without departing from the scope of the present application. Depending on the context, the word "if" as used herein can be interpreted as "at the time of" or "when" or "in response to determining."

The data processing method provided by the present application will be described in detail below.

Referring to FIG. 1, FIG. 1 is a flowchart of a data processing method provided by the present application, which is applied to a local electronic device. The local electronic device may be, but is not limited to, a network device that needs to perform message encryption. When the electronic device implements the data processing method, the method may include the following steps:

S101. Obtain a message to be encrypted.

In this step, when the local electronic device needs to send a message to the outside world, it will first obtain the message to be sent. For the encryption processing flow of the message to be encrypted, please refer to the description of the subsequent steps.

S102. Parse the to-be-encrypted message and the to-be-encrypted data and the first check code.

In this step, in order to perform encryption processing on payload data in the encrypted message, also called valid data, this embodiment proposes to first parse the to-be-encrypted data from the to-be-encrypted message. For example, the to-be-encrypted data may be the above payload data , and also parses out the check code in the to-be-encrypted message, which is recorded as the first check code.

It should be noted that the "first" in the first check code has no actual meaning, and is only used to distinguish it from the check code in the second encrypted message involved later.

S103. Determine the encryption factor corresponding to the first check code according to the obtained mapping relationship between the check code and the encryption factor.

In this step, the local electronic device will obtain the mapping relationship between the check code and the encryption factor. In this way, after parsing the first check code from the message to be encrypted, it will determine based on the above mapping relationship. The encryption factor corresponding to the first check code is obtained.

Optionally, the mapping relationship between the verification code and the encryption factor is obtained from a mapping relationship distribution center.

Specifically, the local electronic device may actively acquire the above-mentioned mapping relationship from the mapping relationship distribution center in real time or periodically, or may wait to receive the distribution center of the mapping relationship.

In an embodiment, the above-mentioned mapping relationship may be a mapping relationship composed of the check code and the specific value of the encryption factor, that is, the mapping relationship distribution center may configure the encryption factor for various check codes in advance according to experience, and then assign the check code. The mapping relationship with the encryption factor is written into the mapping relationship list and sent to the local electronic device. In this way, after the local electronic device parses the first check code from the message to be encrypted, it can use the first check code to query the mapping relationship list to query the encryption factor corresponding to the first check code.

In another embodiment, since the check code itself is calculated based on the valid data in the message, and the check codes obtained by different valid data are different, therefore, the mapping relationship distribution center exhausts the check codes and needs to consume more In view of the large workload, this embodiment proposes that the above-mentioned mapping relationship may also be a mapping relationship formula, that is, the mapping relationship distribution center configures a mapping relationship formula, and then delivers the mapping relationship formula to the local electronic device. For example, the mapping relationship is B=g(A), where A is a check code, B is an encryption factor, and g() is a mapping function. In this way, the mapping relationship distribution center can deliver the currently used mapping relationship to the local electronic device, and then the local electronic device stores the mapping relationship locally. Furthermore, after the local electronic device parses the first check code, the first check code can be used as A in the mapping relationship, and then the encryption factor B can be calculated to obtain the first check code. the corresponding encryption factor. In this way, not only the storage resources of the mapping relationship of the mapping relationship distribution center are saved, but also the storage resources of the local electronic device for storing the mapping relationship are saved. Moreover, in this embodiment, the mapping relationship distribution center issues the mapping relationship formula, which is no longer like the method of the third party passing the key given in the prior art. It only needs to generate an encryption factor in the electronic device at the local end, which is set by This greatly improves the security of the key, thereby improving the security of encrypting the data to be encrypted with the encryption factor, and at the same time ensuring the security of the encrypted data in subsequent transmissions.

Optionally, the above-mentioned mapping function can be implemented by, but not limited to, standard algorithms, such as SHA-1 secure hash algorithm and other algorithms.

It should be noted that the above-mentioned mapping relationship may be dynamically updated. When the mapping relationship in the mapping relationship distribution center changes, the latest mapping relationship will be delivered to the local electronic device.

Optionally, when delivering the mapping relationship to the local electronic device, the mapping relationship distribution center may send the mapping relationship in an encrypted form. Specifically, the mapping relationship distribution center will encrypt the mapping relationship, and then encrypt the encrypted mapping relationship. It is issued to the local electronic device, thereby improving the security of the mapping relationship, and further improving the security of encrypting the data to be encrypted by using the encryption factor in the mapping relationship subsequently.

S104. Encrypt the data to be encrypted by using the encryption factor to obtain first ciphertext data.

In this step, after the encryption factor is obtained based on step S103, the encryption factor can be used to encrypt the data to be encrypted, so that the corresponding ciphertext data can be obtained, which is recorded as the above-mentioned first ciphertext data.

When using the encryption factor to encrypt the data to be encrypted, an existing encryption algorithm, such as a symmetric or asymmetric encryption algorithm, can be used.

S105. Encapsulate the first ciphertext data and the first check code into a first encrypted message.

S106. Send the first encrypted message.

In step S105 and step S106, in order to be able to transmit the first ciphertext data to the opposite end, the local electronic device will encapsulate the first ciphertext data and the first check code according to the protocol between it and the opposite end device, thereby obtaining: The above-mentioned first encrypted message, in this way, the first encrypted message including the first ciphertext data can be sent to the peer device.

Optionally, the above-mentioned first check code is determined based on the data to be encrypted and a set polynomial.

Specifically, the above-mentioned first check code may be a cyclic redundancy check code (CRC). On this basis, the CRC check code is related to the selected polynomial and the data (data to be encrypted) itself. If the polynomial and the data are different, the CRC check code obtained will be different. The CRC check code of the data to be encrypted can be regarded as a random number. Taking the 4-byte check code as an example, there are more than 4.2 billion code value. The logical calculation of the CRC check code can be expressed by the following formula:

A=f(n, k)

Among them, A is the obtained CRC check code, n is the data to be encrypted, k is the selected polynomial, and f represents the logical processing relationship of the modulo 2 division. Thus, the CRC check code of each data to be encrypted can be calculated based on the above formula.

By implementing the data processing method provided by the present application, after the message to be encrypted is obtained, the data to be encrypted and the first check code are parsed from the message to be encrypted; and then according to the difference between the obtained check code and the encryption factor determine the corresponding encryption factor of the first check code; and use the encryption factor to encrypt the data to be encrypted to obtain the first ciphertext data; then encapsulate the first ciphertext data and the first check code into the first ciphertext data and the first check code an encrypted message, and send the first encrypted message. Thus, the encryption of the to-be-encrypted data in the to-be-encrypted message is realized, and the encryption factor for encrypting the to-be-encrypted data is obtained by using the check code, thereby ensuring the security of the encrypted data.

Optionally, based on the foregoing embodiment, in this embodiment, the local electronic device may also receive encrypted messages sent by other electronic devices, and on this basis, the local electronic device may implement the process shown in FIG. 2 . The decryption process includes the following steps:

S201. Receive a second encrypted message.

In this step, after the electronic device at the opposite end performs encryption processing on the message that needs to be sent to the electronic device at the local end according to the process shown in FIG. 1 , a second encrypted message is obtained, and then the second encrypted message is sent to the local end. Electronic equipment. That is, the opposite end electronic device also stores the mapping relationship between the check code and the encryption factor, and the acquisition method can refer to the acquisition method of the local electronic device, which will not be described in detail here.

S202. Parse out the second ciphertext data and the second check code from the second encrypted message.

In this step, after receiving the second encrypted message, the local electronic device can parse out the second ciphertext data and the second check code from the second encrypted message according to the message format.

S203. Determine the decryption factor corresponding to the second check code by using the obtained mapping relationship between the check code and the decryption factor.

In this step, after parsing the second check code and the second ciphertext data, the electronic device at the local end will obtain the mapping relationship between the check code and the decryption factor, and then, based on the mapping relationship, determine the relationship between the second check code and the second ciphertext data. The encryption factor corresponding to the check code.

Optionally, the mapping relationship between the check code and the decryption factor can also be obtained from the mapping relationship distribution center.

Specifically, the local electronic device may actively acquire the mapping relationship between the verification code and the decryption factor from the mapping relationship distribution center in real time or periodically, or may wait for the mapping relationship distribution center to issue it.

In an embodiment, the above-mentioned mapping relationship may be a mapping relationship composed of the check code and the specific value of the decryption factor, that is, the mapping relationship distribution center may configure the decryption factor for various check codes in advance according to experience, and then assign the check code to the decryption factor. The mapping relationship with the decryption factor is written into the mapping relationship list and sent to the local electronic device. In this way, after parsing the second check code from the second encrypted message, the local electronic device can use the second check code to query the mapping relationship list to query the decryption factor corresponding to the second check code.

In another embodiment, since the check code itself is calculated based on the valid data in the message, and the check codes obtained by different valid data are different, therefore, the mapping relationship distribution center exhausts the check codes and needs to consume more In view of the large workload, this embodiment proposes that the above-mentioned mapping relationship can also be represented by a mapping relationship formula, that is, the mapping relationship distribution center configures a mapping relationship formula for decryption, and then distributes the mapping relationship formula to this terminal electronic equipment. For example, the mapping relationship is B'=h(A), where A is the check code, B' is the decryption factor, and h() is the mapping function. In this way, the mapping relationship distribution center can deliver the currently used mapping relationship to the local electronic device, and then the local electronic device stores the mapping relationship locally. Furthermore, after the local electronic device parses the second check code, the second check code can be used as A in the mapping relationship, and then the decryption factor B' can be calculated to obtain the second check code. The decryption factor corresponding to the code. In this way, not only the storage resources of the mapping relationship of the mapping relationship distribution center are saved, but also the storage resources of the local electronic device for storing the mapping relationship are saved. Moreover, in this embodiment, the mapping relationship distribution center issues the mapping relationship expression for decryption, which is no longer the way that the third party directly transfers the key as given in the prior art. The decryption factor is generated, thereby greatly improving the security of the key, thereby improving the security of decrypting data with the decryption factor.

Optionally, the above-mentioned mapping function may be implemented by, but is not limited to, a standard algorithm, such as an algorithm such as the SHA-1 secure hash algorithm, and the above-mentioned mapping function corresponds to the above-mentioned mapping function for generating an encryption factor.

It should be noted that the mapping relationship between the above verification code and the decryption factor can be dynamically updated. When the mapping relationship in the mapping relationship distribution center changes, the latest mapping relationship will be issued to the local electronic device. In order to synchronize the local electronic device to the latest mapping relationship between the check code and the decryption factor.

Optionally, when issuing the mapping relationship to the local electronic device, the mapping relationship distribution center may send it in an encrypted form. Specifically, the mapping relationship distribution center will encrypt the mapping relationship between the check code and the decryption factor. processing, and then the encrypted mapping relationship is delivered to the local electronic device, thereby improving the security of the mapping relationship, and further improving the security of subsequent decryption of data using the decryption factor in the mapping relationship.

S204. Decrypt the second ciphertext data by using the decryption factor to obtain decrypted data.

In this step, after the local electronic device determines the decryption factor based on step S203, it can use the decryption factor to perform decryption processing on the second ciphertext data, thereby obtaining decrypted data, that is, valid data in the second encrypted message , so that subsequent processes can be performed based on the valid data.

It should be noted that, for the generation process of the second check code, reference may be made to the generation process of the first check code, which will not be described in detail here.

It is worth noting that after the electronic device at the local end sends the first encrypted message to the outside world and the electronic device at the opposite end receives the first encrypted message, the electronic device at the opposite end also stores the difference between the check code and the decryption factor. Therefore, the electronic device at the opposite end can execute the data decryption process according to the process shown in FIG. 2 , which will not be described in detail here. Moreover, for the method for obtaining the mapping relationship between the check code and the decryption factor by the opposite-end electronic device, reference may be made to the obtaining method of the local-end electronic device, which will not be described in detail here.

In order to better understand the data processing method provided by this application, the encryption and decryption processing logic shown in FIG. 3 is taken as an example for description. Since the encryption algorithm used in FIG. 3 is a symmetric encryption algorithm, the check code and the encryption factor are The mapping relationship between them, the mapping relationship between the check code and the decryption factor are the same. The mapping relationship distribution center will deliver the dynamically established mapping relationship formula B=g(A) to the electronic device at the local end and the electronic device at the opposite end.

On this basis, when the local electronic device expects to send valid data n, it will first input the valid data n and the selected polynomial into A=f(n, k), so that the CRC check code A can be obtained. The electronic device will obtain the mapping relationship formula B=g(A) distributed by the mapping relationship distribution center from the local, and then input the generated CRC check code A into B=g(A), so that the CRC check code can be obtained. A corresponds to the encryption factor B, and then the encryption factor B can be used to encrypt the valid data n, so as to obtain the ciphertext data N, and then encapsulate the ciphertext data N and the CRC check code A into an encrypted message and send it to peer electronic equipment. After receiving the encrypted message, the electronic device at the opposite end can parse out the CRC check code A from the encrypted message, and then based on the mapping relationship B=g(A) obtained locally from the mapping relationship distribution center, determine the relationship with the encrypted message. The decryption factor B corresponding to the CRC check code A, and then the decryption factor can be used to decrypt the ciphertext data N in the encrypted message, so as to decrypt the valid data to be sent by the electronic device at the local end to the electronic device at the opposite end. n. Therefore, the present application utilizes the CRC verification technology often used in data transmission, uses the original CRC verification code to establish the aforementioned mapping relationship, and uses the encryption factor obtained after mapping to encrypt the valid data, and then transmit it, thereby completing the effective Data encryption and transmission. In addition, this application does not add additional key generation processing, and can directly use the necessary CRC check code value in the data transmission process to generate the encryption factor and decryption factor, and there is no need to additionally transmit key data. The process of frequent data sending and processing avoids the process of generating a large number of additional keys, saving device performance, and at the same time, by flexibly changing the mapping relationship, better encryption results are produced.

Based on the same inventive concept, the present application also provides a data processing apparatus corresponding to the above data processing method. For the specific implementation of the data processing apparatus, reference may be made to the above description of the data processing method, which will not be discussed one by one here.

Referring to FIG. 4, FIG. 4 is a data processing apparatus provided by an exemplary embodiment of the present application, including:

an obtaining module 401, configured to obtain a message to be encrypted;

A first parsing module 402, configured to parse the to-be-encrypted data and the first check code from the to-be-encrypted message;

The first determination module 403 is configured to determine the encryption factor corresponding to the first check code according to the obtained mapping relationship between the check code and the encryption factor;

An encryption module 404, configured to perform encryption processing on the data to be encrypted by using the encryption factor to obtain first ciphertext data;

an encapsulation module 405, configured to encapsulate the first ciphertext data and the first check code into a first encrypted message;

The sending module 406 is configured to send the first encrypted message.

Optionally, based on the foregoing embodiment, the data processing apparatus provided in this embodiment further includes:

a receiving module (not shown in the figure) for receiving the second encrypted message;

a second parsing module (not shown in the figure), configured to parse out the second ciphertext data and the second check code from the second encrypted message;

The second determination module (not shown in the figure) is used to determine the decryption factor corresponding to the second check code by using the obtained mapping relationship between the check code and the decryption factor;

A decryption module (not shown in the figure), configured to decrypt the second ciphertext data by using the decryption factor to obtain decrypted data.

Optionally, based on any of the foregoing embodiments, the first check code in this embodiment is determined based on the data to be encrypted and a set polynomial.

Optionally, based on the above embodiment, the mapping relationship between the check code and the encryption factor in this embodiment is obtained from the mapping relationship distribution center; and the mapping relationship between the check code and the decryption factor is: Obtained from the mapping relationship distribution center.

In the data processing device provided by any of the embodiments of the present application, after obtaining the message to be encrypted, the data to be encrypted and the first check code are parsed from the message to be encrypted; and then according to the obtained check code and encryption The mapping relationship between the factors is used to determine the encryption factor corresponding to the first check code; and the encryption factor is used to encrypt the data to be encrypted to obtain the first ciphertext data; then the first ciphertext data and the first check code are combined. It is encapsulated into a first encrypted message, and the first encrypted message is sent. Thus, the encryption of the to-be-encrypted data in the to-be-encrypted message is realized, and the encryption factor for encrypting the to-be-encrypted data is obtained by using the check code, thereby ensuring the security of the encrypted data.

Based on the same inventive concept, an embodiment of the present application provides an electronic device, which may be, but is not limited to, the above-mentioned local electronic device or opposite-end electronic device. As shown in FIG. 5 , the electronic device includes a processor 501 and a machine-readable storage medium 502, where the machine-readable storage medium 502 stores a computer program that can be executed by the processor 501, and the processor 501 is caused by the computer program to execute any task in the present application. A data processing method provided by an embodiment. In addition, the electronic device further includes a communication interface 503 and a communication bus 504 , wherein the processor 501 , the communication interface 503 , and the machine-readable storage medium 502 communicate with each other through the communication bus 504 .

The communication bus mentioned in the above electronic device may be a peripheral component interconnect standard (Peripheral Component Interconnect, PCI) bus or an Extended Industry Standard Architecture (Extended Industry Standard Architecture, EISA) bus or the like. The communication bus can be divided into an address bus, a data bus, a control bus, and the like. For ease of presentation, only one thick line is used in the figure, but it does not mean that there is only one bus or one type of bus.

The communication interface is used for communication between the above electronic device and other devices.

The above-mentioned machine-readable storage medium 502 may be a memory, and the memory may include random access memory (Random Access Memory, RAM), DDR SRAM (Double Data Rate Synchronous Dynamic Random Access Memory, double-rate synchronous dynamic random access memory), or may include Non-volatile memory (Non-Volatile Memory, NVM), such as at least one disk memory. Optionally, the memory may also be at least one storage device located away from the aforementioned processor.

The above-mentioned processor may be a general-purpose processor, including a central processing unit (CPU), a network processor (NP), etc.; it may also be a digital signal processor (Digital Signal Processor, DSP), an application-specific integrated circuit (Application Specific Integrated Circuit, ASIC), Field-Programmable Gate Array (Field-Programmable Gate Array, FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components.

For the embodiments of the electronic device and the machine-readable storage medium, since the content of the methods involved is basically similar to the foregoing method embodiments, the description is relatively simple, and reference may be made to some descriptions of the method embodiments for related parts.

It should be noted that, in this document, relational terms such as first and second are only used to distinguish one entity or operation from another entity or operation, and do not necessarily require or imply any relationship between these entities or operations. any such actual relationship or sequence exists. Moreover, the terms "comprising", "comprising" or any other variation thereof are intended to encompass a non-exclusive inclusion such that a process, method, article or device that includes a list of elements includes not only those elements, but also includes not explicitly listed or other elements inherent to such a process, method, article or apparatus. Without further limitation, an element qualified by the phrase "comprising a..." does not preclude the presence of additional identical elements in a process, method, article or apparatus that includes the element.

For details of the implementation process of the functions and functions of each unit/module in the above-mentioned apparatus, please refer to the implementation process of the corresponding steps in the above-mentioned method, which will not be repeated here.

For the apparatus embodiments, since they basically correspond to the method embodiments, reference may be made to the partial descriptions of the method embodiments for related parts. The apparatus embodiments described above are only illustrative, wherein the units/modules described as separate components may or may not be physically separated, and components shown as units/modules may or may not be physical units /module, i.e. can be located in one place, or can be distributed over multiple network elements/modules. Some or all of the units/modules may be selected according to actual needs to achieve the purpose of the solution of the present application. Those of ordinary skill in the art can understand and implement it without creative effort.

The above descriptions are only preferred embodiments of the present application, and are not intended to limit the present application. Any modifications, equivalent replacements, improvements, etc. made within the spirit and principles of the present application shall be included in the present application. within the scope of protection.

Claims (10)

1. A data processing method, comprising:

acquiring a message to be encrypted;

analyzing data to be encrypted and a first check code from the message to be encrypted;

determining an encryption factor corresponding to the first check code according to the obtained mapping relation between the check code and the encryption factor;

encrypting the data to be encrypted by using the encryption factor to obtain first ciphertext data;

packaging the first ciphertext data and the first check code into a first encrypted message;

and sending the first encrypted message.

2. The method of claim 1, further comprising:

receiving a second encrypted message;

analyzing second ciphertext data and a second check code from the second encryption message;

determining a decryption factor corresponding to the second check code by using the acquired mapping relation between the check code and the decryption factor;

and decrypting the second ciphertext data by using the decryption factor to obtain decrypted data.

3. The method of claim 1, wherein the first check code is determined based on the data to be encrypted and a set polynomial.

4. The method according to claim 2, wherein the mapping relationship between the check code and the encryption factor is obtained from a mapping relationship distribution center; and the mapping relation between the check code and the decryption factor is obtained from a mapping relation distribution center.

5. A data processing apparatus, comprising:

the acquisition module is used for acquiring a message to be encrypted;

the first analysis module is used for analyzing the data to be encrypted and the first check code from the message to be encrypted;

the first determining module is used for determining an encryption factor corresponding to the first check code according to the mapping relation between the acquired check code and the encryption factor;

the encryption module is used for encrypting the data to be encrypted by using the encryption factor to obtain first ciphertext data;

the encapsulation module is used for encapsulating the first ciphertext data and the first check code into a first encryption message;

and the sending module is used for sending the first encrypted message.

6. The apparatus of claim 5, further comprising:

the receiving module is used for receiving the second encrypted message;

the second analysis module is used for analyzing second ciphertext data and a second check code from the second encrypted message;

the second determining module is used for determining a decryption factor corresponding to the second check code by using the acquired mapping relation between the check code and the decryption factor;

and the decryption module is used for decrypting the second ciphertext data by using the decryption factor to obtain decrypted data.

7. The apparatus of claim 5, wherein the first check code is determined based on the data to be encrypted and a set polynomial.

8. The apparatus according to claim 6, wherein the mapping relationship between the check code and the encryption factor is obtained from a mapping relationship distribution center; and the mapping relation between the check code and the decryption factor is obtained from a mapping relation distribution center.

9. An electronic device comprising a processor and a machine-readable storage medium, the machine-readable storage medium storing a computer program executable by the processor, the processor being caused by the computer program to perform the method of any of claims 1-4.

10. A machine readable storage medium, having stored thereon a computer program which, when invoked and executed by a processor, causes the processor to perform the method of any of claims 1-4.

Images