CN109120377A - Information concealing method, storage medium in a kind of new data transmission - Google Patents
Information concealing method, storage medium in a kind of new data transmission Download PDFInfo
- Publication number
- CN109120377A CN109120377A CN201810798704.6A CN201810798704A CN109120377A CN 109120377 A CN109120377 A CN 109120377A CN 201810798704 A CN201810798704 A CN 201810798704A CN 109120377 A CN109120377 A CN 109120377A
- Authority
- CN
- China
- Prior art keywords
- codeword sequence
- information
- error rate
- bit error
- embedded
- 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
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/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
- 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
-
- 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/0869—Generation of secret information including derivation or calculation of cryptographic keys or passwords involving random numbers or seeds
Abstract
The present invention provides the information concealing method in the new data transmission of one kind, comprising the following steps: obtains the bit error rate distribution for the codeword sequence that he number is N, which is distributed the bit error rate of each code element in mark codeword sequence；It selects the position of the maximum preceding S symbol of bit error rate and is marked, while marking the position of other N-S symbol；Hiding information data will be needed to be randomly-embedded in the position range of N-S symbol；It is transmitted channel is sent into after the codeword sequence for being embedded with hiding information data modulation；The hiding information data of insertion are extracted after decoding to received codeword sequence in receiving end.The insertion of secret information of the invention avoids the sensitive position in codeword sequence, but is randomly-embedded in other positions.And the range of embedded location, it is the method by being distributed based on bit error rate to determine.This method only needs to emulate code in the case where determining signal-to-noise ratio, obtains bit error rate distribution.
Description
Technical field
The present invention relates to the information concealing methods in information security field, more particularly to a kind of new data transmission.
Background technique
The safety transmitting of secret information is the weight that the core missions of information war and secret communication is transmitted as information security
Mode is wanted, the unnoticed general information of secret information disguise as to be passed is reached hided transmission or hidden by Information hiding
The purpose for covering storage is of great significance to national security and information security
Common Information Hiding Techniques have Exchange rings, transformation field technique, spread spectrum, anti-aliasing techniques, carrier generation technique and
Statistical technique.They respectively have feature, but also respectively have shortcoming.For example, the robustness of Exchange rings is not strong, it is difficult to resist
Filtering interference, lossy compression attack, and depend on formatted file；It converts field technique and spread spectrum complexity is higher,
Expense is big.The heavy complexity of carrier generation technique treatment process generates carrier and takes a long time；What statistical technique can be transmitted
Secret information capacity is not high, and robustness is not strong.
And based on the Information Hiding Techniques of channel coding suitable for all data communications with channel coding.This
In scheme, hiding information is randomly embedded into data frame in the form of noise.Therefore, hiding information is not easy to be found.Secrecy
For the good of property in this scheme, the position for how selecting hiding information to be embedded in codeword sequence directly influences embedding information
The size of capacity and the influence to carrier information.
In document [1], (Wang Wei is auspicious, Liu Yujun, Li Wenxiong, realizes Information Hiding Technology in Channel Coding using LDPC code
[J].Information engineering college journal, 2006.3, Vol .7 No .1 49-53) in, information of the author investigation based on LDPC code
Hide scheme.The digital watermarking of LDPC coding is applied in digital copyright protection, watermark robustness under attack is improved,
And its feasibility is demonstrated with the mode of experiment.But in the telescopiny of secret information, the bit error rate of LDPC code is not considered
Distribution.
Document [2] (Chen Liquan, Lu Miao, Hu Aiqun, Sun Xiaoyan, the coded channel information hidden algorithm based on two-stage positioning,
Communicate journal, in December, 2013, the 12nd phase of volume 34,120-130), propose a kind of coding letter based on two-stage positioning
Road Information hiding innovatory algorithm introduces two-stage positioning and cyclic shift mechanism in embedded location selection course, improves secret letter
The error bit ability of breath.
(face is super: the Investigation of Information Hiding Technology based on channel coding, master thesis, Dalian University of Science & Engineering in document [3]
University, 2015.3), author proposes a kind of channel coding hidden algorithm of uniform position selection.With carrier when secret information is embedded in
The ratio of length and Secret Message Length is basic insertion step-length, and the pseudo-random sequence generated by key constantly corrects insertion step
Long, emulation experiment shows hidden algorithm not only it is possible to prevente effectively from the shortcomings that existing algorithm, but also hiding invisibility is good.
Embedded quantity and influence of the reduction to carrier transmission reliability as much as possible, embedding information to guarantee as big as possible are answered
This avoids the sensitive position in codeword sequence, that is, is not easy to eliminate the position of interference；And embedding information is embedded into be easy to eliminate and is done
The position disturbed.In codeword sequence, each position to the resistivity of interference is determined by the code redistribution characteristic of this yard.
Under normal circumstances, a yard redistribution can just only be obtained by carrying out theory analysis to code.Only when the structure of code is simpler
When list, code length are shorter, be possible to find out a yard redistribution.If the length of code is long, it is desirable that it is quite tired for going out code redistribution
Difficult.Therefore, in most of documents, the position of hiding information insertion, such as above-mentioned document [1], [2] and document are not considered usually
[3]。
Summary of the invention
The present invention provides the information concealing method in the new data transmission of one kind, of the existing technology to solve the problems, such as.
The invention adopts the following technical scheme:
A kind of information concealing method in new data transmission, comprising the following steps:
S1: obtaining the bit error rate distribution for the codeword sequence that he number is N, and bit error rate distribution identifies every in codeword sequence
The bit error rate of a symbol；
S2: the position of the selection maximum preceding S symbol of bit error rate is simultaneously marked, while marking the position of other N-S symbol
It sets；
S3: hiding information data will be needed to be randomly-embedded in the position range of N-S symbol；
S4: it is transmitted channel is sent into after the codeword sequence for being embedded with hiding information data modulation；
S5: the hiding information data of insertion are extracted after decoding to received codeword sequence in receiving end.
In the step S1:
If the code word size of channel coding is N, then Cj=(c is used1,c2,…,cN) indicate j-th of codeword sequence, and set Cj (k)=
ck, k=1,2 ..., N；Cj (k) is k-th of symbol in j-th of codeword sequence；
Channel coding is emulated under the conditions of given Signal to Noise Ratio (SNR), the bit error rate distribution of this yard is found out, is expressed as P
=(p1,p2,…,pN), and set P (j)=pj, j=1,2 ..., N；P (j) indicates the bit error rate of j-th of symbol in codeword sequence.
The position for the preceding highest symbol of S bit error rate selected in setting procedure S2 is denoted as B=(b1, b2,…,bS), and
If B (i)=bi, i=1,2 ..., S；
It is set in setting procedure S3 and needs hiding information data length as H=m*t, m is the embedding data in each codeword sequence
Number, and m≤N-S, t are required frame number, i.e. codeword sequence number；Embedding data sequence is expressed as H=(h11,h12,… h1m,
h21, h22, … h2m,… ht1,ht2,…htm), and set H (ji)=hji；1≤i≤m,1≤j≤t；
The data that above-mentioned needs are hidden are generated with embeded matrix W=(w of t row m column11,w12,…,w1m; w21, w22,…,
w2m; …;wt1,wt2,…,wtm)；If W (jk)=(wjk), 1≤wjk≤N,1≤k≤m,1≤j≤t；And to arbitrary k, j, i,
Meet wjk≠bi；The element value of each row is the position of corresponding hiding information insertion codeword sequence in above-mentioned t row.
Information data to be transmitted is encoded, j-th of codeword sequence of generation is Cj=(c1,c2,…,cN);
According to embeded matrix W, information data to be concealed is embedded into the corresponding position of codeword sequence, after generating embedding information
Codeword sequence is expressed asCj=(c 1,c 2,…,c N)；
The codeword sequence of hiding information will be had been inserted intoCjChannel is sent into after being modulated to be transmitted.
It is described that information data to be concealed is embedded into the corresponding position of codeword sequence according to embeded matrix W, generate insertion
Codeword sequence after information is expressed asCj=(c 1,c 2,…,c N) operation beCj(wjk)= Cj(wjk)+H(jk)mod2。
J-th of codeword sequence signal after be located at that receiving end receives be interfered is Rj=(r1,r2,…,rN)；
Hard decision is carried out to above-mentioned j-th of codeword sequence signal, the signal sequence after being adjudicated is Qj=(q1,q2,…,qN),
Q in formulaiIf=1 ri>=0, qiIf=0 ri<0；
To the codeword sequence Rj=(r received1,r2,…,rN) decoded, it obtains sending code wordCj=(c 1,c 2,…,c N) valuation
Sequence Uj=(u1,u2,…,uN)；
Embedding data V (jk)=v is extracted according to embeded matrix Wjk: V (jk)=Qj (wjk)+ Uj(wjk) mod 2。
Storage medium, the storage medium are stored with computer program, real when the computer program is executed by processor
The step of existing above method.
Beneficial effects of the present invention: the insertion of secret information of the invention avoids the sensitive position in codeword sequence, and
It is to be randomly-embedded in other positions.And the range of embedded location, it is the method by being distributed based on bit error rate to determine.This
Kind of method avoids the problem for seeking yard redistribution, requires no knowledge about the structure of code, it is only necessary to code in the case where determining signal-to-noise ratio into
Row emulation obtains bit error rate distribution.Therefore, this method is simple, intuitive, and the high reliablity of hiding information passes carrier
The influence of defeated reliability is small.
Detailed description of the invention
Fig. 1 is bit error rate distribution schematic diagram.
Fig. 2 is under different embedded quantities and different embedded locations, and several embedded modes are to carrier information bit error rate
Influence comparison.
Fig. 3 is the information hiding system structure flow graph being distributed based on bit error rate.
Specific embodiment
Invention is further described in detail with reference to the accompanying drawings and detailed description.
The present invention provides the method for the Information hiding in a kind of transmission of data, and this method is based on channel coding theorem, i.e., by
Channel coding theorem is it is found that under normal circumstances, in a codeword sequence, each element position is not to the resistivity of interference
It is identical, it is determined by the code redistribution characteristic of this yard.That is the code redistribution anti-interference ability that determines each symbol, is also referred to as missed
Bit rate.Only when the relatively simple for structure of code, code length are shorter, by carrying out theory analysis to code, code weight can be just obtained
Distribution.If the length of code is long, it is desirable that it is extremely difficult for going out code redistribution.But if the mistake ratio of code can directly be found out
Special rate distribution, i.e., the bit error rate situation of each symbol, so that it may bit error rate height, which position of which position directly found out
Bit error rate it is low, so that it is determined that the embedded location of hiding information.
It is the bit error rate distribution an of Turbo code such as Fig. 1.It can be seen that, the bit error rate of each symbol differs greatly,
Distributed pole is uneven.Bit error rate on some positions is fairly small, close to 10-6, and the bit error rate of some positions is bigger, leans on
Nearly 10-4.If the position high to those bit error rates is marked, so that embedding information is avoided the occurrence of in these positions, and
It is randomly-embedded in other positions, it is possible to which, so that embedding information is more reliable, the influence to carrier information is smaller.
Based on above-mentioned theory, the step of The present invention gives the methods that Information hiding is carried out according to bit error rate:
S1: after emulating by simulation software, the bit error rate distribution for the codeword sequence that he number is N, the errored bit are counted
The bit error rate of each code element in rate distribution mark codeword sequence；
S2: the position of the selection maximum preceding S symbol of bit error rate is simultaneously marked, while marking the position of other N-S symbol
It sets；
S3: hiding information data will be needed to be randomly-embedded in the position range of N-S element position.The hiding information of insertion
After being embedded into the position range of N-S symbol after data codified, re-encoding is transmitted, and recipient needs after receiving information
Hiding information is decoded；It can also be directly embedded into the position range of N-S symbol.
S4: it is transmitted channel is sent into after the codeword sequence for being embedded with hiding information data modulation；
S5: the hiding information data of insertion are extracted after decoding to received codeword sequence in receiving end.
Above-mentioned steps the specific implementation process is as follows:
(1), preparation process:
1, the code word size of channel coding is set as N.With Cj=(c1,c2,…,cN) indicate j-th of codeword sequence, and set Cj (k)=
ck, k=1,2 ..., N, Cj (k) is k-th of symbol in j-th of codeword sequence.
2, Monte Carlo simulation is carried out under the conditions of given Signal to Noise Ratio (SNR) to channel coding, finds out the errored bit of this yard
Rate distribution, is expressed as P=(p1,p2,…,pN), and set P (j)=pj, j=1,2 ..., N, P (j) indicate codeword sequence in j-th
The bit error rate of symbol；
When carrying out the selection of Signal to Noise Ratio (SNR), average error bit rate is made to be more than or equal to 10-4And it is less than or equal to 10-3?.For
It is distributed to accurate bit error rate, emulation bit should be more as far as possible, generally no less than N × 105 。
3, the position that the maximum preceding S symbol of bit error rate is selected in bit error rate distribution, is denoted as B=(b1, b2,…,
bS), and set B (i)=bi, i=1,2 ..., S；
4, it sets and needs hiding information data length as H=m*t, embedding data number of the m for every frame, and m≤N-S, t in formula
For required frame number.Embedding data sequence is expressed as H=(h11,h12,… h1m,h21, h22, … h2m,… ht1,ht2,…htm),
And set H (ji)=hji。1≤i≤m,1≤j≤t。
5, embeded matrix W=(w of t row m column is generated11,w12,…,w1m; w21, w22,…,w2m; …;wt1,
wt2,…,wtm).And set W (jk)=(wjk) 1≤wjk≤N,1≤k≤m,1≤j≤t.And to arbitrary k, j, i, it is desired to wjk≠bI,
It the position being embedded in cannot be in B.The element of every row generates at random, and each unequal.The element of each row gives each frame and hides
The position that information is embedded in codeword sequence.Here " frame ", as codeword sequence, or a code word.
(2), insertion and transmission process
1, information data to be transmitted is encoded, j-th of codeword sequence of generation is Cj=(c1,c2,…,cN);
2, according to embeded matrix W, information data to be concealed is embedded into codeword sequence.If the codeword sequence after embedding information
It is expressed asCj=(c 1,c 2,…,c N).It specifically operates and isCj(wjk)= Cj(wjk)+H(jk)mod2.Operation is substantially jth
W in a codeword sequencejkK-th of element progress mould 2 of jth row adds in a symbol and hiding data sequence matrix, generates embedding
Sequence after enteringCj。
3, the codeword sequence of hiding information will be embedded inCjIt is modulated.If using binary modulated mode, mapping mode is
1 → 1,0 → -1.Channel is then fed into be transmitted.
(3), hiding information extraction process
1, j-th of codeword sequence signal after be located at that receiving end receives be interfered is Rj=(r1,r2,…,rN).First to upper
It states signal and carries out hard decision, the signal sequence after being adjudicated is Qj=(q1,q2,…,qN), q in formulaiIf=1 ri>=0, qi=0
If ri<0。
2, to the codeword sequence Rj=(r received1,r2,…,rN) decoded, it obtains sending code wordCj=(c 1,c 2,…,c N)
Valuation sequence Uj=(u1,u2,…,uN)。
3, embedding data V (jk)=v is extracted according to embeded matrixjk.Concrete operations are V (jk)=Qj (wjk)+ Uj(wjk)
mod 2.Operation is substantially the w of the signal sequence after j-th of judgementjkPosition sends code word valuation sequence Uj's with j-th
WjkPosition carries out mould 2 and adds, and generates the jth row kth position for extracting embedding data matrix V (jk).
The relationship of S and embedded quantity
The number of the position of S maximum bit error rate before S value gives, to guarantee influence of the embedding information to carrier information most
Small, embedding information cannot be embedded on this S position.S value is bigger, and embedding information is smaller on the influence of the bit error rate of prime information,
But embedded quantity is also smaller；S value is smaller, and embedding information is bigger on the influence of the bit error rate of carrier information, but embedded quantity also becomes larger, because
This, S value must compromise selection according to the actual situation.Under normal circumstances, it is taken as the 10%-20% of N value.
A kind of specific embodiment process that the present invention will be described in detail is given below:
(1), preparation process
1, it is equipped with a channel coding, j-th of code word is expressed as Cj=(c1,c2,…,cN), code length N=9.And error correcting capability is 2.
2, bit error rate is obtained after emulating is distributed as P=(p1,p2,…,p9)=(0.002,0.02,0.005,0.0065,
0.008,0.0075,0.05,0.002,0.0015).
3, S=2 are taken.B=(b1, b2)=(7,2), i.e. B (1)=7, B (2)=2.
4, it sets and needs hiding information data length as H=8, H=m*t=2*4, i.e., every frame (code word) is embedded in 2 data, institute
Need frame number t=4.Embedding data sequence is expressed as H=(h11,h12; h21,h22; h31,h32; h41,h42) =(1,0;0,1;1,0;
1,1)。
5, the embeded matrix W=(1,4 that a m=2 arranges the row of t=4 is generated;3,8;3,6;5,9).The element of every row generates at random,
And it is each unequal.The element of each row gives the position that each frame hiding information is embedded in codeword sequence.
(2), insertion and transmission process
1, information data to be transmitted is encoded, j-th of codeword sequence of generation is Cj=(c1,c2,…,cN).It is simple
For the sake of, it is C1=(1,1,0,1,1,1,0,0,1), C2=(0,1,0,1,0,1,1,1,1), C3 respectively if common property gives birth to 4 code words
=(1,0,1,0,1,0,1,0,0), C4=(0,0,0,0,0,0,0,0,0).
2, according to embeded matrix W, information data to be concealed is embedded into codeword sequence.If the code word after embedding information
Sequence is expressed asCj=(c 1,c 2,…,c 9).It specifically operates and isCj(wjk)= Cj(wjk)+H(jk)mod2。j=1,2,3,4;k=
1,2.Operation is substantially the w in j-th of codeword sequencejkK-th of jth row in a symbol and hiding data sequence matrix
Element carries out mould 2 and adds, the sequence after generating insertionCj。
Such asC1,C1(w11)= C1(w11)+H(11)mod2=C1(1)+H(11)=1+1=0;
C1(w12)= C1(w12)+H(12)mod2=C1(4)+H(12)=1+0=1;
It finally obtainsC1=(0,1,0,1,1,1,0,0,1).
Other 3 codeword sequences after insertion are respectively as follows:
C2=(0,1,0,1,0,1,1,0,1)；
C3=(1,0,0,0,1,0,1,0,0)；
C4=(0,0,0,0,1,0,0,0,1).
3, the codeword sequence of hiding information will be embedded inCjIt is modulated.If using binary modulated mode, mapping mode is
1 → 1,0 → -1.Channel is then fed into be transmitted.
(3), hiding information extraction process
1, for the sake of simplicity, do not consider to interfere here, but have no effect on the explanation to step.It is located at j-th that receiving end receives
Codeword sequence signal is Rj=(r1,r2,…,rN).Hard decision is carried out to above-mentioned signal first, it is clear that in the feelings for not considering interference
Signal sequence Qj=(q under condition, after being adjudicated1,q2,…,q9)=Cj, q in formulaiIf=1 ri>=0, qiIf=0 ri<0。
2, to the codeword sequence Rj=(r received1,r2,…,rN) decoded, it obtains sending code wordCj=(c 1,c 2,…,c N)
Valuation sequence Uj=(u1,u2,…,uN).Due to not accounting for interfering, and the hiding information digit 2 being embedded in is without departing from this
The error correcting capability 2 of code, so Uj=Cj.
3, embedding data V (jk)=v is extracted according to embeded matrixjk.Operation formula is V (jk)=Qj (wjk)+ Uj(wjk)
mod 2.Operation in detail are as follows:
V(11)= Q1(w11)+ U1(w11) = Q1(1)+ U1(1)=0+1=1;
V(12)= Q1(w12)+ U1(w12) = Q1(4)+ U1(4)=1+1=0;
V(21)= Q2(w21)+ U2(w21) = Q2(3)+ U2(3)=0+0=0;
V(22)= Q2(w22)+ U2(w22) = Q2(8)+ U2(8)=0+1=1;
V(31)= Q3(w31)+ U3(w31) = Q3(3)+ U3(3)=0+1=1;
V(32)= Q3(w32)+ U3(w32) = Q3(6)+ U3(6)=0+0=0;
V(41)= Q4(w41)+ U4(w41) = Q4(5)+ U4(5)=1+0=1;
V(42)= Q4(w42)+ U4(w42) = Q4(9)+ U4(9)=1+0=1。
The embedding information for finally obtaining extraction is (1,0；0,1；1,0；1,1).Due to not accounting for interfering, and embedding information
Quantity without departing from the error correcting capability of this yard, the embedding information of extraction is consistent with original embedding information.
Simulation result
Example Turbo code, code length 64*3, information sequence length be 64. generator polynomial G=(1011/ 1101), using point
Group interleaver.First, the bit error rate distribution such as Fig. 1 in the case where signal-to-noise ratio is 3.5dB are obtained through emulating.
Fig. 2 gives the influence of different embedded quantity 3 and 8 pair carrier bit error rates.Three kinds of embedded modes are considered, first is that
If S=20, embedding information is randomly-embedded in remaining 172 positions, second is that S value is not set, it is random embedding in total order column position
Enter.Third is that not setting S value, it is uniformly embedded into complete sequence.It can be seen from the figure that being embedded in when embedded quantity is 3 in designated position
When, the influence very little to carrier, and bit error rate curve when being not embedded into are fairly close.This is because avoiding those when insertion
Sensitive position.But when being randomly-embedded in complete sequence, bit error rate has slight deterioration.When embedded quantity is 8, the mistake of carrier
Bit rate curve has obvious deterioration.But it is embedded in compared to complete sequence, is either randomly-embedded or is uniformly embedded into, designated position
Influence of the insertion to carrier still have and be obviously improved.
The present invention also provides a kind of storage medium, which is computer-readable storage medium, computer program
It can be stored in a computer readable storage medium, the computer program is when being executed by processor, it can be achieved that above-mentioned each side
The step of method embodiment.Wherein, the computer program includes computer program code, and computer program code can be source generation
Code form, object identification code form, executable file or certain intermediate forms etc..Computer-readable medium may include: that can take
Any entity or device, recording medium, USB flash disk, mobile hard disk, magnetic disk, CD, computer with the computer program code are deposited
Reservoir, read-only memory (ROM, Read-Only Memory), random access memory (RAM, Random Access
Memory), electric carrier signal, telecommunication signal and software distribution medium etc..
What has been described above is only a preferred embodiment of the present invention, it is noted that for those skilled in the art,
Without depart from that overall concept of the invention, several changes and improvements can also be made, these also should be considered as of the invention
Protection scope.
Claims (7)
1. the information concealing method in a kind of new data transmission, which comprises the following steps:
S1: obtaining the bit error rate distribution for the codeword sequence that he number is N, and bit error rate distribution identifies every in codeword sequence
The bit error rate of a symbol；
S2: the position of the selection maximum preceding S symbol of bit error rate is simultaneously marked, while marking the position of other N-S symbol
It sets；
S3: hiding information data will be needed to be randomly-embedded in the position range of N-S symbol；
S4: it is transmitted channel is sent into after the codeword sequence for being embedded with hiding information data modulation；
S5: the hiding information data of insertion are extracted after decoding to received codeword sequence in receiving end.
2. the information concealing method in the new data transmission of one kind according to claim 1, it is characterised in that:
In the step S1:
If the code word size of channel coding is N, then Cj=(c is used1,c2,…,cN) indicate j-th of codeword sequence, and set Cj (k)=ck,
K=1,2 ..., N；Cj (k) is k-th of symbol in j-th of codeword sequence；
Channel coding is emulated under the conditions of given Signal to Noise Ratio (SNR), the bit error rate distribution of this yard is found out, is expressed as P
=(p1,p2,…,pN), and set P (j)=pj, j=1,2 ..., N；P (j) indicates the bit error rate of j-th of symbol in codeword sequence.
3. the information concealing method in the new data transmission of one kind according to claim 2, it is characterised in that:
The position for the preceding highest symbol of S bit error rate selected in setting procedure S2 is denoted as B=(b1, b2,…,bS), and set B
(i)=bi, i=1,2 ..., S；
It is set in setting procedure S3 and needs hiding information data length as H=m*t, m is the embedding data in each codeword sequence
Number, and m≤N-S, t are required frame number, i.e. codeword sequence number；Embedding data sequence is expressed as H=(h11,h12,… h1m,
h21, h22, … h2m,… ht1,ht2,…htm), and set H (ji)=hji；1≤i≤m,1≤j≤t；
The data that above-mentioned needs are hidden are generated with embeded matrix W=(w of t row m column11,w12,…,w1m; w21, w22,…,
w2m; …;wt1,wt2,…,wtm)；If W (jk)=(wjk), 1≤wjk≤N,1≤k≤m,1≤j≤t；And to arbitrary k, j, i,
Meet wjk≠bi；The element value of each row is the position of corresponding hiding information insertion codeword sequence in above-mentioned t row.
4. the information concealing method in the new data transmission of one kind according to claim 3, it is characterised in that:
Information data to be transmitted is encoded, j-th of codeword sequence of generation is Cj=(c1,c2,…,cN);
According to embeded matrix W, information data to be concealed is embedded into the corresponding position of codeword sequence, after generating embedding information
Codeword sequence is expressed asCj=(c 1,c 2,…,c N)；
The codeword sequence of hiding information will be had been inserted intoCjChannel is sent into after being modulated to be transmitted.
5. the information concealing method in the new data transmission of one kind according to claim 4, it is characterised in that:
It is described that information data to be concealed is embedded into the corresponding position of codeword sequence according to embeded matrix W, generate embedding information
Codeword sequence afterwards is expressed asCj=(c 1,c 2,…,c N) operation beCj(wjk)= Cj(wjk)+H(jk)mod2。
6. the information concealing method in the new data transmission of one kind according to claim 4, it is characterised in that:
J-th of codeword sequence signal after be located at that receiving end receives be interfered is Rj=(r1,r2,…,rN)；
Hard decision is carried out to above-mentioned j-th of codeword sequence signal, the signal sequence after being adjudicated is Qj=(q1,q2,…,qN),
Q in formulaiIf=1 ri>=0, qiIf=0 ri<0；
To the codeword sequence Rj=(r received1,r2,…,rN) decoded, it obtains sending code wordCj=(c 1,c 2,…,c N) valuation
Sequence Uj=(u1,u2,…,uN)；
Embedding data V (jk)=v is extracted according to embeded matrix Wjk: V (jk)=Qj (wjk)+ Uj(wjk) mod 2。
7. storage medium, the storage medium is stored with computer program, which is characterized in that the computer program is by processor
The step of the method as claimed in any one of claims 1 to 6 is realized when execution.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810798704.6A CN109120377B (en) | 2018-07-19 | 2018-07-19 | Novel information hiding method in data transmission and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810798704.6A CN109120377B (en) | 2018-07-19 | 2018-07-19 | Novel information hiding method in data transmission and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109120377A true CN109120377A (en) | 2019-01-01 |
| CN109120377B CN109120377B (en) | 2020-11-27 |
Family
ID=64862297
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810798704.6A Expired - Fee Related CN109120377B (en) | 2018-07-19 | 2018-07-19 | Novel information hiding method in data transmission and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109120377B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110516775A (en) * | 2019-07-11 | 2019-11-29 | 西安邮电大学 | Based on QR code user secret information hidden method |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6859545B1 (en) * | 2000-08-10 | 2005-02-22 | Chung Shan Institute Of Science And Technology | Information hiding method with reduced fuzziness |
| US7159118B2 (en) * | 2001-04-06 | 2007-01-02 | Verance Corporation | Methods and apparatus for embedding and recovering watermarking information based on host-matching codes |
| EP1814307A1 (en) * | 2005-06-25 | 2007-08-01 | Huawei Technologies Co., Ltd. | Method for detecting the quality of the multimedia communication |
| EP1953752A1 (en) * | 2005-09-16 | 2008-08-06 | Beijing Sursen International Information Technology | A method for embeding and detecting hiding codes |
| US20130151855A1 (en) * | 2011-12-13 | 2013-06-13 | Verance Corporation | Watermark embedding workflow improvements |
| CN103476026A (en) * | 2013-09-06 | 2013-12-25 | 中国科学院软件研究所 | Self-adaption covert communication method based on satellite channel coding |
| CN104378122A (en) * | 2014-11-20 | 2015-02-25 | 华北水利水电大学 | Compilation method for variable-length Turbo codes |
| CN106535177A (en) * | 2016-11-22 | 2017-03-22 | 浙江工业大学 | Autoregressive artificial noise-based covert communication method |
-
2018
- 2018-07-19 CN CN201810798704.6A patent/CN109120377B/en not_active Expired - Fee Related
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6859545B1 (en) * | 2000-08-10 | 2005-02-22 | Chung Shan Institute Of Science And Technology | Information hiding method with reduced fuzziness |
| US7159118B2 (en) * | 2001-04-06 | 2007-01-02 | Verance Corporation | Methods and apparatus for embedding and recovering watermarking information based on host-matching codes |
| EP1814307A1 (en) * | 2005-06-25 | 2007-08-01 | Huawei Technologies Co., Ltd. | Method for detecting the quality of the multimedia communication |
| EP1953752A1 (en) * | 2005-09-16 | 2008-08-06 | Beijing Sursen International Information Technology | A method for embeding and detecting hiding codes |
| US20130151855A1 (en) * | 2011-12-13 | 2013-06-13 | Verance Corporation | Watermark embedding workflow improvements |
| CN103476026A (en) * | 2013-09-06 | 2013-12-25 | 中国科学院软件研究所 | Self-adaption covert communication method based on satellite channel coding |
| CN104378122A (en) * | 2014-11-20 | 2015-02-25 | 华北水利水电大学 | Compilation method for variable-length Turbo codes |
| CN106535177A (en) * | 2016-11-22 | 2017-03-22 | 浙江工业大学 | Autoregressive artificial noise-based covert communication method |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110516775A (en) * | 2019-07-11 | 2019-11-29 | 西安邮电大学 | Based on QR code user secret information hidden method |
| CN110516775B (en) * | 2019-07-11 | 2023-07-25 | 西安邮电大学 | User secret information hiding method based on QR code |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109120377B (en) | 2020-11-27 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Tai et al. | Image self-recovery with watermark self-embedding | |
| CN111311474B (en) | High-capacity image encryption domain information hiding method | |
| CN103761702B (en) | Image hiding and authentication method based on secret sharing | |
| Amirtharajan et al. | Colour guided colour image steganography | |
| CN110913092B (en) | Reversible information hiding method for encrypted image | |
| CN104881838B (en) | One kind is based on GF (23) (K, N) significant point deposited without expansion image and reconstructing method | |
| CN107846530A (en) | Digital watermarking algorithm | |
| Mathkour et al. | A new image steganography technique | |
| CN113923312B (en) | Robust reversible watermarking method of digital image coding layer based on wireless communication | |
| Santosa et al. | Audio-to-image wavelet transform based audio steganography | |
| CN109120377A (en) | Information concealing method, storage medium in a kind of new data transmission | |
| CN114745475A (en) | Robust reversible information hiding method for encrypted image | |
| Al-Husainy | A new image steganography based on decimal-digits representation | |
| CN110264390A (en) | A kind of digital watermark method based on double watermarks insertion | |
| CN116506232B (en) | High-capacity Internet of things hidden channel construction method based on channel coding | |
| Xie et al. | Reversibility‐oriented secret image sharing mechanism with steganography and authentication based on code division multiplexing | |
| CN105279728B (en) | Pretreated intelligent mobile terminal image latent writing method is encrypted based on secret information | |
| CN109033853A (en) | Physical layer information hidden method, device and terminal based on convolutional code | |
| CN104144277B (en) | Multi-path image lossless hidden transmission method | |
| CN104104690A (en) | Image information hiding method and system based on MIMO (Multi-input Multi-output) channel communication | |
| Kingsley et al. | Improving Data Hiding Capacity in Code Based Steganography using Multiple Embedding. | |
| CN108989816B (en) | Coding channel information hiding method based on wavelet transformation | |
| Nosrati et al. | A survey on usage of genetic algorithms in recent steganography researches | |
| CN110278560A (en) | A kind of convert communication system based on IEEE 802.11a | |
| CN112926087A (en) | Secret sharing method with verification function and high embedding capacity based on two-dimensional code |
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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20201127 Termination date: 20210719 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |