CN116915508A - Channel dynamic encryption method in communication process - Google Patents
Channel dynamic encryption method in communication process Download PDFInfo
- Publication number
- CN116915508A CN116915508A CN202311174484.7A CN202311174484A CN116915508A CN 116915508 A CN116915508 A CN 116915508A CN 202311174484 A CN202311174484 A CN 202311174484A CN 116915508 A CN116915508 A CN 116915508A
- Authority
- CN
- China
- Prior art keywords
- chaotic
- signal
- value
- map
- window
- 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.)
- Granted
Links
- 230000006854 communication Effects 0.000 title claims abstract description 37
- 238000000034 method Methods 0.000 title claims abstract description 34
- 230000000739 chaotic effect Effects 0.000 claims abstract description 142
- 239000011159 matrix material Substances 0.000 claims abstract description 64
- 238000010586 diagram Methods 0.000 claims abstract description 40
- 230000005540 biological transmission Effects 0.000 claims abstract description 13
- 238000007781 pre-processing Methods 0.000 claims abstract description 11
- 230000009466 transformation Effects 0.000 claims description 31
- 238000005070 sampling Methods 0.000 claims description 24
- 238000005516 engineering process Methods 0.000 claims description 10
- 238000006243 chemical reaction Methods 0.000 claims description 6
- 238000004088 simulation Methods 0.000 claims description 6
- 238000004364 calculation method Methods 0.000 abstract description 7
- 238000004891 communication Methods 0.000 description 6
- 230000008569 process Effects 0.000 description 4
- 230000005855 radiation Effects 0.000 description 4
- 238000004422 calculation algorithm Methods 0.000 description 2
- 238000001514 detection method Methods 0.000 description 2
- 230000000694 effects Effects 0.000 description 2
- 239000002184 metal Substances 0.000 description 2
- 230000008054 signal transmission Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 125000004122 cyclic group Chemical group 0.000 description 1
- 238000003384 imaging method Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000010606 normalization Methods 0.000 description 1
- 238000001228 spectrum Methods 0.000 description 1
- 239000013598 vector Substances 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/04—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks
- H04L63/0428—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks wherein the data content is protected, e.g. by encrypting or encapsulating the payload
-
- 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/0861—Generation of secret information including derivation or calculation of cryptographic keys or passwords
- H04L9/0875—Generation of secret information including derivation or calculation of cryptographic keys or passwords based on channel impulse response [CIR]
-
- 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/40—Network security protocols
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Security & Cryptography (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Computer Hardware Design (AREA)
- Computing Systems (AREA)
- General Engineering & Computer Science (AREA)
- Facsimile Transmission Control (AREA)
Abstract
The invention relates to the technical field of data processing, in particular to a channel dynamic encryption method in a communication process, which comprises the following steps: preprocessing and modulating an original signal in a communication process to obtain a modulated signal; converting the modulation signal into a signal diagram, scrambling the signal diagram to obtain a chaotic diagram, obtaining a chaotic value of the chaotic diagram according to the predicted chaotic value of each window matrix, and detecting the chaotic degree of the chaotic diagram according to the chaotic value to obtain a final chaotic diagram and final parameters; and obtaining a random phase plate according to the final parameters, carrying out random phase encoding on the final chaotic map according to the random phase plate to obtain a hidden camouflage signal, and transmitting the hidden camouflage signal through a channel. The invention realizes information hiding, reduces the key transmission overhead of the channel and reduces the encryption and decryption calculation amount in the communication process.
Description
Technical Field
The invention relates to the technical field of data processing, in particular to a channel dynamic encryption method in a communication process.
Background
The transmission of information is carried out by means of a transmission medium, which creates problems of compromise and confidentiality. For example, the wireless communication transmits electromagnetic waves into the air during the signal transmission process, so that not only can the communication partner receive the electromagnetic waves, but also an attacker can intercept and receive the electromagnetic waves. The confidentiality of the wired communication is relatively good, but the leakage factors still exist, and particularly, the crosstalk and radiation of the metal cable, the harmonic radiation of the carrier machine, the eavesdropping of the adversary and the like are all the leakage factors.
In the prior art, the security technology of wired communication is easy to generate information leakage due to crosstalk and radiation of a metal cable, harmonic radiation of a carrier machine, eavesdropping of an attacker and the like, and the existing security communication technology based on a password theory clearly prompts the attacker or a listener which are important information, so that curiosity and attention of the attacker are easily brought, the desire of the attacker to attack and crack is increased, and the security of the security technology is limited.
Therefore, there is a need to propose an encryption method for converting a meaningful transmission signal into a meaningless signal like noise, thereby realizing the concealment of information during communication.
Disclosure of Invention
The invention provides a channel dynamic encryption method in a communication process, which aims to solve the existing problems.
The invention discloses a channel dynamic encryption method in a communication process, which adopts the following technical scheme:
the invention provides a channel dynamic encryption method in a communication process, which comprises the following steps:
preprocessing and modulating an original signal in a communication process to obtain a modulated signal;
converting the modulation signal into a signal diagram, scrambling the signal diagram to obtain a chaotic diagram, obtaining a chaotic value of the chaotic diagram according to the predicted chaotic value of each window matrix, and detecting the chaotic degree of the chaotic diagram according to the chaotic value to obtain a final chaotic diagram and final parameters;
and obtaining a random phase plate according to the final parameters, carrying out random phase encoding on the final chaotic map according to the random phase plate to obtain a hidden camouflage signal, and transmitting the hidden camouflage signal through a channel.
Further, the step of converting the modulated signal into a signal map includes the following specific steps:
sampling the modulated signal by the Nyquist sampling theorem to obtain a sequence of all sample values, wherein the sampling time interval isT is the total time of generation of the modulated signal; converting each sampling value in the sequence into gray value, and collecting all sampling values in the sequenceThe gray value after sample conversion is converted into an image with preset size K multiplied by K and is recorded as a signal diagram.
Further, the converting each sampling value in the sequence into a gray value includes the following specific steps:
wherein ,represents the gray value of the t sampling value after conversion, < >>Represents the t-th sampling value,/-, for>Representing the minimum of all sample values, A representing the amplitude of the modulated signal, < >>Representing absolute value>Representing a rounding down.
Further, the obtaining the chaotic value of the chaotic map comprises the following specific steps:
sliding the chaotic map with the step length of 1 and the sliding window equal to the preset window size k multiplied by k, and detecting the window of the chaotic map to obtain a plurality of windows; a matrix with the size of k multiplied by k formed by gray values of pixel points in each window is recorded as a window matrix of each window; and calculating the predicted chaotic value of each window matrix, and recording the average value of the predicted chaotic values of the window matrices corresponding to all the windows as the chaotic value of the chaotic map.
Further, the calculating the predicted confusion value of each window matrix includes the following specific steps:
where c represents the predicted clutter value of the window matrix, r represents the rank of the window matrix,representing the maximum eigenvalue of the window matrix, +.>Representing the minimum eigenvalue of the window matrix, +.>Gray value representing row 5 and column 5 in the window matrix, ">Representing the gray values of the x rows and y columns in the window matrix, k x k representing the preset window scale,/o>() An exponential function based on a natural constant is represented.
Further, the step of obtaining the final chaotic map and the final parameters by detecting the degree of confusion of the chaotic map comprises the following specific steps:
if the chaotic value of the chaotic map is smaller than or equal to a preset threshold Y, the chaotic map is used as a final chaotic map; if the chaotic value of the chaotic map is larger than a preset threshold Y, adding 1 to two parameters a and b in the transformation matrix respectively to serve as a new transformation matrix, scrambling the signal map according to the new transformation matrix to obtain a new chaotic map, obtaining the chaotic value of the new chaotic map according to the predicted chaotic value of each window matrix, detecting the chaotic degree of the new chaotic map according to the obtained chaotic value, repeating the operation until the chaotic value of the new chaotic map is smaller than the preset threshold Y, taking the new chaotic map at the moment as a final chaotic map, and marking the two parameters a and b in the new transformation matrix as final parameters A, B.
Further, the step of obtaining the random phase plate according to the final parameters comprises the following specific steps:
generating two irrational numbers respectively using final parameters A, B and />According to two irrational numbers +.> and />Obtaining two irrational number sequences, generating the sequences to satisfy +.>A random phase plate uniformly distributed; wherein, two irrational number sequences are respectively:
wherein ,、/>irrational numbers-> and />O is the initial position of irrational number expansion, d is decimal number, K x K is the preset size, also the size of the random phase plate, and N is the length of irrational number sequence.
Further, the step of obtaining the hidden camouflage signal comprises the following specific steps:
and hiding and camouflage the chaotic map by using a double random phase coding technology to obtain a camouflage map, and combining the camouflage map with a final parameter A, B to perform sampling simulation to obtain a hidden camouflage signal.
Further, the preprocessing and modulating operation are performed on the original signal in the communication process to obtain a modulated signal, which comprises the following specific steps:
the method comprises the steps of processing content to be transmitted through a signal simulation technology to obtain an original signal to be transmitted, carrying out corresponding preprocessing work on the original signal to enable the original signal to meet channel transmission requirements, transmitting the processed original signal to a modulator, and modulating the processed original signal by utilizing a carrier signal to obtain a modulated signal.
Further, the preprocessing and modulating operation are performed on the original signal in the communication process to obtain a modulated signal, which comprises the following specific steps:
the coordinates of the pixel points at each position on the signal diagram are subjected to primary coordinate transformation according to generalized Arnold transformation to obtain transformed coordinatesThe pixel points are moved to the transformed coordinates, and the moved image is recorded as a chaotic map.
The technical scheme of the invention has the beneficial effects that: when the original signal channel is transmitted, the information is not transmitted after being symmetrically encrypted by the existing encryption method, but the whole signal is camouflaged and hidden by combining the phase characteristics of the signal and the noise characteristics of the channel, so that the original signal channel is transmitted in a form close to the noise of the channel during transmission, the information hiding is realized, the key transmission overhead of the channel is reduced, and the encryption and decryption calculation amount in the communication process is reduced.
Drawings
In order to more clearly illustrate the embodiments of the invention or the technical solutions in the prior art, the drawings that are required in the embodiments or the description of the prior art will be briefly described, it being obvious that the drawings in the following description are only some embodiments of the invention, and that other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
Fig. 1 is a flow chart of a method for dynamically encrypting a channel in a communication process according to the present invention.
Detailed Description
In order to further describe the technical means and effects adopted by the present invention to achieve the preset purpose, the following detailed description refers to the specific implementation, structure, characteristics and effects of a channel dynamic encryption method in a communication process according to the present invention with reference to the accompanying drawings and preferred embodiments. In the following description, different "one embodiment" or "another embodiment" means that the embodiments are not necessarily the same. Furthermore, the particular features, structures, or characteristics of one or more embodiments may be combined in any suitable manner.
Unless defined otherwise, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this invention belongs.
The following specifically describes a specific scheme of a channel dynamic encryption method in a communication process provided by the invention with reference to the accompanying drawings.
Referring to fig. 1, a method flow chart of a data transmission module of a channel dynamic encryption method in a communication process according to an embodiment of the invention is shown, where the method includes:
s001, preprocessing and modulating the original signal in the communication process to obtain a modulated signal.
It should be noted that, in this embodiment, channel dynamic encryption is mainly performed in the communication process, so that an original signal transmitted in a channel needs to be acquired.
Specifically, the content to be transmitted is processed through a signal simulation technology to obtain an original signal to be transmitted, the original signal is subjected to corresponding preprocessing work to enable the original signal to meet the channel transmission requirement, the processed original signal is transmitted to a modulator, and the carrier signal is used for modulating the processed original signal to obtain a modulated signal.
S002, converting the modulated signals into signal diagrams, scrambling the signal diagrams to obtain chaotic diagrams, obtaining chaotic values of the chaotic diagrams according to the predicted chaotic values of each window matrix, and detecting the chaotic degree of the chaotic diagrams according to the chaotic values to obtain the final chaotic diagrams.
It should be noted that, because the modulated signal carries significant information, the regularity of the modulated signal in the channel is extremely high, the difference from surrounding noise is obvious, once the modulated signal is captured by an attacker through the channel, the problem of significant information leakage can be generated, therefore, the embodiment firstly converts the modulated signal into a signal diagram, the signal diagram is scrambled by using generalized Arnold transformation iteratively, after each scrambling operation, the degree of confusion of the signal diagram is obtained by combining the relevance of local area pixels in the signal diagram, whether the chaotic diagram has reached the disordered requirement is judged according to the degree of confusion, and the scrambling is continued on the degree of confusion which does not reach the disordered requirement until a disordered chaotic map meeting the condition is obtained.
1. The modulated signal is converted into a signal pattern.
A dimension kxk is preset, wherein the present embodiment kxk=256×256 is described as an example, and the present embodiment is not particularly limited, wherein kxk depends on the specific implementation.
Specifically, the modulated signal is sampled by the nyquist sampling theorem to obtain a sequence of all sampled values, wherein the sampling time interval isT is the total time for which the modulated signal is generated.
Further, each sampling value in the sequence is converted into a gray value, and a specific calculation formula is as follows:
wherein ,represents the gray value of the t sampling value after conversion, < >>Represents the t-th sampling value,/-, for>Representing the minimum of all sample values, A representing the amplitude of the modulated signal, < >>Representing absolute value>Representing a rounding down.
And converting the gray values after conversion of all sampling values in the sequence into images with preset size K multiplied by K, and recording the images as signal diagrams.
It should be noted that, since the whole modulated signal needs to be converted into a signal diagram for subsequent transformation and encryption, the sampled value needs to be quantized and distributed to the gray value interval of [0,255 ]; because the signal wave has the characteristic that the signal wave has a signal value smaller than 0, the data of the sampled data are required to be corrected by utilizing the minimum trough value to ensure that the value is larger than or equal to 0, then the normalization operation is carried out by utilizing the signal amplitude, and finally the interval widening is carried out, so that the interval range of the gray value of the image pixel is met, and the subsequent imaging operation is convenient.
2. Scrambling the signal pattern to obtain a chaotic pattern.
Specifically, the signal diagram is scrambled according to the transformation matrix to obtain a chaotic diagram, and the specific process is as follows: the coordinates of the pixel points at each position on the signal diagram are subjected to primary coordinate transformation according to generalized Arnold transformation to obtain transformed coordinatesThe pixel points are moved to the transformed coordinates, and the moved image is recorded as a chaotic map.
The specific calculation formula of the generalized Arnold transformation is as follows:
in the public domain, the public domain has the functions of,a transformation matrix in generalized Arnold transformation is represented, a and b respectively represent two different parameters in the transformation matrix, and x and y respectively represent an abscissa and an ordinate before pixel point transformation; />、/>Respectively representing the abscissa and the ordinate after the pixel point transformation, mod represents the modulo operation.
In the present embodiment, two parameters in the transformation matrix are a=1 and b=2, respectively.
3. Obtaining the chaotic value of the chaotic map according to the predicted chaotic value of each window matrix.
A window size kxk is preset, where kxk=9×9 is described as an example, and the present embodiment is not particularly limited, where kxk depends on the specific implementation.
Specifically, after one generalized Arnold transformation, obtaining a chaotic value of the chaotic map according to a predicted chaotic value of each window matrix, wherein the specific process is as follows:
sliding the chaotic map with the step length of 1 and the sliding window equal to the preset window size k multiplied by k, and detecting the window of the chaotic map to obtain a plurality of windows; a matrix with the size of k multiplied by k formed by gray values of pixel points in each window is recorded as a window matrix of each window; calculating a predicted confusion value of each window matrix, wherein a specific calculation formula is as follows:
where c represents the predicted clutter value of the window matrix, r represents the rank of the window matrix,representing the maximum eigenvalue of the window matrix, +.>Representation ofMinimum eigenvalue of window matrix,/>Gray value representing row 5 and column 5 in the window matrix, ">Gray values representing the x-th row and y-th column in the window matrix, k x k representing a preset window scale,/for>() An exponential function based on a natural constant is represented.
For gray values in the window matrix, if the number of vectors with linearity irrelevant is larger, the lower the relevance among elements in the window matrix is, the more disordered the distribution of the gray values in the window matrix is, so that the relevance can be quantified by using the rank of the window matrix; for the window matrix, the larger the range of the characteristic value is, the higher the instability of the window matrix is, the larger the difference between elements in the window matrix is, and the more chaotic the distribution of gray values in the window matrix is; in addition, for the window matrix, if the difference between the average value in the window matrix and the central value of the window matrix is larger, the distribution of gray values in the window matrix is more chaotic and less concentrated, and meanwhile, the inverse proportion function is utilized to enable the gray values to conform to the overall logic of the formula; the larger the clutter predicted value, the more the gray value distribution values in the window matrix are disordered, and the less the represented carrying information is, the more noise is approached.
Further, the average value of the predicted chaotic values of the window matrices corresponding to all the windows is recorded as the chaotic value of the chaotic map.
4. And detecting the degree of confusion of the chaotic map according to the chaotic value, and obtaining the final chaotic map.
A threshold value Y is preset, where the present embodiment is described by taking y=0.5 as an example, and the present embodiment is not particularly limited, where Y depends on the specific implementation.
Specifically, the confusion degree detection is carried out on the chaotic map according to the obtained chaotic value, and the specific process is as follows: if the chaotic value of the chaotic map is smaller than or equal to a preset threshold Y, indicating that the chaotic map has reached the unordered requirement, and taking the chaotic map as a final chaotic map; if the chaotic value of the chaotic map is larger than a preset threshold Y, the chaotic map is higher in correlation, two parameters a and b in the transformation matrix are added with 1 to serve as new transformation matrices respectively, a signal map is scrambled according to the new transformation matrices to obtain a new chaotic map, the chaotic value of the new chaotic map is obtained according to the predicted chaotic value of each window matrix, the chaotic degree detection is carried out on the new chaotic map according to the obtained chaotic value, the operation is repeated until the chaotic value of the new chaotic map is smaller than the preset threshold Y, the new chaotic map at the moment is taken as a final chaotic map, and the two parameters a and b in the new transformation matrix are recorded as final parameters A, B.
It should be noted that, the chaotic value is used to detect the disorder of the chaotic map, so as to control the iteration times of the generalized Arnold transformation, achieve the reasonable control of the transformation algorithm, reduce the unnecessary repeated scrambling operation, reduce the calculation amount of the whole algorithm, and save the channel resources.
S003, carrying out random phase encoding on the final chaotic map to obtain a hidden camouflage signal.
It should be noted that, for the final chaotic map of the chaotic degree meeting the disordered requirement, the random disorder is enhanced through the double random phase coding, so that the final chaotic map is closer to noise signals in the channel, and hidden information can be better disguised when signal transmission is carried out in the channel, and eavesdropping attacks are prevented.
Specifically, a double-random phase coding technology is used for hiding and camouflaging a chaotic map to obtain a camouflage map, the double-random phase coding is used for encrypting an image to be encrypted through two different random phase plates RPM, and the generation mode of the random phase plates RPM in the double-random phase coding technology is as follows: generating two irrational numbers respectively using final parameters A, B and />According to two irrational numbers +.> and />Obtaining two irrational number sequences, generating the sequences to satisfy +.>A random phase plate uniformly distributed; wherein, two irrational number sequences are respectively:
wherein ,、/>irrational numbers-> and />O is the initial position of irrational number expansion, d is decimal number, kxK is the preset size, also the size of the random phase plate, N is the length of irrational number sequence, and +.>。
It should be noted that, because the irrational number is an infinite non-cyclic decimal, the period is infinitely long, the randomness, the autocorrelation, the power spectrum and the maximum Lyapunov index of the irrational number sequence indicate that the method has good chaos-like characteristics, and the method is constructed into a random phase mask plate as a secret key, so that the difficulty of decoding can be improved, and the safety of information can be effectively ensured.
Further, the camouflage pattern and the final parameter A, B are combined for sampling simulation to obtain a hidden camouflage signal, and the hidden camouflage signal is transmitted through a channel.
S004, decrypting and demodulating the hidden camouflage signal to obtain an original signal.
After receiving the hidden camouflage signal, the receiving end converts the hidden camouflage signal into a signal diagram through reverse double random phase coding and reverse generalized Arnold conversion, and after restoring the modulated signal by the signal diagram, the modulating signal is demodulated by a modulator to obtain an original signal, so that the dynamic encryption transmission of the whole signal is completed.
The present invention has been completed.
When the original signal channel is transmitted, the information is not transmitted after being symmetrically encrypted by the existing encryption method, but the whole signal is camouflaged and hidden by combining the phase characteristics of the signal and the noise characteristics of the channel, so that the original signal channel is transmitted in a form close to the noise of the channel during transmission, the information hiding is realized, the key transmission overhead of the channel is reduced, and the encryption and decryption calculation amount in the communication process is reduced.
The foregoing description of the preferred embodiments of the invention is not intended to be limiting, but rather is intended to cover all modifications, equivalents, alternatives, and improvements that fall within the spirit and scope of the invention.
Claims (8)
1. A method for dynamically encrypting a channel in a communication process, the method comprising:
preprocessing and modulating an original signal in a communication process to obtain a modulated signal;
converting the modulation signal into a signal diagram, scrambling the signal diagram to obtain a chaotic diagram, obtaining a chaotic value of the chaotic diagram according to the predicted chaotic value of each window matrix, and detecting the chaotic degree of the chaotic diagram according to the chaotic value to obtain a final chaotic diagram and final parameters;
obtaining a random phase plate according to the final parameters, carrying out random phase encoding on the final chaotic map according to the random phase plate to obtain a hidden camouflage signal, and transmitting the hidden camouflage signal through a channel;
the obtaining of the chaotic value of the chaotic map comprises the following specific steps:
sliding the chaotic map with the step length of 1 and the sliding window equal to the preset window size k multiplied by k, and detecting the window of the chaotic map to obtain a plurality of windows; a matrix with the size of k multiplied by k formed by gray values of pixel points in each window is recorded as a window matrix of each window; calculating a predicted chaotic value of each window matrix, and recording an average value of the predicted chaotic values of the window matrices corresponding to all windows as a chaotic value of a chaotic map;
the method for obtaining the random phase plate according to the final parameters comprises the following specific steps:
generating two irrational numbers respectively using final parameters A, B and />According to two irrational numbers +.> and />Obtaining two irrational number sequences, generating the sequences to satisfy +.>A random phase plate uniformly distributed; wherein, two irrational number sequences are respectively:
wherein ,、/>irrational numbers-> and />O is the initial position of irrational number expansion, d is decimal number, K x K is the preset size, also the size of the random phase plate, and N is the length of irrational number sequence.
2. The method for dynamically encrypting a channel in a communication process according to claim 1, wherein said converting the modulated signal into a signal pattern comprises the steps of:
sampling the modulated signal by the Nyquist sampling theorem to obtain a sequence of all sample values, wherein the sampling time interval isT is the total time of generation of the modulated signal; and converting each sampling value in the sequence into a gray value, converting the gray value converted by all the sampling values in the sequence into an image with preset size K multiplied by K, and recording the image as a signal diagram.
3. A method for dynamically encrypting a channel in a communication process according to claim 2, wherein said converting each sample value in the sequence into a gray value comprises the steps of:
wherein ,represents the gray value of the t sampling value after conversion, < >>Represents the t-th sampling value,/-, for>Representing the minimum of all sample values, A representing the amplitude of the modulated signal, < >>Representing absolute value>Representing a rounding down.
4. The method for dynamically encrypting a channel in a communication process according to claim 1, wherein said calculating the predicted confusion value of each window matrix comprises the following specific steps:
where c represents the predicted clutter value of the window matrix, r represents the rank of the window matrix,representing the maximum eigenvalue of the window matrix, +.>Representing the minimum eigenvalue of the window matrix, +.>Representing the gray values of row 5 and column 5 in the window matrix,representing in a window matrixGray values of x rows and y columns of (k x k) represent a predetermined window size,/>() An exponential function based on a natural constant is represented.
5. The method for dynamically encrypting a channel in a communication process according to claim 1, wherein said detecting the degree of confusion of the chaotic map to obtain a final chaotic map and final parameters comprises the following specific steps:
if the chaotic value of the chaotic map is smaller than or equal to a preset threshold Y, the chaotic map is used as a final chaotic map; if the chaotic value of the chaotic map is larger than a preset threshold Y, adding 1 to two parameters a and b in the transformation matrix respectively to serve as a new transformation matrix, scrambling the signal map according to the new transformation matrix to obtain a new chaotic map, obtaining the chaotic value of the new chaotic map according to the predicted chaotic value of each window matrix, detecting the chaotic degree of the new chaotic map according to the obtained chaotic value, repeating the operation until the chaotic value of the new chaotic map is smaller than the preset threshold Y, taking the new chaotic map at the moment as a final chaotic map, and marking the two parameters a and b in the new transformation matrix as final parameters A, B.
6. The method for dynamically encrypting a channel in a communication process according to claim 1, wherein said obtaining a hidden camouflage signal comprises the steps of:
and hiding and camouflage the chaotic map by using a double random phase coding technology to obtain a camouflage map, and combining the camouflage map with a final parameter A, B to perform sampling simulation to obtain a hidden camouflage signal.
7. The method for dynamically encrypting a channel in a communication process according to claim 1, wherein the preprocessing and modulating operations are performed on an original signal in the communication process to obtain a modulated signal, comprising the following specific steps:
the method comprises the steps of processing content to be transmitted through a signal simulation technology to obtain an original signal to be transmitted, carrying out corresponding preprocessing work on the original signal to enable the original signal to meet channel transmission requirements, transmitting the processed original signal to a modulator, and modulating the processed original signal by utilizing a carrier signal to obtain a modulated signal.
8. The method for dynamically encrypting a channel in a communication process according to claim 1, wherein the preprocessing and modulating operations are performed on an original signal in the communication process to obtain a modulated signal, comprising the following specific steps:
the coordinates of the pixel points at each position on the signal diagram are subjected to primary coordinate transformation according to generalized Arnold transformation to obtain transformed coordinatesThe pixel points are moved to the transformed coordinates, and the moved image is recorded as a chaotic map.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311174484.7A CN116915508B (en) | 2023-09-13 | 2023-09-13 | Channel dynamic encryption method in communication process |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311174484.7A CN116915508B (en) | 2023-09-13 | 2023-09-13 | Channel dynamic encryption method in communication process |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN116915508A true CN116915508A (en) | 2023-10-20 |
| CN116915508B CN116915508B (en) | 2023-12-12 |
Family
ID=88351478
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202311174484.7A Active CN116915508B (en) | 2023-09-13 | 2023-09-13 | Channel dynamic encryption method in communication process |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116915508B (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105447396A (en) * | 2015-12-15 | 2016-03-30 | 西安电子科技大学 | Fractional domain image encryption method based on Arnold transformation and compound chaos |
| CN111832035A (en) * | 2019-04-23 | 2020-10-27 | 北京掌慧纵盈科技股份有限公司 | Image encryption storage method and device |
| WO2021104344A1 (en) * | 2019-11-29 | 2021-06-03 | 童勤业 | Anti-counterfeiting and encryption method based on random image scrambling technique |
| CN115567186A (en) * | 2022-09-22 | 2023-01-03 | 沈阳理工大学 | Chaos-optimized depth window scrambling encryption method |
| CN115883057A (en) * | 2023-03-08 | 2023-03-31 | 山东省鲁岳资源勘查开发有限公司 | Geographic information mapping system based on remote sensing image |
-
2023
- 2023-09-13 CN CN202311174484.7A patent/CN116915508B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105447396A (en) * | 2015-12-15 | 2016-03-30 | 西安电子科技大学 | Fractional domain image encryption method based on Arnold transformation and compound chaos |
| CN111832035A (en) * | 2019-04-23 | 2020-10-27 | 北京掌慧纵盈科技股份有限公司 | Image encryption storage method and device |
| WO2021104344A1 (en) * | 2019-11-29 | 2021-06-03 | 童勤业 | Anti-counterfeiting and encryption method based on random image scrambling technique |
| CN115567186A (en) * | 2022-09-22 | 2023-01-03 | 沈阳理工大学 | Chaos-optimized depth window scrambling encryption method |
| CN115883057A (en) * | 2023-03-08 | 2023-03-31 | 山东省鲁岳资源勘查开发有限公司 | Geographic information mapping system based on remote sensing image |
Non-Patent Citations (2)
| Title |
|---|
| 石小燕: "基于双随机相位编码的图像隐藏技术研究", 《中国优秀博士学位论文 信息科技辑》 * |
| 陈令羽 等: "基于置乱－代换机制的ＴＩＮ ＤＥＭ 信息伪装", 《武汉大学学报· 信息科学版》, vol. 42, no. 7 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN116915508B (en) | 2023-12-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Yuen et al. | A chaos-based joint image compression and encryption scheme using DCT and SHA-1 | |
| CN112714235B (en) | Image encryption method based on filling curve and adjacent pixel bit scrambling | |
| CN110677236B (en) | OFDM encryption method based on composite chaotic system and XOR operation | |
| CN114579993A (en) | Image encryption method based on quantum key distribution and pixel scrambling | |
| Aziz et al. | A Noise‐Tolerant Audio Encryption Framework Designed by the Application of S8 Symmetric Group and Chaotic Systems | |
| CN113271201A (en) | Dynamic AES physical layer data encryption method | |
| CN116915508B (en) | Channel dynamic encryption method in communication process | |
| CN117082502A (en) | Data acquisition and signal identification method based on data information encryption method | |
| CN116016795A (en) | Image encryption method based on variable step length extraction random number and improved ZigZag conversion | |
| CN116192362A (en) | Lyapunov exponent adjustable chaotic system and image encryption and decryption method | |
| CN116192360A (en) | Asymmetric visual sense meaningful image encryption method based on 2D compressed sensing | |
| CN115225249A (en) | MP-WFRFT communication method and system based on multi-cascade chaotic encryption | |
| CN114915695B (en) | Bit-level image encryption method based on 2D-Chebyshev chaotic mapping | |
| CN113254963A (en) | Color image encryption method based on L-P chaotic cross diffusion and cyclic shift | |
| Vanamala et al. | Genetic algorithm and chaotic maps based visually meaningful image encryption | |
| Mao | Algorithm of Encrypting Digital Image Using Chaos Neural Network | |
| Lotlikar et al. | Image steganography and cryptography using three level password security | |
| CN113949503B (en) | WFRFT (Wireless Fidelity-rft) secure communication method based on DNA dynamic coding | |
| Abduljabbar et al. | Robust scheme to protect authentication code of message/image documents in cloud computing | |
| CN111314046B (en) | Image encryption and decryption method based on Arnold transformation and fractional order chaotic sequence | |
| Debnath et al. | An Approach Towards Data Security Based on DCT and Chaotic Map | |
| CN108234062A (en) | A kind of safe transmission method based on signal characteristic complication of eating dishes without rice or wine | |
| Liu et al. | A block compressed sensing for images selective encryption in cloud | |
| Yuan et al. | Robust hybrid plaintext-related image encryption using hyper chaos signal processing | |
| Aziz et al. | Research Article A Noise-Tolerant Audio Encryption Framework Designed by the Application of S8 Symmetric Group and Chaotic Systems |
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 |