CN108737028B - Encryption method - Google Patents
Encryption method Download PDFInfo
- Publication number
- CN108737028B CN108737028B CN201810449100.0A CN201810449100A CN108737028B CN 108737028 B CN108737028 B CN 108737028B CN 201810449100 A CN201810449100 A CN 201810449100A CN 108737028 B CN108737028 B CN 108737028B
- Authority
- CN
- China
- Prior art keywords
- information
- multidimensional space
- group
- space code
- code
- 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
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/0001—Systems modifying transmission characteristics according to link quality, e.g. power backoff
- H04L1/0002—Systems modifying transmission characteristics according to link quality, e.g. power backoff by adapting the transmission rate
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B10/00—Transmission systems employing electromagnetic waves other than radio-waves, e.g. infrared, visible or ultraviolet light, or employing corpuscular radiation, e.g. quantum communication
- H04B10/70—Photonic quantum communication
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/0001—Systems modifying transmission characteristics according to link quality, e.g. power backoff
- H04L1/0006—Systems modifying transmission characteristics according to link quality, e.g. power backoff by adapting the transmission format
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/0001—Systems modifying transmission characteristics according to link quality, e.g. power backoff
- H04L1/0014—Systems modifying transmission characteristics according to link quality, e.g. power backoff by adapting the source coding
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
- H04L1/0056—Systems characterized by the type of code used
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
- H04L9/0816—Key establishment, i.e. cryptographic processes or cryptographic protocols whereby a shared secret becomes available to two or more parties, for subsequent use
- H04L9/0852—Quantum cryptography
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
- H04L9/0816—Key establishment, i.e. cryptographic processes or cryptographic protocols whereby a shared secret becomes available to two or more parties, for subsequent use
- H04L9/0852—Quantum cryptography
- H04L9/0858—Details about key distillation or coding, e.g. reconciliation, error correction, privacy amplification, polarisation coding or phase coding
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Physics & Mathematics (AREA)
- Electromagnetism (AREA)
- Quality & Reliability (AREA)
- Theoretical Computer Science (AREA)
- Computer Security & Cryptography (AREA)
- Optics & Photonics (AREA)
- Complex Calculations (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses an encryption method, which comprises the following steps: carrying out multi-body simulation transformation on information input from a classical information domain based on quasi-orthogonal pseudo-random matrix to obtain a multi-dimensional space code; in the process of carrying out multi-body simulation transformation, 1 is designed into particles with positive charge, and 0 is designed into particles with negative charge; the obtained multidimensional space code is an array formed by the weight, the group number and the distribution number from left to right; the weight refers to the statistics of the number of positive particles in the information of the particle form in the multidimensional space code, and the multidimensional space codes with the same weight are in the same branch group; the multidimensional space code obtained by carrying out multi-body simulation transformation on the information input from the classical information domain can be divided into a plurality of information groups, and the group number is the identifier of the number and distribution of information particles in the multidimensional space code; the distribution number refers to the specific distribution position of the multidimensional space code in a certain group; multidimensional space codes are applied as encryption means.
Description
Technical Field
The invention belongs to the technical field of communication, and particularly relates to a multi-dimensional space code structure.
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 for overcoming the problems in the prior art.
In order to solve the above technical problem, the present invention provides a multi-dimensional space code structure, which is expressed by the number and spatial position distribution of "1" or "0", and the expression is:
(N)B＝L(M,Ki,Tj·)
in the formula, N is a multidimensional space code, B represents numerical values of '0' and '1', L represents a functional relation, M represents the number of '1' in the information, K represents a 'group number', and T represents a 'distribution number'.
The data composition includes, in order, superimposed bits indicating the number of "1", a group number identification bit indicating a group in which the multidimensional space code is located, shifted bits indicating an offset occurring in the group, and complementary inverted bits indicating information "1" and "0" in the group.
The shift bit information includes information representing the position in the upper or lower half of the group and an offset.
Has the advantages that: compared with the prior art, the multi-dimensional space code has the physical characteristics of superposition, entanglement, coherence, uncertainty and the like which are completely different from the classical information code, so that the multi-dimensional space code can be used as a novel encryption mode, can be applied to secret data and network security, and has strong implementation feasibility and higher economic benefit.
Drawings
FIG. 1: a multi-dimensional space code group distribution diagram;
FIG. 2: and (5) a schematic diagram of information superposition of the multi-dimensional space code.
Detailed Description
The invention is further illustrated below with reference to the figures and examples.
The multi-body simulation means that the content of the micro world is realized by simulating the content of the macro world, namely the physical characteristics of the macro world are used for describing the content of the micro world.
For example: "0" and "1" can be described by "positive particles", "negative particles";
the "set of basis vectors" may be described as a "set of particle clouds";
in the process of generating the multidimensional space code, a multi-body simulation mode is adopted, the data characteristics in a classical information theory are overcome, and the description of physical characteristics (pairing property, relevance, superposition property and the like) in the aspects of physics and quantum mechanics is realized.
For example: description of pairing: positive particle cloud, negative particle cloud (up, down);
the relevance describes: particle cloud A-particle cloud B;
the multidimensional space code is an information code obtained by classical information code through multi-body simulation transformation based on quasi-orthogonal pseudo-random matrix. The multidimensional space code generated after multi-body simulation transformation can be generated by macroscopic software, circuits and other modes, but the multidimensional space code has characteristics similar to microscopic information such as quantum state 'superposition' and 'entanglement', so that the multidimensional space code realizes the description of the characteristics of the microscopic world by a macroscopic method.
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 multidimensional space codes, wherein B represents numerical values of '0' and '1', L represents a functional relation, M represents the number of '1' in the information, the 'weight' (M is belonged to 1, N/2) in a classical domain, K represents a 'group number', and T represents a 'distribution number'.
The multidimensional space code takes a group as an organization unit, the length of the information code is L, and the format of the multidimensional space code data after being transformed is as follows (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 ".
Construction characteristics of multidimensional space code
1. Weight of
The "weight" refers to the statistics of the number of positive particles in the information according to the particle form in the multidimensional space code. For example, "01000000" in the multidimensional space code, its weight is 2. The weight is a precondition for operations such as grouping of the multidimensional space code. The multidimensional space codes with the same weight are in the same branch group.
2. Group number
The "group number" is an indication of the number and distribution of information particles in the multi-dimensional space code.
The multidimensional space code obtained by carrying out multi-body simulation transformation on the information input from the classical information domain can be divided into a plurality of information groups (groups). The information group can be divided into a main group G, a branch group G1-Gn, a small group and an information pair. The trunk group G is formed of a branch group G1-Gn, the branch group is formed of n small groups, and the small groups are formed of information pairs. The basic particles in the physical structure have symmetrical physical characteristics, such as positive and negative electrons in the electron. The polarized state of light can be divided into horizontal polarized light and vertical polarized light. Here, the group of the multidimensional space code domain also has a symmetric property, for example, the "information pair" is formed by more than two random input information with an orthogonal property, the small group is formed by a left small group and a right small group, the branch group is formed by a left small group and a right small group, and a specific group distribution diagram is shown in fig. 1.
For each multidimensional space code, it has a group number, and after a certain "group number" has been determined, it can be further determined whether the multidimensional space code belongs to the "upper half group" or the "lower half group" of a certain "group" and which "information pair" it belongs to.
For example: the multidimensional space code "01000000" has a weight of 2, a group number of "group a" (group number 00), which is the upper half of "group a".
3. Distribution number
The "distribution number" refers to a specific distribution position of the multidimensional space code in a certain group, or may be referred to as an offset between the input particle information and the group base vector, or may be referred to as a degree of association.
For example: the multidimensional space code "01000110", the weight is 2, the group number is "group a" (group number 00), and the distribution number is "11", indicating that each "1" in the multidimensional space code moves.
In the process of generating the multi-dimensional space code, the related principle of a Pockels box in optics in physics is utilized to set Pockels parameters, and important parameters such as the code length L, the multi-body transformation size N, the weight, the group number, the distribution number and the like of the multi-dimensional space code in the transformation process are determined. This is a local transformation in time and space, and is also a way to simulate classical information in the macroscopic world with a particle model in the microscopic world.
In the multidimensional space code domain, each information bit in the multidimensional space code can be superposed in one block, namely 1 information bit can be superposed with a plurality of information bits. This is as if a plurality of "sugarcoated haws" can be connected in series on a string of "sugarcoated haws string", and looking down from the top of "sugarcoated haws string", only see one "sugarcoated haws", but from other angles, can see the whole string of "sugarcoated haws string". This case is also similar to the "quantum-type information string" in quantum information theory. Therefore, the superposition characteristics of the multidimensional space code are similar to the physical characteristics superposed in the real 'space', which is an important characteristic of the multidimensional space code different from the classical information code. The information superposition diagram of the multi-dimensional space code is shown in fig. 2.
The multidimensional space code is obtained after classical information codes are subjected to multi-body simulation transformation, and after the multi-body simulation transformation, certain correlations exist between group numbers, distribution numbers and distribution numbers of the multidimensional space code as well as between the group numbers and the distribution numbers. The multidimensional space code can also be described by using related parameters by referring to physical characteristics of information, such as complementary characteristics of '0' and '1', paired characteristics of positive and negative particles, distribution characteristics of N particles, particle translation characteristics and the like as the 'related' characteristics between information.
"pair association": two multidimensional space codes are called "information pairs" if they have complementary or balanced physical properties between them. In the multidimensional space code of code length N, there is (2)N-1)/2 pairs of multidimensional space code "information pairs".
"group association": a set of information between the plurality of multidimensional space codes, which is constituted by particle distribution and particle translation, is called "group association" information. In a multidimensional space code of code length N, the number g of group associations>＝(2N-1)/N。
"half-group association": in the multidimensional space code, a group of information composed of N/2 pieces of information through particle distribution and particle translation is called as 'half-group association' information.
"group-group association": the multidimensional space code affects the determination of group B (group number of group B) after the group-to-group correlation, i.e., the group a (group number of group a) is determined.
"group-distribution number association": in a certain group of the multidimensional space codes, the distribution number of the corresponding multidimensional space code in the group can be determined through the translation characteristics of the particles in the group.
The multidimensional space code is a physical code which has no 'weight code' property and has 'uncertainty', so that how to correspond to the weights can be determined by any condition. This promotes the security aspect very well.
In the classical information field, a value "0" represents "null or nothing", "1" represents a value, different positions of "1" represent different weights, and a string of "0" and "1" symbols combined represents a value. But also the only form between binary and decimal.
Example (c): (10110101)H＝(181)D， (1)
The most important advantages are that the method is simple and easy to realize physically, and is widely accepted and used by the current society. There are three weaknesses in this unique expression:
A. the efficiency is low, and the utilization efficiency of 0 and 1 is half in the equal probability case.
B. In the information memory, the "0" information occupies one position, and in the information communication process, the "0" information occupies one time slot.
C. The value of 1 is always unchanged (the number weight is not calculated) at any position of the information of '1', and the information is not kept secret.
In the information field of the multi-dimensional code, "0" represents an "equilibrium state" in physics, and can be a combination of "-1" and "+ 1", "-2" +2 ", and the like, and" 0 "can also represent a particle. In the process of multi-body simulation transformation, 1 is designed into particles with positive electricity, 0 can be designed into particles with negative electricity, so that information is irrelevant to a binary system and is relevant to parameters such as physical parameters of particle number, particle distribution, energy level and the like, the characteristic of information diversity can be formed, and data has diversity.
For example: binary number 10110101 ═ 128+32+16+4+1
First result after the Medium number (3) of formula (2)0Means that there are 3 "0" s in the expression 10110101, the second result (5) after the equal sign1Means that there are 5 '1's in the expression 10110101, the third and the fourth result (35)01And (53)10Is determined from the order of "1" and "0" in the message, a fifth result (01101001) is a set of codes determined from the distribution of "0" and "1" particles, and a final result is obtained from a simulation model in which the particles have different energies at different energy levels. From the examples, it can be concluded that the information in the multidimensional code information domain is determined according to physical parameters and is presented in various representations, in short, diversity.
The information in the multidimensional code information domain is a code determined according to physical parameters, the correlation characteristic is excellent, and the utilization efficiency can be improved by encoding. In the information communication process, the multi-dimensional code information code occupies more than half of the time slot, and the information transmission rate is improved. Such as 8 bits and 16 bits, the information transfer rate is improved by 20 times as long as 3 slots of bits, such as 3 slots of bits when transferring 64 bits of information.
The value of 1 is variable, the base is treated as a particle of an energy level, a variable number is formed, and the numerical range is greatly improved. The example of N-8 full '1' is illustrated
11111111 ═ 255 (classical binary field) (3)
The definition of the 'base' of the multidimensional space code domain is variable and can be defined according to the concept of particle energy level, the same number is presented in the same form, but the presented numerical values are different in different domains.
Examples are: 11111111 ═ 87654321 (4)
(4) The data of the formula (II) is data of 2 to the power of 26 or more. Binary data is most used in computer systems, e.g., by dividing equation (4) by equation (3) by more than 18 th power of 2, as calculated as binary data. And dividing the formula (4) by the formula (3) according to the decimal data, and increasing the data by more than 8 times.
Therefore, the diversity of the multi-dimensional code information codes is utilized, and the same binary data can expand the data range by more than multiple times.
The multidimensional space code is constructed by combining multidimensional orthogonal pseudo-random sequences, so that different multidimensional space codes are necessarily generated when different multidimensional orthogonal pseudo-random matrixes are adopted. Therefore, the multidimensional space code also has uncertainty in terms of composition.
The uncertainty characteristic of the multidimensional space code in the invention can break through the defect of an exhaustion method in the traditional information confidentiality field. Therefore, the multidimensional space code can be applied to the fields of information confidentiality and the like.
Example (b):
taking the 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), when T is 0, it means not moving, and when T is 1, it means moving, then the multidimensional space code is as follows:
TABLE 1 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 ═ (11000000+00110000+00001100+00000011) [ (see group B in table 1) ═ 10100000+01010000+00001100+00000011 ] [ (see group C in table 1).
Claims (1)
1. An encryption method, characterized by: the method comprises the following steps:
step 1: carrying out multi-body simulation transformation on information input from a classical information domain based on quasi-orthogonal pseudo-random matrix to obtain a multi-dimensional space code; in the process of carrying out multi-body simulation transformation, 1 is designed into particles with positive charge, and 0 is designed into particles with negative charge; the obtained multidimensional space code is an array formed by the weight, the group number and the distribution number from left to right; the weight refers to the statistics of the number of positive particles in the information of the particle form in the multidimensional space code, and the multidimensional space codes with the same weight are in the same branch group; the multidimensional space code obtained by carrying out multi-body simulation transformation on the information input from the classical information domain can be divided into a plurality of information groups, and the group number is the identifier of the number and distribution of information particles in the multidimensional space code; the distribution number refers to the specific distribution position of the multidimensional space code in a certain group;
step 2: multidimensional space codes are applied as encryption means.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810449100.0A CN108737028B (en) | 2018-05-11 | 2018-05-11 | Encryption method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810449100.0A CN108737028B (en) | 2018-05-11 | 2018-05-11 | Encryption method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108737028A CN108737028A (en) | 2018-11-02 |
| CN108737028B true CN108737028B (en) | 2021-10-29 |
Family
ID=63938194
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810449100.0A Active CN108737028B (en) | 2018-05-11 | 2018-05-11 | Encryption method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108737028B (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 (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101414890A (en) * | 2008-11-25 | 2009-04-22 | 南京师范大学 | Method for composing multidimensional quadrature pseudo-random matrix |
| CN107547141A (en) * | 2017-08-15 | 2018-01-05 | 无锡南理工科技发展有限公司 | Relay for quantum communications |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2005059699A2 (en) * | 2003-12-15 | 2005-06-30 | Quantum Matrix Holdings, Llc | System and method for multi-dimensional organization, management, and manipulation of data |
| US8190553B2 (en) * | 2007-12-20 | 2012-05-29 | Routt Thomas J | Methods and systems for quantum search, computation and memory |
| CN104518866B (en) * | 2013-09-30 | 2016-06-29 | 科大国盾量子技术股份有限公司 | A kind of quantum key distribution terminal and system |
| CN107370546B (en) * | 2016-05-11 | 2020-06-26 | 阿里巴巴集团控股有限公司 | Eavesdropping detection method, data sending method, device and system |
-
2018
- 2018-05-11 CN CN201810449100.0A patent/CN108737028B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101414890A (en) * | 2008-11-25 | 2009-04-22 | 南京师范大学 | Method for composing multidimensional quadrature pseudo-random matrix |
| CN107547141A (en) * | 2017-08-15 | 2018-01-05 | 无锡南理工科技发展有限公司 | Relay for quantum communications |
Non-Patent Citations (1)
| Title |
|---|
| "A multiple paths scheme with labels for key distribution on quantum key distribution network";Chenhui Ma;《2017 IEEE 2nd Advanced Information Technology, Electronic and Automation Control Conference (IAEAC)》;20171002;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108737028A (en) | 2018-11-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Hua et al. | Cross-plane colour image encryption using a two-dimensional logistic tent modular map | |
| Liu et al. | A color image encryption using dynamic DNA and 4-D memristive hyper-chaos | |
| Tian et al. | Chaotic S‐Box: Intertwining Logistic Map and Bacterial Foraging Optimization | |
| Sha et al. | A chaotic image encryption scheme based on genetic central dogma and KMP method | |
| Li et al. | A secure and efficient image encryption algorithm based on dna coding and spatiotemporal chaos. | |
| CN109660555A (en) | Content safety sharing method and system based on proxy re-encryption | |
| Chen et al. | Quantum cryptography and its applications over the internet | |
| CN104270247B (en) | Suitable for the efficient general Hash functions authentication method of quantum cryptography system | |
| Chen et al. | Double color image encryption based on fractional order discrete improved Henon map and Rubik’s cube transform | |
| Kengnou Telem et al. | A simple and robust gray image encryption scheme using chaotic logistic map and artificial neural network | |
| Sha et al. | An image encryption scheme based on IAVL permutation scheme and DNA operations | |
| Pawłowski et al. | “Hyperbits”: The information quasiparticles | |
| Zhang et al. | A novel chaotic image encryption algorithm based on latin square and random shift | |
| CN108737028B (en) | Encryption method | |
| Zheng et al. | An ACP-based approach to color image encryption using DNA sequence operation and hyper-chaotic system | |
| Wang et al. | Quantum grayscale image encryption and secret sharing schemes based on Rubik’s Cube | |
| Parvaz et al. | A new 4D chaos system with an encryption algorithm for color and grayscale images | |
| CN108683497B (en) | Multi-dimensional space code forming device | |
| ALattar et al. | A comparative study of researches based on magic square in encryption with proposing a new technology | |
| CN108615078B (en) | Secret data communication method | |
| Kong et al. | A new image encryption algorithm based on chaos | |
| Wang | Digital image encryption algorithm design based on genetic hyperchaos | |
| Cui et al. | A new image encryption algorithm based on DNA dynamic encoding and hyper-chaotic system | |
| Zeng et al. | Secure Analysis for IIOT Systems Using Hyperchaotic Image Encryption | |
| Kundu et al. | Quantum computation: from Church-Turing thesis to qubits |
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 |