CN117579227A - Error code number resisting run feature analysis information hiding method and system based on channel coding - Google Patents
Error code number resisting run feature analysis information hiding method and system based on channel coding Download PDFInfo
- Publication number
- CN117579227A CN117579227A CN202311600837.5A CN202311600837A CN117579227A CN 117579227 A CN117579227 A CN 117579227A CN 202311600837 A CN202311600837 A CN 202311600837A CN 117579227 A CN117579227 A CN 117579227A
- Authority
- CN
- China
- Prior art keywords
- embedding
- group
- pos
- channel coding
- secret information
- 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.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 50
- 238000004458 analytical method Methods 0.000 title claims abstract description 21
- 238000000605 extraction Methods 0.000 claims abstract description 35
- 239000011159 matrix material Substances 0.000 claims abstract description 27
- 230000008569 process Effects 0.000 claims abstract description 21
- 238000004891 communication Methods 0.000 claims abstract description 16
- 239000013598 vector Substances 0.000 claims abstract description 8
- 230000009191 jumping Effects 0.000 claims description 21
- 238000012937 correction Methods 0.000 claims description 18
- 238000004364 calculation method Methods 0.000 claims description 4
- 238000004590 computer program Methods 0.000 claims description 3
- 230000005540 biological transmission Effects 0.000 description 5
- 238000004422 calculation algorithm Methods 0.000 description 4
- 230000006872 improvement Effects 0.000 description 4
- 238000003491 array Methods 0.000 description 2
- 125000004122 cyclic group Chemical group 0.000 description 2
- 238000007619 statistical method Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 230000006835 compression Effects 0.000 description 1
- 238000007906 compression Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000011084 recovery Methods 0.000 description 1
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/0009—Systems modifying transmission characteristics according to link quality, e.g. power backoff by adapting the channel 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
- H04L1/0057—Block codes
-
- 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/0838—Key agreement, i.e. key establishment technique in which a shared key is derived by parties as a function of information contributed by, or associated with, each of these
-
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Computer Security & Cryptography (AREA)
- Quality & Reliability (AREA)
- Error Detection And Correction (AREA)
Abstract
The invention discloses a channel coding-based error number run feature analysis information hiding method and system, comprising an embedding process and an extraction process, wherein in the embedding process, the number of groups and the number of secret information to be embedded in each group are determined according to coding types, key vectors are generated through keys confirmed in advance by two communication parties, an embedding position matrix of each group is generated according to the key vectors, embedding operation is carried out on a carrier sequence according to the embedding position matrix of each group, if and only if the embedding can cause error codes, embedding is carried out, otherwise, the next embeddable point is searched until the embedding is finished; the extraction process is the same as the embedding process. According to the method, each time of secret information embedding can cause error codes, so that the variation of error code number runlengths of a carrier sequence is reduced, and code group-based error code number runlength characteristic analysis can be effectively resisted.
Description
Technical Field
The invention belongs to the technical field of information security, and particularly relates to an anti-error number run feature analysis information hiding method and system based on channel coding.
Background
The applicability of the information hidden transmission system is not only reflected in that the communication can be normally carried out, but also in that the information hidden transmission system has safety, robustness and popularization. The concealed transmission system (Covert transmission system based on wireless coding channel) based on the wireless coding channel aims at designing a framework of 'compression error correction coding' - 'as noise embedding' - 'lossless decoding recovery', and utilizes Huffman coding, error correction coding and convolutional codes to propose a novel information hiding algorithm, and adopts wireless communication to realize the functions.
On the basis of realizing the basic hidden communication (Covert Communication) function, the safety and the robustness of information hiding should also be ensured. Most of the existing information hiding algorithms rely on the privacy of a secret key to ensure that an attacker cannot acquire hidden secret information in a data carrier code stream, however, the attacker does not care about the influence on the statistical characteristics of the data carrier code stream sequence after the secret information is embedded, and the attacker can discover that the secret information is hidden in the code stream by carrying out statistical analysis on certain characteristics because the statistical characteristics of the data carrier code stream sequence after the secret information is embedded change and are different from the data carrier code stream sequence under natural noise. The 'channel coding layer steganalysis algorithm based on code group error number run feature' can find out whether secret information is hidden in the carrier code stream sequence by carrying out statistical analysis on the error number run feature of the carrier code stream sequence. An information hiding algorithm capable of resisting steganalysis attack is designed, so that an information hiding system is safer and more reliable, and the information hiding system is a development trend of future information hiding systems.
Disclosure of Invention
The invention provides a channel coding-based error number run feature analysis information hiding method and system, which aims to overcome the problems in the prior art, and comprises an embedding process and an extraction process, wherein in the embedding process, the number of groups and the number of secret information to be embedded in each group are determined according to coding types, key vectors are generated through keys confirmed in advance by two communication parties, an embedding position matrix of each group is generated according to the key vectors, embedding operation is carried out on a carrier sequence according to the embedding position matrix of each group, if and only if the embedding can cause error codes, embedding is carried out, otherwise, the next embeddable point is searched until the embedding is finished; the extraction process is the same as the embedding process. According to the method, each time of secret information embedding can cause error codes, so that the variation of error code number runlengths of a carrier sequence is reduced, and code group-based error code number runlength characteristic analysis can be effectively resisted.
In order to achieve the above purpose, the technical scheme adopted by the invention is as follows: the error number resisting run feature analysis information hiding method based on channel coding comprises an embedding process and an extracting process, wherein the embedding process is implemented by a transmitting end and specifically comprises the following steps of:
s1, calculating initial parameters: determining the group number according to the length of the carrier sequence after channel coding and the coding type adopted by the channel coding, and calculating the secret information number round to be embedded in each group;
s2, generating an embedded position matrix of each group: generating a group array with a length according to keys negotiated in advance by two communication parties, generating a group matrix A with a size of n by taking each number in the array as a key, and maintaining an array pos_A with a size of 1 x group, wherein the ith number j represents the ith row and the jth column of A which are scanned currently by the ith packet;
s3, secret information embedding: if count=m, step S6 is executed in a skip mode; otherwise, when the ith packet is embedded (i starts from 1), judging whether the (n-1) +A (i, pos_A (i))) bit of c is equal to the count bit of m, if so, embedding the secret information of the count bit into the (n-1) +A (i, pos_A (i))) bit of c, and then jumping to execute step S4; if not, indicating that the embedding is failed, and jumping to execute the step S5;
wherein, (n-1) +a (i, pos_a (i))) represents a position to be embedded in the carrier sequence, count represents that secret information is embedded into the count th at that time, c represents the carrier sequence after channel coding, and m represents the secret information sequence after error correction coding;
s4, updating parameters after successful embedding: updating the value of the ith element of pos_A, turning to the next packet for embedding, updating count at the same time, and then jumping to execute the step S3; the expression is as follows:
pos_A(i)＝pos_A(i)+1
i＝(i+1)mod group
count＝count+1
s5, updating parameters after embedding failure: updating the value of the ith element of pos_a, and then jumping to execute step S3; the expression is as follows:
pos_A(i)＝pos_A(i)+1
s6, finishing embedding: the embedding is completed.
As an improvement of the present invention, in the step S1, the expression of the packet number group in the initial parameters is as follows:
group＝C/n
wherein, C is the length of the carrier sequence after channel coding, and the channel coding adopts (n, k, t) BCH codes;
the number of secret information to be embedded in the initial parameters round expression is as follows:
where M represents the length of the error correction coded secret information sequence.
As an improvement of the invention, the extraction process is implemented by the receiving end, and specifically comprises the following steps:
s1', initial parameter calculation: determining the group number according to the length of the carrier sequence after channel coding and the coding type adopted by the channel coding, and calculating the secret information number round required to be extracted by each group;
s2', generating an extraction position matrix of each group: generating a group array with a length according to keys negotiated in advance by two communication parties, generating a group matrix A with a size of n by taking each number in the array as a key, and maintaining an array pos_A with a size of 1 x group, wherein the ith number j represents the ith row and the jth column of A which are scanned currently by the ith packet;
s3', secret information extraction: if count=m, step S6' is performed; otherwise, when the ith packet is extracted (i starts from 1), judging whether the (n (i-1) +a (i, pos_a (i))) bits of c and c 'are equal, if so, jumping to step S4'; if not, indicating that the position does not store the secret information, and executing step S5';
wherein, (n-1) +a (i, pos_a (i))) represents a position in the carrier sequence where secret information may be hidden, c represents the carrier sequence after channel coding, c' represents the code stream sequence received by the receiving end, and m represents the secret information sequence after error correction coding;
s4', updating parameters after successful extraction: updating the value of the ith element of pos_A, turning to the next group for extraction, updating count at the same time, and then jumping to execute step S3'; the expression is as follows:
pos_A(i)＝pos_A(i)+1
i＝(i+1)mod group
count＝count+1
s5', updating parameters after extraction failure: updating the value of the ith element of pos_a, and then jumping to execute step S3'; the expression is as follows:
pos_A(i)＝pos_A(i)+1
s6', finishing extraction: extraction is complete.
As another improvement of the present invention, in the step S1', the expression of the packet number group in the initial parameters is as follows:
group＝C/n
wherein, C is the length of the carrier sequence after channel coding, and the channel coding adopts (n, k, t) BCH codes;
the expression of the secret information number round in the initial parameters is as follows:
where M is the length of the error correction coded secret information sequence.
In order to achieve the above purpose, the technical scheme adopted by the invention is as follows: a channel coding based anti-error number run-length feature analysis information hiding system comprising a computer program which when executed by a processor performs the steps of a method as described in any one of the above.
Compared with the prior art, the invention has the following beneficial effects:
(1) The invention considers the relation between code groups when embedding, so that the error code numbers of adjacent code groups are the same as possible, and the method can resist the attack of the run feature analysis based on the error code numbers of the code groups in the information hiding process, and has higher safety.
(2) The position matrix is generated before embedding and extracting, so that errors caused by repeated embedding and extracting can be avoided.
(3) The invention only needs the two communication parties to negotiate a secret key in advance, so that the method has more practicability. Meanwhile, the application of the secret key enables the method to have higher security.
Drawings
FIG. 1 is a flow chart of the embedding process in the method of the present invention;
fig. 2 is a flow chart of the extraction process in the method of the present invention.
Detailed Description
The present invention is further illustrated in the following drawings and detailed description, which are to be understood as being merely illustrative of the invention and not limiting the scope of the invention.
Example 1
The symbols in this scheme and their definitions are shown in table 1:
TABLE 1
| (symbol) | Definition of the definition |
| group | Number of packets of a carrier sequence |
| C | Length of carrier sequence after channel coding |
| n | Packet size |
| round | The number of secret information to be embedded/extracted per packet |
| A | Position matrix |
| count | Number of secret information embedding/extracting |
| c | Channel coded carrier sequences |
| c’ | Code stream sequence received by receiving end |
| m | Error correction coded secret information sequence |
| M | Length of error correction coded secret information sequence |
The channel coding-based anti-error number run feature analysis information hiding method comprises an embedding process and an extraction process, wherein in the embedding process, initial parameters are calculated first, and the number of groups and the number of secret information to be embedded in each group are determined according to coding types; generating a key vector through keys which are negotiated in advance by two communication parties, and generating an embedding position matrix of each group according to the key vector so as to prevent repeated embedding; the method comprises the steps of starting embedding operation on a carrier sequence according to an embedding position matrix of each group, and embedding only when error code is caused by embedding, otherwise, searching for the next embeddable point until the embedding is finished; the extraction process is the same as the embedding process, and the code group-based error code number run-length feature analysis can be effectively resisted by the embedding and extraction method.
The error number resisting run feature analysis information hiding method based on channel coding includes the following steps:
step S1, initial parameter calculation: this operation includes two sub-parts.
S11, calculating the group number. And determining the number of the groups according to the length of the carrier sequence after the channel coding and the coding type adopted by the channel coding. Comprises the following steps:
(1.1.1) selecting the coding type used for channel coding, we use (n, k, t) BCH codes in this invention.
(1.1.2) calculating the number of packets according to the coding type.
The expression of the initial parameter group is as follows:
group＝C/n
wherein, C is the length of the carrier sequence after channel coding, and the channel coding adopts (n, k, t) BCH codes.
S12, calculating the number round of secret information to be embedded in each packet. The number of secret information to be embedded in each packet, namely the round of cyclic embedding, is determined according to the number of packets and the length of the secret information sequence. Comprises the following steps:
(1.2.1) calculating the number of secret information of each packet:m is the length of the error correction coded secret information sequence.
S2, generating an embedded position matrix of each group. Comprises the following steps:
and (2.1) the transmitting end generates a group of arrays with the length of group according to the key which is negotiated in advance by the two communication parties.
And (2.2) generating a matrix A with a group size of n by taking each number in the array as a key, wherein the matrix A is used as a sequential scanning position when each group is embedded, namely the matrix A is the obtained embedded position matrix.
In addition, an array pos_a of 1 x group size is maintained, wherein the ith number j represents the ith row and the jth column number of a that the ith packet has been scanned currently, so as to prevent the phenomenon of repeated embedding.
S3, secret information is embedded. The method comprises the following steps:
and (3.1) judging the size relation between the count and the M, and executing the step S6 if the size relation is equal to the size relation between the count and the M. Otherwise, the embedding is continued.
(3.2) when the ith packet is embedded (i starts from 1), judging whether the (n (i-1) +a (i, pos_a (i))) bit of c is equal to the count bit of m, if so, embedding the secret information of the count bit into the (n (i-1) +a (i, pos_a (i))) bit of c, and then jumping to execute step S4; if not, indicating that the embedding is failed, and executing step S5 in a jumping manner.
Wherein, (n-1) +a (i, pos_a (i))) represents a position to be embedded in the carrier sequence, count represents that secret information is embedded in the count th at that time, c represents the carrier sequence after channel coding, and m represents the secret information sequence after error correction coding.
S4, updating parameters after successful embedding, including the following steps:
(4.1) updating the value of the i-th element of pos_a, pos_a (i) =pos_a (i) +1.
(4.2) go to the next packet for embedding, i= (i+1) mod group.
(4.3) updating the count value, count=count+1.
(4.4) jumping to execute step S3.
S5, updating parameters after embedding failure, comprising the following steps:
(5.1) updating the value of the i-th element of pos_a, pos_a (i) =pos_a (i) +1.
(5.2) jumping to execute step S3.
S6, finishing embedding: the embedding is completed.
Fig. 2 shows the extraction process of the method, namely the error number resistant run feature analysis information hiding method based on channel coding, wherein the extraction process is the same as the embedding process, and specifically comprises the following steps:
step S1', initial parameter calculation: this operation includes three sub-parts.
S1'1, calculating the number of groups. And determining the number of the groups according to the length of the carrier sequence after the channel coding and the coding type adopted by the channel coding. Comprises the following steps:
(1.1.1) selecting the coding type used for channel coding, we use (n, k, t) BCH codes in this invention.
(1.1.2) calculating the number of packets according to the coding type.
The expression of the initial parameter group is as follows:
group＝C/n
wherein, C is the length of the carrier sequence after channel coding, and the channel coding adopts (n, k, t) BCH codes.
S1'2, calculating the length M of the secret information sequence after error correction coding: since each embedding will cause error code, we will compare the original carrier sequence after channel coding with the received code stream sequence, and the number of different elements is the length M of the secret information sequence after error correction coding.
S1'3, calculating the number of secret information round which needs to be embedded in each packet. The number of secret information to be embedded in each packet, namely the round of cyclic embedding, is determined according to the number of packets and the length of the secret information sequence. Comprises the following steps:
(1.3.1) calculating the number of secret information of each packet:m is the length of the error correction coded secret information sequence.
S2', generating an extraction position matrix of each group. Comprises the following steps:
and (2.1) receiving a group of arrays with the length of group generated according to the key negotiated in advance by the two communication parties.
And (2.2) taking each number in the array as a key to generate a matrix A with a group size of n as a sequential scanning position during extraction of each group, namely, the matrix A is the obtained extraction position matrix. In addition, an array pos_a of 1 x group size is maintained, wherein the ith number j represents the ith row and the jth column number of a that the ith packet has been scanned currently, so as to prevent the phenomenon of repeated extraction.
S3', secret information is extracted. The method comprises the following steps:
and (3.1) judging the size relation between count and M, and executing step S6' if the count and M are equal. Otherwise, continuing to extract.
(3.2) when the i-th packet is extracted (i starts from 1), judging whether the (n-th (i-1) +a (i, pos_a (i))) bits of c and c 'are equal, if so, if it indicates that the position stores secret information, jumping to step S4'; if not, it is indicated that the location does not store the secret information, and the process goes to step S5'. c represents the carrier sequence after channel coding, c' represents the code stream sequence received by the receiving end, and m represents the secret information sequence after error correction coding.
S4', updating parameters after successful extraction, wherein the method comprises the following steps of:
(4.1) updating the value of the i-th element of pos_a, pos_a (i) =pos_a (i) +1.
(4.2) go to the next packet for embedding, i= (i+1) mod group.
(4.3) updating the count value, count=count+1.
(4.4) jumping to execute step S3.
S5', updating parameters after extraction failure, wherein the method comprises the following steps of:
(5.1) updating the value of the i-th element of pos_a, pos_a (i) =pos_a (i) +1.
(5.2) jumping to execute step S3.
S6', finishing extraction: extraction is complete.
The invention considers the safety problem of secret information in the information hiding scene through the wireless coding channel, and leads each secret information embedding to cause error code through a special embedding and extracting mode, thereby reducing the variation of error code number run of a carrier sequence, effectively resisting the characteristic analysis of the code group error code number run, and designing a hidden transmission system based on the wireless coding channel for the wireless communication field has challenges and practical value.
It should be noted that the foregoing merely illustrates the technical idea of the present invention and is not intended to limit the scope of the present invention, and that a person skilled in the art may make several improvements and modifications without departing from the principles of the present invention, which fall within the scope of the claims of the present invention.
Claims (6)
1. The error number resisting run feature analysis information hiding method based on channel coding is characterized by comprising an embedding process and an extracting process,
in the embedding process, determining the number of groups and the number of secret information to be embedded in each group according to the coding type, generating a key vector through keys confirmed in advance by two communication parties, generating an embedding position matrix of each group according to the key vector, performing embedding operation on a carrier sequence according to the embedding position matrix of each group, if and only if the embedding can cause error codes, and if not, searching for the next embeddable point until the embedding is finished;
the extraction process is the same as the embedding process.
2. The method for hiding anti-error number run feature analysis information based on channel coding as claimed in claim 1, wherein: the embedding process is implemented by a transmitting end, and specifically comprises the following steps:
s1, calculating initial parameters: determining the group number according to the length of the carrier sequence after channel coding and the coding type adopted by the channel coding, and calculating the secret information number round to be embedded in each group;
s2, generating an embedded position matrix of each group: generating a group array with a length according to keys negotiated in advance by two communication parties, generating a group matrix A with a size of n by taking each number in the array as a key, and maintaining an array pos_A with a size of 1 x group, wherein the ith number j represents the ith row and the jth column of A which are scanned currently by the ith packet;
s3, secret information embedding: if count=m, step S6 is executed in a skip mode; otherwise, when the ith packet is embedded (i starts from 1), judging whether the (n-1) +A (i, pos_A (i))) bit of c is equal to the count bit of m, if so, embedding the secret information of the count bit into the (n-1) +A (i, pos_A (i))) bit of c, and then jumping to execute step S4; if not, indicating that the embedding is failed, and jumping to execute the step S5;
wherein, (n-1) +a (i, pos_a (i))) represents a position to be embedded in the carrier sequence, count represents that secret information is embedded into the count th at that time, c represents the carrier sequence after channel coding, and m represents the secret information sequence after error correction coding;
s4, updating parameters after successful embedding: updating the value of the ith element of pos_A, turning to the next packet for embedding, updating count at the same time, and then jumping to execute the step S3; the expression is as follows:
pos_A(i)＝pos_A(i)+1
i＝(i+1)mod group
count＝count+1
s5, updating parameters after embedding failure: updating the value of the ith element of pos_a, and then jumping to execute step S3; the expression is as follows:
pos_A(i)＝pos_A(i)+1
s6, finishing embedding: the embedding is completed.
3. The method for hiding anti-error number run feature analysis information based on channel coding as claimed in claim 2, wherein: in the step S1, the expression of the packet number group in the initial parameter is as follows:
group＝C/n
wherein, C is the length of the carrier sequence after channel coding, and the channel coding adopts (n, k, t) BCH codes;
the number of secret information to be embedded in the initial parameters round expression is as follows:
where M represents the length of the error correction coded secret information sequence.
4. The method for hiding anti-error number run feature analysis information based on channel coding as claimed in claim 2, wherein: the extraction process is implemented by a receiving end, and specifically comprises the following steps:
s1', initial parameter calculation: determining the group number according to the length of the carrier sequence after channel coding and the coding type adopted by the channel coding, and calculating the secret information number round required to be extracted by each group;
s2', generating an extraction position matrix of each group: generating a group array with a length according to keys negotiated in advance by two communication parties, generating a group matrix A with a size of n by taking each number in the array as a key, and maintaining an array pos_A with a size of 1 x group, wherein the ith number j represents the ith row and the jth column of A which are scanned currently by the ith packet;
s3', secret information extraction: if count=m, step S6' is performed; otherwise, when the ith packet is extracted (i starts from 1), judging whether the (n (i-1) +a (i, pos_a (i))) bits of c and c 'are equal, if so, jumping to step S4'; if not, indicating that the position does not store the secret information, and executing step S5';
wherein, (n-1) +a (i, pos_a (i))) represents a position in the carrier sequence where secret information may be hidden, c represents the carrier sequence after channel coding, c' represents the code stream sequence received by the receiving end, and m represents the secret information sequence after error correction coding;
s4', updating parameters after successful extraction: updating the value of the ith element of pos_A, turning to the next group for extraction, updating count at the same time, and then jumping to execute step S3'; the expression is as follows:
pos_A(i)＝pos_A(i)+1
i＝(i+1)mod group
count＝count+1
s5', updating parameters after extraction failure: updating the value of the ith element of pos_a, and then jumping to execute step S3'; the expression is as follows:
pos_A(i)＝pos_A(i)+1
s6', finishing extraction: extraction is complete.
5. The method for hiding anti-error number run feature analysis information based on channel coding as claimed in claim 4, wherein: in the step S1', the expression of the packet number group in the initial parameter is as follows:
group＝C/n
wherein, C is the length of the carrier sequence after channel coding, and the channel coding adopts (n, k, t) BCH codes;
the expression of the secret information number round in the initial parameters is as follows:
where M is the length of the error correction coded secret information sequence.
6. The channel coding-based anti-error number run feature analysis information hiding system comprises a computer program and is characterized in that: the computer program, when executed by a processor, implements the steps of the method as described in any of the above.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311600837.5A CN117579227A (en) | 2023-11-28 | 2023-11-28 | Error code number resisting run feature analysis information hiding method and system based on channel coding |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311600837.5A CN117579227A (en) | 2023-11-28 | 2023-11-28 | Error code number resisting run feature analysis information hiding method and system based on channel coding |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN117579227A true CN117579227A (en) | 2024-02-20 |
Family
ID=89863959
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202311600837.5A Pending CN117579227A (en) | 2023-11-28 | 2023-11-28 | Error code number resisting run feature analysis information hiding method and system based on channel coding |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN117579227A (en) |
-
2023
- 2023-11-28 CN CN202311600837.5A patent/CN117579227A/en active Pending
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106161012B (en) | A kind of quantum key distribution after-treatment system and method based on polarization code error correction | |
| CN116775589B (en) | Data security protection method for network information | |
| CN107517095A (en) | A kind of polarization code coding/decoding method of unequal piece-wise verification | |
| CN110635807A (en) | Data coding method and decoding method | |
| CN109495211B (en) | Channel coding and decoding method | |
| CN112016061A (en) | Excel document data protection method based on robust watermarking technology | |
| CN107332570A (en) | The polarization code encoding method of segmentation cascade Hash sequences | |
| JP5913748B2 (en) | Secure and lossless data compression | |
| CN114257342A (en) | Coding and decoding method for two-user multiple access system based on non-binary polarization code | |
| CN117579227A (en) | Error code number resisting run feature analysis information hiding method and system based on channel coding | |
| CN110266321B (en) | Novel communication method and system based on polarization code | |
| CN112165338A (en) | Estimation method for interleaving relation of convolutional code random interleaving sequence | |
| CN110798224A (en) | Compression coding, error detection and decoding method | |
| CN105279728B (en) | Pretreated intelligent mobile terminal image latent writing method is encrypted based on secret information | |
| CN116015538A (en) | Non-orthogonal multiple access communication method based on Polar codes | |
| CN111030704B (en) | Polarization code-based synchronization-free communication method, device and system | |
| CN108900300A (en) | A kind of efficient error verification and private key amplification method in continuous variable quantum key distribution | |
| US6101281A (en) | Method for improving data encoding and decoding efficiency | |
| CN109997310A (en) | The record and playback apparatus of false sync are avoided by the way that payload is verified and scrambled with modified payload | |
| CN111865552B (en) | Method for detecting coding attack resistance of distributed conversion encoder | |
| Nouh et al. | Efficient serial concatenation of symbol by symbol and word by word decoders | |
| CN113078914A (en) | Blind identification method for parameters of single incomplete Turbo code component encoder | |
| Assanovich et al. | Use of linear error-correcting subcodes in flow watermarking for channels with substitution and deletion errors | |
| CN117880762B (en) | Short message data security encryption method based on wireless communication | |
| CN115795419B (en) | Lossless database robust digital watermarking method and system |
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 |