CN108615078B - Secret data communication method - Google Patents
Secret data communication method Download PDFInfo
- Publication number
- CN108615078B CN108615078B CN201810451236.5A CN201810451236A CN108615078B CN 108615078 B CN108615078 B CN 108615078B CN 201810451236 A CN201810451236 A CN 201810451236A CN 108615078 B CN108615078 B CN 108615078B
- Authority
- CN
- China
- Prior art keywords
- information
- group
- transformation
- distribution
- particle
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Landscapes
- Compression, Expansion, Code Conversion, And Decoders (AREA)
- Error Detection And Correction (AREA)
Abstract
The invention discloses a secret data communication method. Performing group transformation on input information x, selecting a primitive polynomial to form a quasi-orthogonal pseudo-random matrix through group transformation according to needs before performing the group transformation, performing multi-body simulation transformation on the information matrix x and the quasi-orthogonal pseudo-random matrix to obtain transformed information, and grouping the information; and then determining the distribution in which "cluster" through the determined physical parameter-particle distribution. And finally, according to the 'group' and 'distribution' information, feeding back and retransforming the information of the classical information domain, and finally obtaining the multidimensional space code. The multidimensional space code has the characteristics of superposition, entanglement and coherence, and because the multidimensional space code has uncertainty, namely when the multidimensional space code has uncertain parameters and groups (the group number is an uncertain value), the information cannot be decoded, the special information construction method can be applied to secret data communication.
Description
Technical Field
The invention belongs to the technical field of communication, and particularly relates to a secret data communication method.
Background
Quantum is a new information carrier discovered, and it will be a new material base capable of loading and processing information for the development of information society, following optical signals, electric signals, etc. The mode of using a quantum as an information carrier is called quantum information (quantum information). Quantum information is physical information carried about the "state" of a quantum system in quantum mechanics. The method adopts a completely new information mode of calculation, coding and information transmission through various coherent characteristics of a quantum system (such as quantum parallelism, quantum entanglement, quantum unclonable and the like).
In the information transmission process, what measures the data transmission efficiency is the symbol transmission rate RB, which is called the transmission rate for short, also called the symbol rate, etc. It represents the number of transmission symbols per unit time in Baud (Baud), denoted as B. The symbol transmission rate may also be expressed as the average amount of information transferred per unit of time or number of bits in bits per second, which may be noted as bit/s, or b/s, or bps. Each symbol or symbol typically contains a certain number of bits of information.
For quantum information, the common unit is the quantum bit (qubit) -i.e., a quantum system with only two states. However, unlike the classical digital state (which is discrete), a two-state quantum system can be a superposition of two states at virtually any time, which may also be eigenstates. In quantum systems, information is stored by quantum bits. A qubit can assume two states that it has itself as either "0" or "1", which are superimposed at the same time. Meanwhile, from the perspective of quantum mechanics, two spatially separable particles can generate quantum entanglement phenomena that affect each other in a system formed by two or more particles. The quantum entanglement technology is an encryption technology for safely transmitting information and is irrelevant to super-light speed transmission information. Although the "communication" between these particles is known to be fast, we cannot take advantage of this link to control and transfer information at such a fast rate. While the states of electrons spinning right and positrons spinning left in a quantum are correlated, so the quantum also has coherence.
Based on the quantum information theory and the above characteristics, people are currently conducting research on computers based on the quantum theory, namely quantum computers. Quantum computers are physical devices that perform high-speed mathematical and logical operations, store, and process quantum information in compliance with quantum mechanics laws. The concept of quantum computers stems from the study of reversible computers. Quantum computers use qubits that can be in multiple states simultaneously, unlike traditional computers that can only be in binary states of 0 or 1.
Disclosure of Invention
The invention provides a multi-dimensional space code forming method for overcoming the problems in the prior art.
In order to solve the above technical problem, the present invention provides a method for constructing a multidimensional space code, comprising the steps of:
step 1: matching and transforming the input information; the matching is that the information length is consistent with the group size for converting the group, each primitive polynomial is selected according to the set physical parameters, and the matrix meeting the requirement is selected through group conversion matching to obtain an quasi-orthogonal pseudo-random extended matrix; the transformation changes '0' and '1' information in the input information into particle-form information;
step 2: and (3) weight transformation: calculating the number of positive and negative particles in the particle form information;
and step 3: group determination: determining the distribution in which group according to the number and distribution of input information particles;
and 4, step 4: determining a distribution number, namely the distribution position of the input particle information in the group where the particle information is positioned, or the offset between the input particle information and the group base vector; setting a pockels parameter through a pockels box, and determining a superposition bit, a group number identification bit, a shift bit and a reverse bit related to the multi-dimensional space code in the conversion process;
and 5: outputting, including bipolar output signals, unipolar output signals and binary format coded output signals; the bipolar output signal is a multi-component output signal and has three real components of weight, group and particle distribution; the unipolar output signal is a multi-component output signal and has three components of weight, group and particle distribution; the binary format coded output signal is formed by a binary format according to the output form of the unipolar output signal;
step 6: and (5) feeding back and re-transforming the output signal in the step 5, and repeating the steps.
The physical parameters in step 1 include information length, the number of "0" and "1", group parameters, information distribution parameters, particle energy level parameters, and output format.
The transformation in step 1 is specifically: carrying out multi-body simulation transformation on the classical information matrix and the quasi-orthogonal pseudo-random extended matrix which passes through the dressing filter to obtain transformation information, wherein the transformation information is expressed as:
C＝H(X·P)
in the formula, C is transformation information, X is a classical information matrix, and P is an quasi-orthogonal pseudo-random matrix.
The multidimensional space code uses a group as an organization unit and sequentially comprises a superposition bit, a group number identification bit, a shift bit and a reverse bit; the superposition bits represent the number of '1' in the information, the group number identification bits represent the group where the multidimensional space code is located, the shift bits represent the offset occurring in the group, including judging whether the shift bit is located in the upper half group or the lower half group and the offset, and the reverse bits represent the complement of the information '1' and '0' in the group.
The multidimensional space code is expressed by the number and the spatial position distribution of 1 or 0, and the expression is as follows:
(N)B＝L(M,Ki,Tj·)；
in the formula, N represents a multi-dimensional space code, B represents numerical values of '0' and '1', L represents a functional relation, M represents a superposition bit, K represents a group number identification bit, and T represents a reverse bit.
Has the advantages that: compared with the prior art, the construction method of the multi-dimensional space code is completely different from the classic information code, and the information can not be decoded when the multi-dimensional space code is uncertain parameters and groups (the group number is an uncertain value) due to the superposition, entanglement and uncertainty of the multi-dimensional space code, so that the special information construction method can be applied to secret data communication and has strong implementation feasibility and higher economic benefit.
Drawings
FIG. 1 is a diagram illustrating a method for generating a multi-dimensional space code according to the present invention.
FIG. 2 is a diagram of a multi-dimensional space code data format according to the present invention.
Detailed Description
The process of the invention is further illustrated below with reference to the examples.
The multidimensional space code has the characteristics of superposition, entanglement, coherence, uncertainty and the like, so that how to encode and decode the multidimensional space code is different from a classical information encoding and decoding method, and the characteristics of superposition, entanglement and the like in quantum information are realized by not only a mathematical method but also a physical and mathematical combination method, and the encoding and decoding of the multidimensional space code are realized by adopting an information group encoding and decoding method.
As shown in fig. 1, the method comprises the following specific steps:
in fig. 1, the first block diagram first matches and transforms the input information x (i). The information of the classical information field is represented by "0" and "1", and 1 information bit represents 1 bit. The length of the information x (i) may be 8 bits or 16 bits, where a certain bit of information is denoted as x (i). Matching means that the information length is consistent with the group size for converting the group, and various primitive polynomials are selected according to the set physical parameters including the information length, the number of '0' and '1', the group parameters, the information distribution parameters, the particle energy level parameters and the output format, and the matrix meeting the requirements is selected and matched through group conversion, which is called an orthogonal pseudo-random expansion matrix of the same kind and a multi-dimensional orthogonal pseudo-random expansion matrix of the same kind for short, and the patent number: ZL 200910264376.2. The conversion is to convert "0" and "1" information of a certain length in the input information into information in the form of particles.
In the second block diagram, "weight conversion" is conversion of the number of positive and negative particles in the information for obtaining the particle format.
In the third block diagram, "group identification" is to identify the type of "group" in which the distribution is determined based on the number and distribution of the input information particles, and for any "group" that has already been identified, the "group" may be further divided into "the upper half group" and "the lower half group" by further information extraction. The method is a local transformation of time and space, so that information can be effectively extracted from signals, and multi-scale refinement Analysis (Multiscale Analysis) is carried out on functions or signals through operation functions such as stretching and translation.
The "distribution number determination" in the fourth block refers to a distribution position of the input particle information in the group, or a deviation amount (which may be referred to as a degree of association) between the input particle information and the group base vector. The method comprises the steps of setting a Pockels parameter through a related principle of a Pockels box, and determining important parameters such as a code length L, a multi-body transformation size N, the number, a group number and the like in a multi-dimensional space code in a transformation process. The function of the four transformation and judgment determination block diagrams is to simulate and determine the classical information in the macroscopic world by using a particle model in the microscopic world, which is called multi-body Simulation (Muli-system Simulation) in physics and can also be called mathematical physical information transformation (mathematical physical information transformation for short)
The fifth and sixth blocks are outputs with three forms, Y1，Y2，Y3。
Y1: is a bipolar output signalThe component output signal has three real components of weight, group and particle distribution. Because of Y1The output of (a) is three real components, i.e. only three time slot pulses are needed, for the number of input N-bit information bits (classical information) in baseband form, the input and output time slot ratios are: 3/N; if N is 8 bits. 12 bits. 16. At 32, 64 bits, the information transfer data rate is greatly increased. The transmission from A to B takes N Time slot (Symbol) periods (Symbol Time), and the transmission of the multidimensional space code information only takes three Time slot periods, so that the multidimensional space code information can be transmitted by means of a classical information system platform. The slot ratio values are 3/8, 3/12, 3/16, 3/32, 3/64, respectively.<1. And (3) deducing: the larger the value of N, the smaller the slot fraction value.
Y2: is a unipolar output. The multi-component output signal has three components of weight, group and particle distribution, and the power supply characteristic requires positive or negative power supply, and the time slot proportion is the same as that described above.
Y3The output is encoded for binary format. Y is3The output is according to Y2The output form of (A) is a code formed in binary format, Y3A one-to-one correspondence may be established with the input signal x (i). But according to a given difference in physical parameter, e.g. different particle energy levels, Y3A one-to-one correspondence may be established for the different forms and the input signal x (i). One code table of one system can be realized.
The multidimensional space code is expressed by the number and the spatial position distribution of 1 or 0, and the expression is as follows:
(N)B＝L(M,Ki,Tj·)。
in the formula, N represents a multi-dimensional space code, B represents numerical values of '0' and '1', L represents a functional relation, M represents superposition bits and represents the number of '1' in information, the 'weight' (M belongs to 1 and N/2) in a classical domain, K represents a group number identification bit, and T represents an inversion bit.
The multidimensional space code takes the group as an organization unit, the length of the information code is L, the format of the multidimensional space code data after being transformed is shown in FIG. 2, when L is 8:
the superposition bit (M) represents the number of "1": s1, S2
S1S2 represents a superposition of 1 "when it is 00;
when S1S2 is 01, it represents a superposition of 2 "1S";
when S1S2 is 10, it represents a superposition of 3 "1S";
when S1S2 is 11, it indicates a superposition of 4 "1S".
The group number identification bit (K) represents the group of the multidimensional space code: s3, S4
S3S4 indicates group 1 when 00.
S3S4 ═ 01 indicates group 2.
S3S4 indicates group 3 when it is 10.
S3S4 indicates group 4 when it is 11.
The shift bits (S) represent the offset that occurs in the group: s5, S6, S7
Wherein S5 represents the upper or lower half population;
s6, S7 indicate an offset amount;
S5S6 ═ 00 indicates that each "1" does not move.
S5S6 indicates that each "1" moves.
S5S6 ═ 01 indicates that the back part "1" moved.
S5S6 ═ 10 indicates that the leading portion "1" moved.
The inverse bit (T) represents the complement of the information "1" and "0" in the cluster, S7
S7 denotes the number of "1" or "0" in the information, for example, "11000000".
S7 indicates the number of complements ("number of 1 >" 0 ") in the information, for example," 00111111 ".
Example (b):
the length L of the classical information field information x in the invention can be any length, and each bit of information can take the value of '0' or '1'. Assuming that the length of the classical information field information x is 8, for the classical coding scheme, since each bit can take two possibilities of "0" and "1", the information x with L being 88All codes of (2)8＝256。
Wherein the number of codes with 8 bits being 0 is 1, namely 00000000;
the number of codes with 1 "in 8 bits is 8, i.e.
1000 0000，0100 0000，0010 0000，0001 0000，0000 1000，0000 0100，0000 0010，0000 0001；
The number of codes with 2 '1's in 8 bits is 28, namely
1100 0000，1010 0000，1001 0000，1000 1000，1000 0100，1000 0010，1000 0001，0110 0000，0101 0000，0100 1000，0100 0100，0100 0010，0100 0001，0011 0000，0010 1000，0010 0100，0010 0010，0010 00010001 1000，0001 0100，0001 0010，0001 0001，0000 1100，0000 1010，0000 1001，0000 0110，0000 0101，0000 0011；
The number of codes containing 3 "1" in 8 bits is 56, and this is not listed here.
The number of codes containing 4 "1" in 8 bits is 60, and is not listed here.
The number of codes containing 5 "1" in 8 bits is 56, and this is not listed here.
The number of codes containing 6 "1" in 8 bits is 28, and is not listed here.
The number of codes containing 7 "1" in 8 bits is 8, and is not listed here.
The 8 bits contain 8 "1" codes, and the number of the codes is 1, namely 11111111.
The quasi-orthogonal pseudo-random extended matrix is obtained by group transformation, and transformation information C is obtained after a classical information matrix X and a quasi-orthogonal pseudo-random matrix P which passes through a comb filter are operated.
C＝H(X·P)
After the transformation information C is subjected to group classification, different branch groups, i.e., group determination in the block diagram, can be obtained.
The following is the group of branches when 2 "1" s are included after the group determination in the classical information matrix X.
TABLE 1 Branch group Table
| Group A | Group B | Group C | Group D |
| 01100000 | 00110000 | 01010000 | 10001000 |
| 00000110 | 00000011 | 00000101 | 01000100 |
| 00100100 | 00010010 | 01000001 | 00100010 |
| 01000010 | 00100001 | 00010100 | 00010001 |
| 10010000 | 11000000 | 10100000 | |
| 00001001 | 00001100 | 00101000 | |
| 00011000 | 01001000 | 00001010 | |
| 10000001 | 10000100 | 10000010 |
And (3) passing each branch group through a Pockels box, setting Pockels parameters of the branch group, and determining important parameters such as superposition bits, identification bits, shift bits, reverse bits and the like related to the multi-bit space code to set, wherein the process is the determination of the distribution number in the block diagram.
According to the set group number and the set distribution number, the information of the classical information domain is fed back and transformed again, and then the multidimensional space code corresponding to the classical information domain information can be obtained, wherein the expression corresponding to the multidimensional space code is as follows:
(N)B＝L(M*Ki*Tj·)
in the formula, N represents a multi-dimensional space code, B represents numerical values of '0' and '1', L represents a functional relation, M represents superposition bits and represents the number of '1' in information, the 'weight' (M belongs to 1 and N/2) in a classical domain, K represents a group number identification bit, and T represents an inversion bit. For example, M is set to 2.
Taking the above classical information matrix X as an example, if M is 2(S1S2 is 01), the group number is set as the following table (the group number is not fixed), where T is 0 indicates no movement and T is 1 indicates movement, the multidimensional space code is as follows:
TABLE 2 multidimensional space code reference table
The multi-dimensional space code after multi-body simulation transformation has a construction method completely different from that of a classical information code, so that the special information construction method can be applied to secret data communication, and when parameters and groups (group numbers are uncertain values), information decoding cannot be finished, so that the multi-dimensional space code can be used for communication transmission of characters, pictures, audios and videos and the like, and can also be applied to secret communication for data encryption.
The multidimensional space code can also carry out four arithmetic operations of +, -,/in the space. For example, in the case of an 8-bit code length and M ═ 2, the four-dimensional information operation is performed as follows:
11111111 ═ e (11000000+00110000+00001100+00000011) [ (see group B in table 1) } ═ e 10100000+01010000+00001100+00000011 [ (see group C in table 1) ]
The characteristic of the 'sugarcoated haws string' of the multidimensional space code enables information seen in a certain 'space' to be decomposed into different information from another 'space', namely the superposition characteristic of the multidimensional space code is shown. The expression modes in different 'spaces' are not unique, namely the constructed arrays are also not unique, and the number of the 11111111 can be composed of one, two or four different arrays; has the random characteristics similar to orthogonal pseudo random codes. 11111111 is unique in the classical information domain, while 11111111 information in the multidimensional space code domain, which becomes dough-like as explained by mr. shannon, can be arbitrarily combined. Certain physical characteristics in the micro world are simulated in the macro world.
Claims (3)
1. A method of secure data communication, comprising: the method comprises the following steps:
step 1: matching and transforming the input information; the matching is that the information length is consistent with the group size for converting the group, each primitive polynomial is selected according to the set physical parameters, and the matrix meeting the requirement is selected through group conversion matching to obtain an quasi-orthogonal pseudo-random extended matrix; the transformation changes '0' and '1' information in the input information into particle-form information;
step 2: and (3) weight transformation: calculating the number of positive and negative particles in the particle form information;
and step 3: group determination: determining the distribution in which group according to the number and distribution of input information particles;
and 4, step 4: determining a distribution number, namely the distribution position of the input particle information in the group where the particle information is positioned, or the offset between the input particle information and the group base vector; setting a pockels parameter through a pockels box, and determining a superposition bit, a group number identification bit, a shift bit and a reverse bit related to the multi-dimensional space code in the conversion process;
and 5: outputting, including bipolar output signals, unipolar output signals and binary format coded output signals; the bipolar output signal is a multi-component output signal and has three real components of weight, group and particle distribution; the unipolar output signal is a multi-component output signal and has three components of weight, group and particle distribution; the binary format coded output signal is formed by a binary format according to the output form of the unipolar output signal;
step 6: the output signal of step 5 participates in data communication.
2. A method of secure data communication according to claim 1, characterised in that: the physical parameters in step 1 include information length, the number of "0" and "1", group parameters, information distribution parameters, particle energy level parameters, and output format.
3. A method of secure data communication according to claim 1, characterised in that: the transformation in the step 1 is specifically as follows: carrying out multi-body simulation transformation on the classical information matrix and the quasi-orthogonal pseudo-random extended matrix which passes through the dressing filter to obtain transformation information, wherein the transformation information is expressed as:
C＝H(X·P)
in the formula, C is transformation information, X is a classical information matrix, and P is an quasi-orthogonal pseudo-random matrix.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810451236.5A CN108615078B (en) | 2018-05-11 | 2018-05-11 | Secret data communication method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810451236.5A CN108615078B (en) | 2018-05-11 | 2018-05-11 | Secret data communication method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108615078A CN108615078A (en) | 2018-10-02 |
| CN108615078B true CN108615078B (en) | 2022-03-08 |
Family
ID=63662856
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810451236.5A Active CN108615078B (en) | 2018-05-11 | 2018-05-11 | Secret data communication method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108615078B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109639423B (en) * | 2019-02-27 | 2023-03-10 | 苏州工业园区服务外包职业学院 | Constituent device of decryption algorithm |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107608935A (en) * | 2017-08-30 | 2018-01-19 | 西安交通大学 | Impact class signal time frequency analysis and reconstructing method based on time rearrangement compressed transform |
| CN107622036A (en) * | 2017-09-30 | 2018-01-23 | 中国人民解放军战略支援部队航天工程大学 | A kind of adaptive time-frequency conversion method of Polynomial Phase Signals based on ant group optimization |
| CN107729288A (en) * | 2017-09-30 | 2018-02-23 | 中国人民解放军战略支援部队航天工程大学 | A kind of Polynomial Phase Signals time-frequency conversion method based on particle group optimizing |
-
2018
- 2018-05-11 CN CN201810451236.5A patent/CN108615078B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107608935A (en) * | 2017-08-30 | 2018-01-19 | 西安交通大学 | Impact class signal time frequency analysis and reconstructing method based on time rearrangement compressed transform |
| CN107622036A (en) * | 2017-09-30 | 2018-01-23 | 中国人民解放军战略支援部队航天工程大学 | A kind of adaptive time-frequency conversion method of Polynomial Phase Signals based on ant group optimization |
| CN107729288A (en) * | 2017-09-30 | 2018-02-23 | 中国人民解放军战略支援部队航天工程大学 | A kind of Polynomial Phase Signals time-frequency conversion method based on particle group optimizing |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108615078A (en) | 2018-10-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Gimeno-Segovia et al. | From three-photon Greenberger-Horne-Zeilinger states to ballistic universal quantum computation | |
| Fang et al. | A survey of image encryption algorithms based on chaotic system | |
| Barrett et al. | Popescu-Rohrlich correlations as a unit of nonlocality | |
| Sha et al. | A chaotic image encryption scheme based on genetic central dogma and KMP method | |
| CN107896144B (en) | Chaos mapping-based 3D texture model encryption method | |
| CN106023051B (en) | DNA image encryption method and system based on cloud model and hyperchaotic system | |
| CN113297606A (en) | Color quantum image encryption and decryption method based on multiple chaos and DNA operation | |
| CN108665404B (en) | Image encryption method based on quantum chaotic mapping and DNA coding | |
| CN106170802A (en) | Digital Logic restricted problem is solved by adiabatic quantum computation | |
| Chappell et al. | Adinkra (in) equivalence from Coxeter group representations: A case study | |
| CN103778593A (en) | Quantum image encryption method based on image association dissection | |
| Quek et al. | Quantum and superquantum enhancements to two-sender, two-receiver channels | |
| Mokhtar et al. | Colored image encryption algorithm using DNA code and chaos theory | |
| Yang et al. | Period analysis of the logistic map for the finite field | |
| Zheng et al. | An ACP-based approach to color image encryption using DNA sequence operation and hyper-chaotic system | |
| CN108615078B (en) | Secret data communication method | |
| CN108683497B (en) | Multi-dimensional space code forming device | |
| CN108804933B (en) | Method for carrying out scale conversion on big data in information hiding technology | |
| Parvaz et al. | A new 4D chaos system with an encryption algorithm for color and grayscale images | |
| CN106373082A (en) | Cellular automata and chaotic mapping-based digital image encryption method and decryption method thereof | |
| CN112887509A (en) | Fusion encryption method based on multiple chaotic systems | |
| CN110838908B (en) | Image encryption and decryption method based on GF matrix transformation and random hierarchical fusion | |
| CN1322451C (en) | Employing synthetic genes in gene algorithm, information encoding and non-replicative encryption | |
| CN113222151B (en) | Quantum state transformation method and device | |
| CN107835070B (en) | Simple embedded encryption method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |