CN112055217B

CN112055217B - Method for carrying information in any byte data without loss

Info

Publication number: CN112055217B
Application number: CN202010732663.8A
Authority: CN
Inventors: 周诠; 刘娟妮; 刘梦瑶; 张怡; 李琪; 呼延烺; 魏佳圆
Original assignee: Xian Institute of Space Radio Technology
Current assignee: Xian Institute of Space Radio Technology
Priority date: 2020-07-27
Filing date: 2020-07-27
Publication date: 2022-05-24
Anticipated expiration: 2040-07-27
Also published as: CN112055217A

Abstract

The invention provides a method for carrying information in any byte data without loss, which can carry (hide) transmission of information in byte data with any format without changing data volume; the carrier data can be recovered without loss while carrying the hiding and extracting information without loss. The redundant bit in any type of data file is searched according to the byte format, and lossless information hiding in any byte data is realized by using a small amount of mark information, and the information hiding capacity is only related to the structure of the data. The typical loading (hiding) capacity is between 3.75% and 37.5%, and the method is suitable for loading (hiding) transmission occasions of various types of data such as various original data transmission systems and compressed data.

Description

Method for lossless carrying of information in any byte data

Technical Field

The invention relates to a data communication method, in particular to a method for embedding information into any byte data for lossless transmission, belonging to the field of communication (such as data communication technology).

Background

The current society is an information society, the information security problem becomes an increasingly urgent problem, and information hiding (data hiding) is an important branch of information security, and secret information is embedded into a carrier by using human visual redundancy, so that the aim of safely transmitting the secret information or improving the data transmission efficiency is fulfilled.

With the development of science and technology, efficient transmission of image data and security of transmission become more and more important. The information hiding (also called data hiding) technology can embed the secret information into the data under the condition of not changing the size of the image data, thereby realizing the cooperative transmission of the secret information and the image data. On the other hand, for remote sensing images, medical images, legal images, and the like, it is required that the carrier image can be restored as much as possible after extracting the secret information. At present, data compression methods are widely used, and besides JPEG compression methods, JPEG2000 compression methods are also used. The JPEG2000 compression method is the latest international compression standard, after the original image is compressed by JPEG2000 data, a compressed code stream is formed, the compressed code stream is transmitted, the receiving end decompresses the code stream to recover the original image, a certain distortion exists between the recovered image and the original image, and the distortion can meet the requirement as long as the distortion is within an allowable range. However, sometimes, some data are particularly important and do not allow distortion, and some data, such as compressed data, do not allow distortion, and hiding information can not destroy data, that is, information hiding is required to be completely lossless, and both the carrier and the information are lossless. Sometimes, the obtained data is only byte data (byte stream or bit stream), the data type is not known, and the information hiding can not be performed by utilizing the type characteristics of images, voice and texts.

Disclosure of Invention

The technical problem solved by the invention is as follows: the method overcomes the defects of the prior art, carries out information carrying by utilizing the characteristics of the data, avoids the thinking trend of carrying out information hiding according to types in the traditional method, has the characteristics of lossless information, unique scheme, less realization resources and independence from the data types, can carry out self-adaptive information hiding according to the characteristics of the byte data, and has the information hiding capacity only related to the structure of the data. The typical carrying (hiding) capacity is between 3.75% and 37.5%, and the method is suitable for various original data transmission systems, compressed data and other multi-type data transmission occasions.

The technical scheme of the invention is as follows: the method for carrying information in any byte data without loss comprises the following steps:

1) for any byte of data, every 8 bits constitute a byte.

2) Setting a byte data as G, 8 bits, the high bit, namely the 8 th bit as the leftmost bit, and the low bit, namely the 1 st bit as the rightmost bit; selecting data having the following characteristics or data having the following characteristics after processing:

ABC X XABC

ABC X ABCX

ABC A BCXX

3) judging whether the data G belongs to the above data set

If G belongs to one of the above datasets, then the label P ═ 1

If G does not belong to one of the above datasets, then the label P is 0

4) Taking P as a key, and if the information S is 3-bit UVW when P is 1, changing the hidden data into ABC X UVW; when P is 0, the information is not hidden, namely S is 0 bit, the data is not changed after being hidden, and the data containing density ABC X DEF is formed and transmitted;

5) receiving ABC X DEF containing secret data

If P is 1, the extracted secret information S is DEF; if P is 0, secret information is not extracted;

6) restoring original data G

If P ═ 1, G reverts to ABC X ABC; if P is 0, G reverts to ABC X DEF.

The processing steps of the tag data P are as follows:

the mark data P of each data form a bit data stream PP, the length of the PP is set as K1, the PP is subjected to lossless compression to form QQ, the length of the QQ is K2, K2< < K1, the data QQ is transmitted and stored as a key or is used as additional information and is hidden in a selected data set, and the hiding method adopts the hiding method or other lossless information hiding methods.

Compared with the prior art, the invention has the beneficial effects that:

(1) at present, most of methods for hiding information in data hide information based on large types such as images, voice, texts, compressed data and the like, but do not hide information based on the structural characteristics of byte data of the data;

(2) Because any data is composed of binary system or bytes, the invention hides information based on the byte structure characteristics of the data, and can recover carrier data according to the data byte characteristics after information extraction, thereby realizing lossless information recovery and carrier recovery.

(3) The method carries out self-adaptive information hiding according to the internal characteristics of data, and the typical hiding capacity can be between 3.75% and 37.5%.

(4) The invention realizes lossless information hiding or lossless information carrying transmission based on a small amount of secret keys or additional information, and avoids the defect that the traditional information hiding method cannot adapt to a plurality of data types at the same time.

(5) If a small amount of secret keys or additional information is hidden in data, the method provided by the invention can also achieve the effect of improving the information hiding performance by combining with a classical hiding method.

(6) The technical scheme of the invention is unique, the realization complexity is greatly lower than that of the conventional information hiding method, and the practicability is greatly improved.

Drawings

FIG. 1 is a flow chart of the method of the present invention.

Detailed Description

In order to verify the performance of the algorithm provided by the invention, an 8-bit gray image H with the size of 512 multiplied by 512 is adopted in a simulation experiment, and the method is used for carrying, transmitting and recovering information.

The secret information is any data: images or other data.

Examples are:

for image format data (length is byte), each pixel is 8 bits to make up one byte, or one byte is formed every LSB of 8 bytes.

Selecting data having the following characteristics or data having the following characteristics after processing:

(1) data set 1:

000XX000

001XX001

010XX010

011XX011

100XX100

101XX101

110XX110

111XX111

the original data are:

000XX000 after 1 bit shift left for 00XX0000 cycle

01XX0010 is 001XX001 after left shift by 1

010XX010 by left shifting by 1 in 10XX0100 cycle

After 11XX0110 circularly shifts 1 bit to 011XX011

00XX1001 left shift by 1 bit and 100XX100

01XX1011 cycles left shifted by 1 bit to 101XX101

10XX1101 cycle left shift by 1 bit is 110XX110

11XX1111 cycles left shift by 1 bit to 111XX111

The characteristics of the data set 1 are satisfied after the loop is shifted left by 1 bit.

Or the data after inversion satisfies the characteristics of the data set 1, such as:

the original data are:

000XX111 last 3 bits negation 000XX000

001XX110 back 3 bit negation 001XX001

010XX101 back 3 bit negation 010XX010

011XX011 by inverting 3 bits after 011XX100

100XX011 last 3 bit negation 100XX100

101XX010 back 3 bit negation 101XX101

110XX001 later 3 bit negation 110XX110

111XX000 back 3 bit negation 111XX111

The last 3 bits are inverted to satisfy the characteristic of data set 1.

If G belongs to one of the above 32 numbers, the label P ═ 1

If G does not belong to one of the above 32 numbers, the label P is 0

(2) Data set 2

XX000000

XX001001

XX010010

XX011011

XX100100

XX101101

XX110110

XX111111

if G belongs to one of the above 32 numbers, the label P ═ 1

If G does not belong to one of the above 32 numbers, the label P is 0

The data processing method is similar to the left-right cyclic shift method and the negation method for the data set 1.

(3) Data 3

Selecting data having the following characteristics or data having the following characteristics after shifting:

X000X000

X001X001

X010X010

X011X011

X100X100

X101X101

X110X110

X111X111

if G belongs to one of the above 32 numbers, the label P ═ 1

If G does not belong to one of the above 32 numbers, the label P is 0

The data processing method is similar to the left-right cyclic shift method and the inversion method for the data set 1.

Hidden capacity analysis:

an image 512 x 8 bits, denoted as K bits

The number of the information S is T: 0-100%, generally 10% -100%

The hidden information capacity (relative capacity) is:

3.75％--37.5％

for example, when T is 1/8, 12.5%, 1 is 12.5%, and 0 is 87.5% in all the labeled data P, which belong to a sparse matrix, binary image.

Information hiding capacity: 1/8 × 3/8 ═ 3/64

Marking information:

the marking data P constitutes a bit stream PP, which is lossless compressed, and the compression ratio is generally R > 4

The example is given with R ═ 4.

K2＝512*512/R＝512*512/4

K2/K＝1/32＝2/64

Information hiding capacity: 1/8 × 3/8 ═ 3/64

After deducting the tagged information, the actual information hiding amount is typically 3/64-2/64 ═ 1/64

For a total of 512 × 8/64 ═ 512 × 64 bits.

Through information hiding transmission, information can be completely recovered, data can be completely recovered, and lossless carrying is achieved.

When T is 1/10, the information hiding capacity becomes

Information hiding capacity: 1/10 × 3/8 ═ 3/80 ═ 3.75%

When T is 1/8, the information hiding capacity becomes

Information hiding capacity: 1/8 × 3/8 ═ 3/64 ═ 4.69%

When T is 1/2, the information hiding capacity is increased by 1 time, and becomes

Information hiding capacity: 1/2 × 3/8 ═ 3/16 ═ 18.75%

When T is 100%, the information hiding capacity is increased by 1 time, and becomes

Information hiding capacity: 1 × 3/8 ═ 3/8 ═ 6/16 ═ 37.5%.

The invention utilizes the information hiding technology to embed information in any byte data, and a receiving end can correctly extract carried information from carrier data containing secret data stream without damaging and recovering the original carrier image. Certain amount of information can be transmitted in the byte code stream without changing the format and the rate of the byte code stream.

The method of the invention improves the utilization rate of the data transmission system, can carry out a certain amount of information carrying transmission in data with any byte format (such as original image, compressed image, voice, compressed voice, text, compressed text data, video data and compressed video data), and the typical hidden capacity can reach 3.75-37.5%.

With the development of communication and navigation technologies, data transmission technologies have been widely applied to spacecrafts such as remote sensing satellites, space detectors, communication satellites and navigation satellites and various satellite data transmission systems, and will be widely applied in the future. Space-based information network and ground internet also put higher and higher requirements on lossless information hiding of carrier data, and the application is more and more extensive.

The method can perform lossless hiding of information in any byte data, has the characteristics of strong adaptability of a hiding method, lossless recovery of information, lossless recovery of a carrier and large and small carrying capacity of information, and has the characteristics of low complexity, less resource occupation and the like, thereby having practical value in spacecraft engineering.

The invention is not described in detail and is within the knowledge of a person skilled in the art.

Claims

1. The method for carrying information in any byte data without loss is characterized by comprising the following steps:

1) acquiring data in a satellite data transmission system, and forming a byte for every 8 bits of any byte data; the arbitrary byte data includes one of an original image, a compressed image, voice, compressed voice, text, compressed text data, video data, and compressed video data;

2) Setting a byte of data as G, 8 bits; wherein the high position, i.e. the 8 th position, is the leftmost position, and the low position, i.e. the 1 st position, is the rightmost position; selecting data with characteristics to form a data set; in the step 2), data with the following characteristics or data with the following characteristics after processing are selected to form a data set:

ABC X XABC，

ABC X ABCX，

ABC A BCXX；

3) judging whether the data G belongs to the data set in the step 2), and if G belongs to one of the data sets, marking P = 1; if G does not belong to one of the above datasets, then the label P = 0; recording data G as ABC X DEF;

4) taking P as a secret key, and carrying out secret hiding on data; the specific process is as follows: when P =1, if the information S is 3-bit UVW, the post-concealment data is ABC X UVW, ABC X UVW X, ABC UVW X; when P =0, the information is not hidden, namely S is 0 bit, the data is unchanged after being hidden, and ABC X DEF containing secret data is formed and transmitted;

5) after receiving the secret data, if P =1, the extracted secret information S is UVW; if P =0, secret information is not extracted;

6) recovering original data G, and if P =1, recovering G into ABC X ABC, ABC X ABC X and ABC X X; if P =0, G reverts to ABC X DEF.

2. The method for lossless piggybacking of information in arbitrary byte data according to claim 1, wherein: the processing steps of the tag data P are as follows:

The marking data P of each data is formed into a bit data stream PP, the length of the PP is set as K1, the data QQ is formed after lossless compression of the PP, the length of the data QQ is set as K2, and the data QQ is transmitted and stored as a key or is used as additional information and is hidden in a selected data set.

3. The method for lossless piggybacking of information in arbitrary byte data according to claim 2, wherein: the K2< < K1.

4. The method for lossless piggybacking of information in arbitrary byte data according to claim 2, wherein: the lossless compression ratio is R4 or more.