Data encryption method, device, equipment and readable storage medium
By dividing the seed key into two branches and performing specific processing, the problem of low data security in the QNSC system is solved, and the security and noise tolerance of the optical communication system are improved.
Patent Information
- Application Number
- CN202311271860.4
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2023-09-28
- Publication Date
- 2025-09-09
- Estimated Expiration
- 2043-09-28
AI Technical Summary
Existing QNSC-based data encryption methods have the problem of low data security, especially during optical fiber transmission, where the lowest bit of the base information is at risk of leakage and the low bit is easily affected by noise.
The seed key is divided into two branches of keys. The plaintext data is encrypted using the key of the first branch, and the key of the second branch is shaped to generate a base space. The base information is gathered around the base space, and then the first ciphertext symbol is expanded and distributed near the decision threshold of the low-order ciphertext.
It improves data security, reduces the tolerance of high-bit bits to noise, and enhances the anti-eavesdropping capability of optical communication systems.
Smart Images

Figure CN119728088B_ABST
Abstract
Description
Technical Field
[0001] The present application relates to the field of data encryption, and in particular to a data encryption method, apparatus, device and readable storage medium. Background Art
[0002] With the continuous development of the communications industry, an increasing number of data centers have been built to support various network services. Optical communications, as a high-speed, high-capacity data transmission technology, has become the core of modern communications networks. However, with the advancement of communications technology, the physical layer security of fiber optic links faces new challenges and threats. Traditional optical communication systems have several weaknesses in physical layer security. Because optical signals can propagate with low loss in optical fibers, attackers can obtain communication content through non-invasive eavesdropping, known as fiber optic eavesdropping attacks, which can lead to information leakage or unauthorized access.
[0003] To address this security issue, exploration of physical-layer encryption technologies has begun. Physical-layer encryption technologies leverage the characteristics of optical signals and quantum noise to enhance communication security. Quantum Noise Stream Cipher (QNSC) has become a currently mainstream physical-layer encryption scheme. QNSC utilizes the inevitable quantum noise in optical fibers as an encryption source, making it difficult for eavesdroppers to separate and decode the original information, thereby achieving a high level of security. Additionally, other physical-layer encryption technologies, such as phase modulation-based encryption and time expansion-based encryption, are also under research and development. These technologies leverage the phase and timing characteristics of optical signals for encryption and decryption, enhancing the confidentiality and integrity of communications.
[0004] In summary, physical layer security in optical communications is a crucial area for ensuring data transmission security. By employing physical layer-based encryption technologies, such as quantum noise stream encryption, optical communication systems can improve their ability to resist eavesdropping and attacks, ensuring the confidentiality of communication data.
[0005] In the QNSC system, the base information is the key used to encrypt plaintext. The specific operation is: the lowest bit of the base information is XORed with the plaintext to encrypt the plaintext, resulting in a low-order ciphertext. The base information and low-order ciphertext then form a high-order ciphertext symbol, with the base information placed in the low-order bits and the low-order ciphertext placed in the high-order bits. According to encryption rules, the ciphertext symbol also contains the base information. Quantum noise is a small noise that may not adequately mask the base information. During fiber optic transmission, an unauthorized party could obtain a portion of the optical signal through a light-stealing attack, resulting in the risk of leakage of the lowest bit of the base information.
[0006] Furthermore, in a QNSC system, symbols of a low-order modulation format (such as QPSK) are encrypted and randomly mapped to higher-order symbols (such as 256×256QAM). Each ciphertext symbol is composed of multiple bits, with the low-order bits representing the base information and the high-order bits representing the low-order ciphertext information. After being masked by quantum noise, the ciphertext symbols are affected by quantum noise and shifted, ultimately leading to incorrect ciphertext symbol judgments. Different bits within a ciphertext symbol have different weights and tolerances to noise, making low-order bits more susceptible to noise and resulting in bit flips. Quantum noise is a small noise that has a minimal impact on high-order bits. While unauthorized parties cannot intercept the low-order bits during transmission, they can obtain the high-order, low-order ciphertext information, posing a security risk. Summary of the Invention
[0007] The embodiments of the present application provide a data encryption method, apparatus, device, and readable storage medium to solve the problem of low data security in the prior art data encryption method based on QNSC.
[0008] To solve the above technical problems, this application is implemented as follows:
[0009] In a first aspect, an embodiment of the present application provides a data encryption method, the method comprising: dividing a seed key to obtain a key of a first branch and a key of a second branch; encrypting plaintext data based on the key of the first branch, and modulating the encrypted data to obtain a first ciphertext symbol; shaping the key of the second branch, and generating a base space based on the shaping result, wherein base information in the base space is gathered around the base space, and the base information corresponds to the key of the second branch; and expanding the first ciphertext symbol based on the base space to obtain a second ciphertext symbol.
[0010] In second aspect, an embodiment of the present application provides a data encryption device, including: a division module, used to divide the seed key to obtain the key of the first branch and the key of the second branch; a first processing module, used to encrypt plaintext data based on the key of the first branch, and modulate the encrypted data to obtain a first ciphertext symbol; a second processing module, used to shape the key of the second branch, and generate a base space based on the shaping result, wherein the base information in the base space is gathered around the base space, and the base information corresponds to the key of the second branch; an expansion module, used to expand the first ciphertext symbol based on the base space to obtain a second ciphertext symbol.
[0011] In a third aspect, an embodiment of the present application provides a communication device, comprising a transceiver and a processor; wherein the processor is used to divide a seed key to obtain a key of a first branch and a key of a second branch; the processor is also used to encrypt plaintext data based on the key of the first branch, and modulate the encrypted data to obtain a first ciphertext symbol, and to shape the key of the second branch, and generate a base space based on the shaping result, and to expand the first ciphertext symbol based on the base space to obtain a second ciphertext symbol; wherein the base information in the base space is gathered around the base space, and the base information corresponds to the key of the second branch.
[0012] In a fourth aspect, an embodiment of the present application provides a communication device, comprising: a processor, a memory, and a program stored in the memory and executable on the processor, wherein the program, when executed by the processor, implements the steps of the data encryption method as described in the first aspect above.
[0013] In a fifth aspect, an embodiment of the present application provides a computer-readable storage medium, on which a computer program is stored. When the computer program is executed by a processor, the steps of the data encryption method described in the first aspect above are implemented.
[0014] In the embodiment of the present application, after the seed key is divided into two branches, the plaintext data is encrypted using the key of the first branch, rather than encrypting the lowest bit of the base information with the plaintext information by XOR. The key of the first branch is not transmitted on the optical fiber and therefore cannot be intercepted, thereby improving data security. In addition, in the embodiment of the present application, after the key of the second branch is shaped, the base information is gathered in the surrounding base space, and then the first ciphertext symbol is expanded to obtain a high-order ciphertext symbol, that is, the ciphertext is distributed near the decision threshold of the low-order ciphertext, reducing the noise tolerance of the ciphertext in the high-bit position, and thus improving data security compared to the existing technology. BRIEF DESCRIPTION OF THE DRAWINGS
[0015] In order to more clearly illustrate the technical solutions of the embodiments of the present application, the following briefly introduces the drawings required for use in the description of the embodiments of the present application. Obviously, the drawings described below are only some embodiments of the present application. For ordinary technicians in this field, other drawings can be obtained based on these drawings without any creative work.
[0016] Figure 1 This is a flow chart of a data encryption method provided by an embodiment of the present application;
[0017] Figure 2This is a flowchart of a method for enhancing the security of quantum noise stream encryption based on a ciphertext symbol aggregation decision threshold in a specific implementation manner provided by an embodiment of the present application;
[0018] Figure 3 This is a schematic diagram of the structure of a data encryption device provided in an embodiment of the present application;
[0019] Figure 4 This is a schematic diagram of a communication device provided in an embodiment of the present application. DETAILED DESCRIPTION
[0020] The following will be combined with the drawings in the embodiments of this application to clearly and completely describe the technical solutions in the embodiments of this application. Obviously, the embodiments described are part of the embodiments of this application, not all of them. Based on the embodiments in this application, all other embodiments obtained by ordinary technicians in this field without making creative efforts are within the scope of protection of this application.
[0021] It should be noted that the QNSC encryption methods in this application mainly include multi-level mapping intensity shift keying (ISK), phase rotation phase shift keying (PSK), and quadrature amplitude modulation (QAM) of phase and intensity modulation. These methods achieve encryption and decryption operations by modulating and demodulating optical signals.
[0022] Multi-level intensity-shifted keying (ISK): This technology uses optical signals of varying intensity levels to represent information. During encryption, data is subjected to an operation (e.g., XOR) with a key to generate the encrypted data. The encrypted data is then mapped onto optical signals of varying intensity levels for transmission. At the receiving end, the received optical signal is converted back into the original data through demodulation and decryption.
[0023] Phase-rotation phase-shift keying (PSK): Different phases are used to represent different data information. During the encryption process, the data is calculated by applying a key to the encrypted data. The encrypted data is then mapped onto optical signals with different phases for transmission. The receiver uses phase-shift demodulation and decryption to convert the received phase signal into the original data.
[0024] Quadrature Amplitude Modulation (QAM) uses phase and intensity modulation to represent information. During encryption, the data is combined with a key to generate encrypted data. The encrypted data is then mapped onto optical signals with varying phases and intensity levels for transmission. At the receiving end, demodulation and decryption are performed to convert the received optical signal into the original data.
[0025] As can be seen, all of the aforementioned QNSC encryption methods utilize the characteristics of optical signals for encryption and decryption. During the encryption process, data is combined with a key to generate encrypted data. This encrypted data is then mapped onto an optical signal for transmission using a suitable modulation method. At the receiving end, the received optical signal is converted back into the original data through corresponding demodulation and decryption operations. These methods can improve data security and have widespread application in optical communication systems.
[0026] Probability Constellation Shaping (PCS) is a modulation technique used to improve the performance of optical communication systems. It optimizes the distribution probability of constellation points to adapt to the characteristics of the communication channel, thereby achieving higher transmission rates and lower bit error rates. In existing constellation modulation, constellation points are typically evenly distributed across the constellation diagram. However, this uniform distribution can result in lower transmission efficiency and higher bit error rates under certain channel conditions. Probability constellation shaping (PCS) modifies the distribution probability of constellation points to make them more adaptable to channel conditions. Specifically, PCS allocates more constellation points to more favorable areas of the channel and reduces the number of constellation points in less favorable areas. This maximizes the efficiency of constellation point utilization and improves fault tolerance of transmitted signals under harsh channel conditions. PCS uses an optimization algorithm to determine the optimal constellation point distribution probability based on the statistical characteristics of the channel quality. Through PCS, optical communication systems can achieve higher transmission rates and lower bit error rates, thereby improving system performance and reliability. This technology has broad applications in high-speed optical communication systems, particularly in fiber-optic transmission and optical wireless communications.
[0027] See also Figure 1 , Figure 1 This is a flow chart of a data encryption method provided by an embodiment of the present application. Figure 1 As shown, the method includes the following steps:
[0028] Step 101: Divide the seed key to obtain the key of the first branch and the key of the second branch;
[0029] It should be noted that the seed key in the embodiment of the present application refers to the initial key used to start the key update process or the key generation process.
[0030] Step 102: Encrypt the plaintext data based on the key of the first branch, and modulate the encrypted data to obtain a first ciphertext symbol;
[0031] In a specific implementation of the embodiment of the present application, encryption can be performed using an XOR algorithm. For example, if the plaintext data is 0111101 and the key of the first branch is 101001, then after XORing the two, the first ciphertext symbol can be obtained: 110100. It can be seen that in the embodiment of the application, another set of keys is used to perform XOR with the plaintext data, rather than XORing the lowest bit of the base information with the plaintext information to encrypt the plaintext information and obtain low-order ciphertext information as in the prior art. Therefore, the key used as the first branch of XOR encryption in the embodiment of the present application will not be transmitted through the optical fiber, and the probability of being intercepted is low, which improves the security of the data compared to the solutions in the prior art.
[0032] Step 103: shaping the key of the second branch, and generating a basis space based on the shaping result, wherein basis information in the basis space is gathered around the base space, and the basis information corresponds to the key of the second branch;
[0033] Step 104: Expand the first ciphertext symbol based on the basis space to obtain a second ciphertext symbol.
[0034] As can be seen, in the embodiment of the present application, after shaping the key of the second branch, the base information is gathered in the surrounding base space, and then the first ciphertext symbol is expanded to obtain the high-order ciphertext symbol. Because ciphertext symbols are composed of multiple bits, the low-order bits are the base information and the high-order bits are the low-order ciphertext information. Based on this, in the embodiment of the present application, after distributing the ciphertext near the decision threshold of the low-order ciphertext, the noise tolerance of the ciphertext in the high-order bits is reduced, and bit flips can occur even when encountering small noise, thereby improving data security.
[0035] Therefore, through steps 101 to 104 above, after the seed key is divided into two branch keys, the plaintext data is encrypted using the key of the first branch, rather than encrypting the lowest bit of the base information with the plaintext information by XOR. The key of the first branch is not transmitted on the optical fiber and therefore cannot be intercepted, thereby improving data security. In addition, in the embodiment of the present application, after the key of the second branch is shaped, the base information is gathered in the surrounding base space, and then the first ciphertext symbol is expanded to obtain a high-order ciphertext symbol, that is, the ciphertext is distributed near the decision threshold of the low-order ciphertext, reducing the noise tolerance of the ciphertext in the high-bit position, and thus improving data security compared to the existing technology.
[0036] In an optional implementation manner in the embodiment of the present application, the method of encrypting the plaintext data based on the first branch key involved in the above step 102 may further include:
[0037] Step 11: Expand the key of the first branch based on a first pseudo-random number generator to obtain a first running key, wherein the first running key is a pseudo-random number sequence;
[0038] It should be noted that the role of the first pseudo-random number generator (PRNG) in the embodiment of the present application is to expand a small amount of seed key (the key in the first branch) to a sufficient number of running keys. Specifically, it can be based on a starting seed value (the key in the first branch) and process the seed value through the target algorithm to generate a continuous pseudo-random number sequence. The pseudo-random number sequence generated by the first pseudo-random number generator is statistically close to a true random number sequence, but is actually generated through a deterministic calculation process.
[0039] Step 21: Perform XOR processing on the first running key and the plaintext data to obtain ciphertext bits.
[0040] In this regard, in a specific example, the plaintext data and the running key in the first branch of the present application are encrypted at the bit level. The specific encryption algorithm can be an XOR algorithm to obtain the ciphertext bits after the XOR of the two. Furthermore, if the plaintext data is 011101 and the first running key is 101001, the ciphertext bits obtained after the XOR is 110100.
[0041] As can be seen, in the embodiment of the application, another set of keys (the key of the first branch) is used to perform XOR with the plaintext data, rather than XORing the lowest bit of the base information with the plaintext information to encrypt the plaintext information and obtain the low-order ciphertext information as in the prior art. Therefore, the key of the first branch used for XOR encryption in the embodiment of the application does not pass through the optical fiber transmission, and the probability of being intercepted is low, which improves data security compared to the solutions in the prior art.
[0042] In an optional implementation manner of the embodiment of the present application, the method of modulating the encrypted data to obtain the first ciphertext symbol involved in the above step 102 may further include:
[0043] Step 21: modulate the ciphertext bits to obtain a first ciphertext symbol, wherein the first ciphertext symbol is a 16QAM (Quadrature Amplitude Modulation) symbol.
[0044] It can be seen that in the embodiment of the present application, the ciphertext bits can be modulated based on the 16QAM encoding method to obtain a first ciphertext symbol, which is a low-order ciphertext symbol so as to be subsequently expanded to a high order.
[0045] In an optional implementation of the embodiment of the present application, the method of shaping the key of the second branch involved in step 103 and generating the basis space based on the shaping result may further include:
[0046] Step 31: Expand the key of the second branch based on a second pseudo-random number generator to obtain a second running key, wherein the second running key is a pseudo-random number sequence;
[0047] It should be noted that the function of the second pseudo-random number generator is similar to that of the first pseudo-random number generator in the above-mentioned embodiment of the present application, that is, to expand a small amount of seed keys (keys in the second branch) to a sufficient number of running keys.
[0048] Step 32: Divide the second running key into two running keys;
[0049] Step 33: Input the two running keys into the corresponding constant component distribution matching modules respectively, and output two ciphertext symbols with inverse Gaussian probability distribution; wherein the ciphertext symbols are basis information;
[0050] It can be seen that in order to generate the basis space in the embodiment of the present application, the second running key needs to be divided into two running keys, and the two running keys are first shaped, specifically by the Constant Composition Distribution Matching (CCDM) module. In the specific example, the parameters of CCDM are preset, such as block length, distribution probability, etc. The block length is set to an appropriate length to reduce the computational complexity. For example, the block length is 1000, and the distribution probability adopts the inverse Gaussian distribution, and its distribution expression is
[0051] Where λ is the probability shaping factor and D is the range of x.
[0052] Step 34: Superimpose two ciphertext symbols with inverse Gaussian probability distribution to obtain a basis space.
[0053] As can be seen, in the embodiment of the present application, after CCDM-based shaping, ciphertext symbols with an inverse Gaussian probability distribution can be obtained. Furthermore, superimposing these two ciphertext symbols can yield a base space, in which the base information is concentrated around the base space. As can be seen, in the embodiment of the present application, concentrating the base information around the base space distributes the ciphertext near the decision threshold of the low-order ciphertext, thereby reducing the noise tolerance of high-order bits. Therefore, bit flips can occur even in the presence of small noise, thereby improving data security.
[0054] In an optional implementation of the embodiment of the present application, the method of expanding the first ciphertext symbol based on the basis space to obtain the second ciphertext symbol involved in the above step 104 may further include:
[0055] Step 41: Expand the 16QAM symbol based on the base information in the base space to obtain a second ciphertext symbol, wherein the second ciphertext symbol is a QAM symbol.
[0056] In this embodiment of the present application, the 16QAM symbol is expanded by the following formula:
[0057] E=D*2 M-2 +2*B-2 M-2 +1
[0058] Among them, D is the coordinate value of the 16QAM symbol, B is the base information, M is the order of the QAM symbol, and E is the coordinate value of the QAM symbol.
[0059] The present application is described below with reference to a specific embodiment of the present application. This specific embodiment provides a quantum noise stream encryption security enhancement method based on a ciphertext symbol aggregation decision threshold. Figure 2 This is a flow chart of the quantum noise stream encryption security enhancement method based on the ciphertext symbol aggregation decision threshold in this specific implementation method. Figure 2 The steps of the quantum noise stream encryption security enhancement method based on ciphertext symbol aggregation decision threshold include:
[0060] Step 201: key splitting, that is, splitting the seed key into two branches, Key1 (key of the first branch) and Key2 (key of the second branch);
[0061] Step 202, key expansion, is to pass the keys Key1 and Key2 through two pseudo-random number generators (PRNG1 and PRNG2) respectively, to expand a small amount of seed key into a sufficient number of running keys.
[0062] Among them, the working principle of PRNG is usually based on a starting seed value, and the seed value is processed through a series of mathematical operations or algorithms to generate a continuous pseudo-random number sequence. Although the generated pseudo-random number sequence appears statistically close to a true random number sequence, it is actually generated through a deterministic calculation process.
[0063] Step 203: bit encryption, that is, the plaintext data and the upper branch running key (Key1) are encrypted at the bit level, and the encryption algorithm is XOR to obtain ciphertext bits.
[0064] In a specific example, for example, the plaintext data is 011101 and the running key is 101001, then the ciphertext bits obtained after XOR is 110100.
[0065] Step 204, QAM modulation, is to modulate the ciphertext bits into 16QAM symbols according to the 16QAM encoding method, and the result is shown in Step 1.
[0066] Step 205: CCDM initialization, ie, presetting the parameters of the constant distribution matcher (CCDM), such as block length, distribution probability, etc.
[0067] The block length is set to an appropriate length to reduce the computational complexity. For example, the block length is 1000 and the distribution probability adopts the inverse Gaussian distribution, whose distribution expression is:
[0068] Where λ is the probability shaping factor and D is the range of x.
[0069] Step 206, base shaping;
[0070] It should be noted that the lower branch running key is also called base information (bases), so the base information is divided into two paths, I and Q, and then input into the CCDM module to complete the shaping operation. The output symbol is a symbol with the characteristics of inverse Gaussian probability distribution, and then the two paths of base information are superimposed to generate a base space. In the base space, the base information is gathered around the base space, such as Figure 2 In the base space shown in FIG, the dark area is the base information distribution area.
[0071] Step 207, space expansion;
[0072] The modulation format of the base information extended data is extended from 16QAM to high-order QAM, and the extended expression is E=D*2 M-2 +2*B-2 M-2 +1, where D is the coordinate value of the 16QAM ciphertext symbol, B is the base information, M is the high-order QAM order, and E is the coordinate value of the high-order QAM ciphertext symbol. Figure 2 As described above, the result after space expansion is shown in Step 2, that is, the base information in each base space of the 16 symbols is distributed around the base space.
[0073] As can be seen, in this specific embodiment, by changing the distribution of the base information, the ciphertext is distributed near the decision threshold of the low-order ciphertext, reducing the noise tolerance of the high-order bits. Therefore, bit flips can occur even in the presence of small noise, thereby improving data security. Furthermore, to prevent the exposure of the lowest bit of the base information and the resulting security degradation, this specific embodiment uses another set of keys to XOR with the plaintext data, rather than XORing the lowest bit of the base information with the plaintext data as in the prior art. This set of keys in this specific embodiment does not pass through optical fiber transmission, and the probability of interception is lower, thus improving data security compared to the prior art.
[0074] See also Figure 3 , Figure 3 This is a schematic diagram of the structure of a data encryption device provided in an embodiment of the present application. Figure 3 As shown, the device includes:
[0075] A division module 302 is configured to divide the seed key to obtain a first branch key and a second branch key;
[0076] A first processing module 304 is configured to encrypt the plaintext data based on the key of the first branch and modulate the encrypted data to obtain a first ciphertext symbol;
[0077] A second processing module 306 is configured to reshape the key of the second branch and generate a basis space based on the reshaping result, wherein basis information in the basis space is gathered around the base space, and the basis information corresponds to the key of the second branch;
[0078] The expansion module 308 is configured to expand the first ciphertext symbol based on the basis space to obtain the second ciphertext symbol.
[0079] Optionally, the first processing module 304 in the embodiment of the present application may further include: a first expansion unit, used to expand the key of the first branch based on a first pseudo-random number generator to obtain a first running key, wherein the first running key is a pseudo-random number sequence; a first processing unit, used to perform XOR processing on the first running key and plaintext data to obtain ciphertext bits.
[0080] Optionally, the first processing module 304 in the embodiment of the present application may further include: a modulation unit, configured to modulate the ciphertext bits to obtain a first ciphertext symbol, wherein the first ciphertext symbol is a 16QAM symbol.
[0081] Optionally, the second processing module 306 in the embodiment of the present application may further include: a second expansion unit, used to expand the key of the second branch based on a second pseudo-random number generator to obtain a second running key, wherein the second running key is a pseudo-random number sequence; a division unit, used to divide the second running key into two running keys; a second processing unit, used to input the two running keys into the corresponding constant component distribution matching modules respectively, and output two ciphertext symbols with inverse Gaussian probability distribution; wherein the ciphertext symbols are basis information; a third processing unit, used to superimpose the two ciphertext symbols with inverse Gaussian probability distribution to obtain a basis space.
[0082] Optionally, the expansion module 308 in the embodiment of the present application may further include: an expansion unit, configured to expand the 16QAM symbol based on the base information in the base space to obtain a second ciphertext symbol, wherein the second ciphertext symbol is a QAM symbol.
[0083] Optionally, in the embodiment of the present application, the 16QAM symbol may be expanded using the following formula:
[0084] E=D*2 M-2 +2*B-2 M-2 +1
[0085] Among them, D is the coordinate value of the 16QAM symbol, B is the base information, M is the order of the QAM symbol, and E is the coordinate value of the QAM symbol.
[0086] It should be noted that the data encryption device provided in the embodiment of the present application is capable of executing the above Figure 1 For a device for the data encryption method in the implementation manner, all implementation methods in the above data encryption method embodiments are applicable to the data encryption device and can achieve the same or similar beneficial effects.
[0087] For details, see Figure 4 As shown, an embodiment of the present application further provides a communication device, including a bus 401, a transceiver 402, an antenna 403, a bus interface 404, a processor 405 and a memory 406.
[0088] Processor 405 is configured to divide the seed key to obtain two branch keys, where the two branch keys include a first branch key and a second branch key;
[0089] Processor 405 is further configured to encrypt plaintext data based on the key of the first branch, modulate the encrypted data to obtain a first ciphertext symbol, shape the key of the second branch, generate a basis space based on the shaping result, and expand the first ciphertext symbol based on the basis space to obtain a second ciphertext symbol; wherein basis information in the basis space is gathered around the basis space, and the basis information corresponds to the key of the second branch.
[0090] exist Figure 4 In the embodiment, the bus architecture (represented by bus 401) is shown. Bus 401 may include any number of interconnected buses and bridges. Bus 401 links together various circuits including one or more processors represented by processor 405 and memory represented by memory 406. Bus 401 may also link together various other circuits such as peripheral devices, voltage regulators, and power management circuits, which are well known in the art and are therefore not described further herein. Bus interface 404 provides an interface between bus 401 and transceiver 402. Transceiver 402 may be one element or multiple elements, such as multiple receivers and transmitters, providing a unit for communicating with various other devices on a transmission medium. Data processed by processor 405 is transmitted on a wireless medium via antenna 403. Furthermore, antenna 403 receives data and transmits the data to processor 405.
[0091] Processor 405 is responsible for managing bus 401 and general processing, and may also provide various functions, including timing, peripheral interfaces, voltage regulation, power management, and other control functions. Memory 406 may be used to store data used by processor 405 when performing operations.
[0092] Optionally, the processor 405 may be a CPU, an ASIC, an FPGA, or a CPLD.
[0093] It should be noted that the communication device provided in the embodiment of the present application is capable of performing the above Figure 1 For the apparatus of the method for data encryption in the embodiment, all implementation methods of the above-mentioned method for data encryption are applicable to the communication device and can achieve the same or similar beneficial effects.
[0094] The embodiment of the present application also provides a communication device, comprising: a processor, a memory, and a program stored in the memory and executable on the processor, wherein the program is executed by the processor to implement the above Figure 1 The various processes of the data encryption method embodiment shown can achieve the same technical effect. To avoid repetition, they will not be described here.
[0095] The present application also provides a computer-readable storage medium having a computer program stored thereon. When the computer program is executed by a processor, the computer program implements the various processes of the data encryption method embodiment shown in 1 above and can achieve the same technical effect. To avoid repetition, the details are not described here. The computer-readable storage medium is, for example, a read-only memory (ROM), a random access memory (RAM), a magnetic disk, or an optical disk.
[0096] It should be noted that, in this document, the terms "comprises," "includes," or any other variations thereof are intended to encompass non-exclusive inclusion, such that a process, method, article, or apparatus comprising a series of elements includes not only those elements but also other elements not explicitly listed, or elements inherent to such process, method, article, or apparatus. In the absence of further limitations, an element defined by the phrase "comprising a ..." does not exclude the presence of other identical elements in the process, method, article, or apparatus comprising the element.
[0097] Through the description of the above implementation methods, those skilled in the art can clearly understand that the above-mentioned embodiment methods can be implemented by means of software plus the necessary general hardware platform, and of course can also be implemented by hardware, but in many cases the former is a better implementation method. Based on this understanding, the technical solution of the present application, or the part that contributes to the prior art, can be embodied in the form of a software product, which is stored in a storage medium (such as ROM / RAM, magnetic disk, optical disk), and includes a number of instructions for enabling a terminal (which can be a mobile phone, computer, server, air conditioner, or network device, etc.) to execute the methods described in each embodiment of the present application.
[0098] The embodiments of the present application are described above in conjunction with the accompanying drawings, but the present application is not limited to the above-mentioned specific implementation methods. The above-mentioned specific implementation methods are merely illustrative and not restrictive. Under the guidance of this application, ordinary technicians in this field can also make many forms without departing from the purpose of this application and the scope of protection of the claims, all of which are within the protection of this application.
Claims
1. A data encryption method, characterized in that: The method comprises: Divide the seed key to obtain the key of the first branch and the key of the second branch; Encrypting the plaintext data based on the key of the first branch, and modulating the encrypted data to obtain a first ciphertext symbol; Reshaping the key of the second branch, and generating a base space based on the reshaping result, wherein base information in the base space is gathered around the base space, and the base information corresponds to the key of the second branch; The first ciphertext symbol is expanded based on the basis space to obtain a second ciphertext symbol.
2. The method according to claim 1, characterized in that The encrypting the plaintext data based on the key of the first branch includes: Expanding the key of the first branch based on a first pseudo-random number generator to obtain a first running key; Performing an exclusive OR process on the first running key and the plaintext data to obtain ciphertext bits.
3. The method according to claim 2, characterized in that The step of modulating the encrypted data to obtain a first ciphertext symbol includes: The ciphertext bits are modulated to obtain the first ciphertext symbols, where the first ciphertext symbols are 16QAM symbols.
4. The method according to claim 3, characterized in that Shaping the key of the second branch and generating a base space based on the shaping result includes: Expanding the key of the second branch based on a second pseudo-random number generator to obtain a second running key; Dividing the second running key into two running keys; Inputting the two running keys into the corresponding constant component distribution matching modules respectively, and outputting two ciphertext symbols with inverse Gaussian probability distribution; wherein the ciphertext symbols are basis information; The basis space is obtained by superimposing two ciphertext symbols with inverse Gaussian probability distribution.
5. The method according to claim 4, characterized in that The expanding the first ciphertext symbol based on the basis space to obtain the second ciphertext symbol includes: The 16QAM symbol is expanded based on the base information in the base space to obtain a second ciphertext symbol, wherein the second ciphertext symbol is a QAM symbol.
6. The method according to claim 5, characterized in that The 16QAM symbol is expanded by the following formula: E=D*2 M-2 +2*B-2 M-2 +1 Among them, D is the coordinate value of the 16QAM symbol, B is the base information, M is the order of the QAM symbol, and E is the coordinate value of the QAM symbol.
7. A data encryption device, characterized in that: include: A division module, used to divide the seed key to obtain a key of the first branch and a key of the second branch; a first processing module, configured to encrypt plaintext data based on the key of the first branch, and modulate the encrypted data to obtain first ciphertext symbols; a second processing module, configured to perform shaping on the key of the second branch and generate a base space based on the shaping result, wherein base information in the base space is gathered around the base space, and the base information corresponds to the key of the second branch; An expansion module is used to expand the first ciphertext symbol based on the base space to obtain a second ciphertext symbol.
8. A communication device, characterized in that: Including transceiver and processor, The processor is configured to divide the seed key to obtain a key of the first branch and a key of the second branch; The processor is further configured to encrypt plaintext data based on the key of the first branch, modulate the encrypted data to obtain a first ciphertext symbol, shape the key of the second branch, generate a base space based on the shaping result, and expand the first ciphertext symbol based on the base space to obtain a second ciphertext symbol; wherein base information in the base space is gathered around the base space, and the base information corresponds to the key of the second branch.
9. A communication device, characterized in that: include: A processor, a memory, and a program stored in the memory and executable on the processor, wherein when the program is executed by the processor, the method for data encryption according to any one of claims 1 to 6 is implemented.
10. A readable storage medium, characterized in that: The readable storage medium stores a computer program, which, when executed by a processor, implements the data encryption method according to any one of claims 1 to 6.
Citation Information
Patent Citations
QAM-based quantum noise encryption method and system
CN112291052A
Excess noise reduction for continuous variable quantum key distribution
EP4037248A1