Data encryption method, device and equipment and readable storage medium
By dividing seed keys and shaping the second branch key to generate base space, the problem of low data encryption security in the prior art is solved, and higher data security and anti-eavesdropping capabilities are achieved.
Patent Information
- Application Number
- CN202311271860.4
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2023-09-28
- Publication Date
- 2025-03-28
- Estimated Expiration
- 2043-09-28
AI Technical Summary
Existing QNSC-based data encryption methods have low problems in data security, especially in fiber-optic eavesdropping attacks, where the lowest bit of the base information may be leaked, resulting in security risks.
By dividing the seed key, the key of the first branch and the key of the second branch are obtained, the plain text data is encrypted using the key of the first branch, and the encrypted data is modulated to obtain the first ciphertext symbol. At the same time, the key of the second branch is shaped to generate a base space, the base information is collected around the base space, and the first ciphertext symbol is expanded based on this to obtain the second ciphertext symbol.
Improve data security, reduce the tolerance of ciphertexts in high bits to noise, enhance the anti-eavesdropping ability, and avoid the risk of leakage of the lowest bit of base information.
Smart Images

Figure CN119728088A_ABST
Abstract
Description
Technical Field
[0001] The present application relates to the field of data encryption, and in particular to a data encryption method, device, equipment and readable storage medium. Background Art
[0002] With the continuous development of the communication industry, more and more data centers have been built to support various network services. As a high-speed, large-capacity data transmission technology, optical communication has become the core of modern communication networks. However, with the advancement of communication technology, the physical layer security of optical fiber links faces new challenges and threats. Traditional optical communication systems have some weaknesses in physical layer security. Since optical signals can propagate with low loss in optical fibers, attackers can obtain communication content through non-invasive eavesdropping means, which is called a fiber optic eavesdropping attack, which may lead to information leakage or unauthorized access.
[0003] In order to solve this security problem, physical layer-based encryption technology has begun to be explored. Physical layer encryption technology uses the characteristics of optical signals and quantum noise to enhance the security of communications. Among them, Quantum Noise Stream Cipher (QNSC) has become a mainstream physical layer encryption scheme. QNSC uses 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 degree of security. In addition, other physical layer encryption technologies such as phase modulation-based encryption and time expansion-based encryption are also being researched and developed. These technologies use the phase and timing characteristics of optical signals for encryption and decryption operations, enhancing the confidentiality and integrity of communications.
[0004] In summary, the security of the optical communication physical layer is an important area to ensure the security of data transmission. By adopting physical layer-based encryption technology, such as quantum noise stream encryption, the anti-eavesdropping and anti-attack capabilities of the optical communication system can be improved, ensuring the confidentiality of the communication data.
[0005] In the QNSC system, the base information is the key used to encrypt the plaintext information. The specific operation is: the lowest bit of the base information is XORed with the plaintext information to encrypt the plaintext information and obtain the low-order ciphertext information; the base information and the low-order ciphertext information form a high-order ciphertext symbol, the base information is placed in the low bit position, and the low-order ciphertext information is placed in the high bit position. According to the encryption rules, the ciphertext symbol also contains the base information. Quantum noise is a small noise, and there is a possibility that the base information is not fully concealed. During the optical fiber transmission process, the illegal party can obtain part of the optical signal through the light stealing attack, resulting in the risk of leakage of the lowest bit of the base information.
[0006] In addition, in the QNSC system, symbols of low-level modulation formats (such as QPSK) are encrypted and randomly mapped to high-order symbols (such as 256×256QAM). Each ciphertext symbol is composed of multiple bits, of which the low bits are base information and the high bits are low-order ciphertext information. After being masked by quantum noise, the ciphertext symbols are disturbed by quantum noise and offset, which ultimately leads to incorrect judgments of ciphertext symbols. For a ciphertext symbol, different bit weights have different tolerances to noise, and low bits are more susceptible to noise and bit reversal. Quantum noise is a small noise that has a lower impact on high bits. When transmitting in the line, illegal parties cannot intercept low bits, but can obtain low-order ciphertext information of high bits, so there are certain security risks. 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 of the QNSC-based data encryption method in the prior art.
[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 a second aspect, an embodiment of the present application provides a data encryption device, comprising: a division module, used to divide a seed key to obtain a key of a first branch and a key of a 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 basis space based on the shaping result, wherein basis information in the basis 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 basis space based on the shaping result, and to expand the first ciphertext symbol based on the basis 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 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 branch keys, the plaintext data is encrypted by the key of the first branch, instead of encrypting the lowest bit of the base information with the plaintext information by XOR, and the key of the first branch will not be transmitted in the optical fiber, so it will not be intercepted, which improves the security of the data. In addition, in the embodiment of the present application, after the key of the second branch is shaped, the base information is collected 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, which reduces the tolerance of the ciphertext in the high-bit position to noise, and also improves the security of the data compared to the prior art. BRIEF DESCRIPTION OF THE DRAWINGS
[0015] In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings required for use in the description of the embodiments of the present application will be briefly introduced below. 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 paying any creative labor.
[0016] Figure 1 is a flow chart of a data encryption method provided in an embodiment of the present application;
[0017] Figure 2It 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 mode provided by an embodiment of the present application;
[0018] Figure 3 It is a structural schematic diagram of a data encryption device provided in an embodiment of the present application;
[0019] Figure 4 It 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 the present application to clearly and completely describe the technical solutions in the embodiments of the present application. Obviously, the described embodiments are part of the embodiments of the present application, not all of the embodiments. Based on the embodiments in the present application, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of this application.
[0021] It should be noted that the QNSC encryption method in this application mainly includes intensity shift keying (ISK) of multi-level mapping, phase shift keying (PSK) of phase rotation, and quadrature amplitude modulation (QAM) of phase and intensity modulation. These methods realize encryption and decryption operations by modulating and demodulating optical signals.
[0022] Multi-level mapped intensity keying (ISK): Information is represented based on optical signals of different intensity levels. During the encryption process, the data is operated with the key (e.g. XOR) to obtain the encrypted data. Then, the encrypted data is mapped to optical signals of different intensity levels for transmission. At the receiving end, the received optical signal is converted into the original data through demodulation and decryption operations.
[0023] Phase-rotation phase shift keying (PSK): Different phases are used to represent different data information. In the encryption process, the encrypted data is obtained by operating the data with the key. Then, the encrypted data is mapped to optical signals with different phases for transmission. The receiving end uses phase shift demodulation and decryption operations to convert the received phase signal into the original data.
[0024] Quadrature Amplitude Modulation (QAM) with phase and intensity modulation: Information is represented using optical signals with different phases and intensity levels. During the encryption process, the data is operated with the key to obtain the encrypted data. The encrypted data is then mapped onto optical signals with different phases and intensity levels for transmission. At the receiving end, the received optical signal is converted into the original data through demodulation and decryption operations.
[0025] It can be seen that the above QNSC encryption methods all use the characteristics of optical signals for encryption and decryption operations. In the encryption process, data and keys are operated to obtain encrypted data, and then the encrypted data is mapped to optical signals for transmission through a suitable modulation method. At the receiving end, the received optical signal is converted into the original data through corresponding demodulation and decryption operations. These methods can improve data security and have a wide range of applications in optical communication systems.
[0026] Probability Constellation Shaping (PCS) is a modulation technology 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 usually evenly distributed on the constellation diagram. However, this uniform distribution may lead to lower transmission efficiency and higher bit error rates under certain channel conditions. Probability constellation shaping technology changes the distribution probability of constellation points to make them more adaptable to channel conditions. Specifically, probability constellation shaping technology allocates more constellation points to more favorable areas in the channel and reduces the number of constellation points in poor areas. This can maximize the efficiency of constellation point utilization and make the transmission signal have better fault tolerance under worse channel conditions. Probability constellation shaping technology can use an optimization algorithm to determine the optimal distribution probability of constellation points based on the statistical characteristics of channel quality. Through probabilistic constellation shaping technology, optical communication systems can achieve higher transmission rates and lower bit error rates, thereby improving system performance and reliability. This technology has a wide range of applications in high-speed optical communication systems, especially in the fields of optical fiber transmission and optical wireless communication.
[0027] See also Figure 1 , Figure 1 is a flow chart of a data encryption method provided in an embodiment of the present application, such as Figure 1 As shown, the method comprises the following steps:
[0028] Step 101, dividing 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, encrypting the plaintext data based on the key of the first branch, and modulating the encrypted data to obtain a first ciphertext symbol;
[0031] In the specific implementation of the embodiment of the present application, encryption can be performed by an XOR algorithm. For example, if the plaintext data is 0111101 and the key of the first branch is 101001, the first ciphertext symbol can be obtained after the XOR of the two: 110100. It can be seen that in the application embodiment, 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 as in the prior art, encrypting the plaintext information, and obtaining low-order ciphertext information. Therefore, the key of the first branch used for 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 with the solution in the prior art.
[0032] Step 103, 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;
[0033] Step 104: Expand the first ciphertext symbol based on the basis space to obtain a second ciphertext symbol.
[0034] It can be seen that in the embodiment of the present application, after the key of the second branch is shaped, the base information is collected in the surrounding base space, and then the first ciphertext symbol is expanded to obtain a high-order ciphertext symbol. Since the ciphertext symbols are composed of multiple bits, the low bits are the base information and the high bits are the low-order ciphertext information. Based on this, in the embodiment of the present application, after the ciphertext is distributed near the decision threshold of the low-order ciphertext, the tolerance of the ciphertext in the high bits to noise is reduced, and bit reversal can occur even when encountering small noise, thereby improving the security of the data.
[0035] Therefore, after the seed key is divided into two branch keys through the above steps 101 to 104, the plaintext data is encrypted by the key of the first branch, instead of encrypting the lowest bit of the base information with the plaintext information by XOR, and the key of the first branch will not be transmitted in the optical fiber, so it will not be intercepted, which improves the security of the data. In addition, in the embodiment of the present application, after the key of the second branch is shaped, the base information is collected 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, which reduces the tolerance of the ciphertext in the high bit position to noise, and also improves the security of the data compared with the prior art.
[0036] In an optional implementation manner in the embodiment of the present application, the method of encrypting the plaintext data based on the key of the first branch involved in the above step 102 may further include:
[0037] Step 11, based on a first pseudo-random number generator, expanding the key of the first branch 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 (Pseudo Random Number Generator, PRNG) in the embodiment of the present application is to expand a small number of seed keys (the keys 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 a target algorithm to generate a continuous pseudo-random number sequence. The pseudo-random number sequence generated by the first pseudo-random number generator statistically behaves close to a true random number sequence, but is actually generated through a deterministic calculation process.
[0039] Step 21, performing 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 in the embodiment of the present application and the running key in the first branch are encrypted at the bit level, and the specific encryption algorithm can be an XOR algorithm to obtain the ciphertext bits obtained after the XOR of the two. Further, if the plaintext data is 011101 and the first running key is 101001, the ciphertext bits obtained after the XOR is 110100.
[0041] It can be seen that in the embodiment of the application, another set of keys (keys of the first branch) are used to perform XOR with the plaintext data, instead of XORing the lowest bit of the base information with the plaintext information as in the prior art, encrypting the plaintext information, and obtaining low-order ciphertext information. Therefore, the key of the first branch used for XOR encryption in the embodiment of the 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 with the solution 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 the above step 103 and generating a base space based on the shaping result may further include:
[0046] Step 31, based on a second pseudo-random number generator, the key of the second branch is expanded 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 number of seed keys (keys in the second branch) to a sufficient number of running keys.
[0048] Step 32, dividing the second running key into two running keys;
[0049] Step 33, 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;
[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 first preset, such as block length, distribution probability, etc. The block length is set to a suitable length to reduce the computational complexity. For example, the block length is 1000, and the distribution probability adopts an inverse Gaussian distribution, and its distribution expression is
[0051] Among them, λ is the probability shaping factor, and D is the value range of x.
[0052] Step 34, superimposing two ciphertext symbols with inverse Gaussian probability distribution to obtain a basis space.
[0053] It can be seen that in the embodiment of the present application, after shaping based on CCDM, a ciphertext symbol with an inverse Gaussian probability distribution can be obtained, and then the two ciphertext symbols can be superimposed to obtain a base space, in which the base information is gathered around the base space. It can be seen that in the embodiment of the present application, the base information is gathered around the base space, that is, the ciphertext is distributed near the decision threshold of the low-order ciphertext, thereby reducing the tolerance of high-bit positions to noise. Therefore, bit reversal can occur even when encountering small noise, thereby improving data security.
[0054] In an optional implementation of the embodiment of the present application, the method of obtaining the second ciphertext symbol by expanding the first ciphertext symbol based on the basis space involved in the above step 104 may further include:
[0055] Step 41, expanding 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] Among them, in the 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 by way of example in conjunction with a specific implementation of an embodiment of the present application. The specific implementation provides a quantum noise stream encryption security enhancement method based on a ciphertext symbol aggregation decision threshold. Figure 2 is a flowchart of a quantum noise stream encryption security enhancement method based on a 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 upper and lower branches, namely, the key Key1 (the key of the first branch) and the key Key2 (the key of the second branch);
[0061] Step 202, key expansion, that is, the keys Key1 and Key2 are respectively passed through two pseudo-random number generators (PRNG1 and PRNG2) to expand a small amount of seed keys 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, the encryption algorithm is XOR, and the ciphertext bits are obtained.
[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 are 110100.
[0065] Step 204, QAM modulation, that is, the ciphertext bits are modulated into 16QAM symbols according to the 16QAM encoding method, and the result is shown in Step 1.
[0066] Step 205, CCDM initialization, that is, presetting the parameters of the constant distribution matcher (CCDM), such as block length, distribution probability, etc.
[0067] The block length is set to a suitable 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] Among them, λ is the probability shaping factor, and D is the value range of x.
[0069] Step 206, base shaping;
[0070] It should be noted that the lower branch operation 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 (Bases Space) shown, 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] It can be seen that 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, which reduces the tolerance of the high-bit position to noise. Therefore, even if there is a small noise, bit reversal can occur, thereby improving the security of the data. At the same time, in order to prevent the lowest bit of the base information from being exposed and causing a decrease in security, another set of keys is used in this specific implementation 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 implementation will not be transmitted through optical fiber, and the probability of being intercepted is low, which improves the security of the data compared to the prior art.
[0074] See also Figure 3 , Figure 3 is a schematic diagram of the structure of a data encryption device provided in an embodiment of the present application, such as Figure 3 As shown, the device comprises:
[0075] A division module 302, used to divide the seed key to obtain a first branch key and a second branch key;
[0076] A first processing module 304, 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] The second processing module 306 is used to reshape the key of the second branch and generate 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;
[0078] The expansion module 308 is used 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, used 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 by 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 If the data encryption method in the implementation manner is a device, then all implementation methods in the above data encryption method embodiment 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] The processor 405 is configured to divide the seed key to obtain keys of two branches, wherein the keys of the two branches include a key of a first branch and a key of a second branch;
[0089] Processor 405 is also used to encrypt the plaintext data based on the key of the first branch, modulate the encrypted data to obtain a first ciphertext symbol, and 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 the basis information in the basis space is gathered around the base space, and the base information corresponds to the key of the second branch.
[0090] exist Figure 4 In the embodiment, a bus architecture (represented by bus 401) is shown, bus 401 may include any number of interconnected buses and bridges, bus 401 links various circuits including one or more processors represented by processor 405 and memory represented by memory 406. Bus 401 may also link various other circuits such as peripherals, voltage regulators, and power management circuits, which are well known in the art and are therefore not further described 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, and further, antenna 403 also 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 If the apparatus of the method for data encryption in the implementation manner is used, all implementation methods of the above-mentioned method for data encryption in the implementation manner 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, and will not be described again here to avoid repetition.
[0095] The embodiment of the present application also provides a computer-readable storage medium, on which a computer program is stored, and when the computer program is executed by a processor, each process of the data encryption method embodiment shown in 1 above is implemented, and the same technical effect can be achieved. To avoid repetition, it is not repeated 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 article, the terms "include", "comprises" or any other variations thereof are intended to cover non-exclusive inclusion, so that a process, method, article or device including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, article or device. In the absence of further restrictions, an element defined by the sentence "comprises a ..." does not exclude the existence of other identical elements in the process, method, article or device including 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 a necessary general hardware platform, and of course by hardware, but in many cases the former is a better implementation method. Based on such an 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, a magnetic disk, or an optical disk), and includes a number of instructions for a terminal (which can be a mobile phone, a computer, a server, an air conditioner, or a 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 the present application, ordinary technicians in this field can also make many forms without departing from the purpose of the present application and the scope of protection of the claims, all of which are within the protection of the present application.
Claims
1. A data encryption method, characterized in that: The method comprises: The seed key is divided to obtain a key of the first branch and a 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 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; 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; The first running key and the plaintext data are XOR-ed 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, wherein the first ciphertext symbols are 16QAM symbols.
4. The method according to claim 3, characterized in that The step of 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; The two running keys are respectively input into the corresponding constant component distribution matching modules, and two ciphertext symbols with inverse Gaussian probability distribution are output; 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 step of 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 for dividing the seed key to obtain a key of a first branch and a key of a second branch; A first processing module, 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; 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 used to divide the seed key to obtain the key of the first branch and the key of the second branch; The processor is also used to encrypt plaintext data based on the key of the first branch, modulate the encrypted data to obtain a first ciphertext symbol, and 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 the basis information in the basis 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, and when the computer program is executed by a processor, the data encryption method according to any one of claims 1 to 6 is implemented.
Citation Information
Patent Citations
QAM-based quantum noise encryption method and system
CN112291052A
Data sending method and device, data receiving method and device and storage medium
CN116800373A
Excess noise reduction for continuous variable quantum key distribution
EP4037248A1
Radio communication system, detector, radio communication terminal, method and program
JP2018129715A
Continuous variable quantum key distribution
US20220166612A1