CN113744112B - Symmetrical information hiding method based on carrier randomness - Google Patents
Symmetrical information hiding method based on carrier randomness Download PDFInfo
- Publication number
- CN113744112B CN113744112B CN202111045289.5A CN202111045289A CN113744112B CN 113744112 B CN113744112 B CN 113744112B CN 202111045289 A CN202111045289 A CN 202111045289A CN 113744112 B CN113744112 B CN 113744112B
- Authority
- CN
- China
- Prior art keywords
- key
- gray
- carrier
- value
- map
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 21
- 239000011159 matrix material Substances 0.000 claims description 15
- 238000002360 preparation method Methods 0.000 claims description 8
- 229910002056 binary alloy Inorganic materials 0.000 description 3
- 238000006243 chemical reaction Methods 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 3
- 238000000605 extraction Methods 0.000 description 3
- 239000000284 extract Substances 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000011084 recovery Methods 0.000 description 1
- 230000002441 reversible effect Effects 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T1/00—General purpose image data processing
- G06T1/0021—Image watermarking
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/60—Protecting data
- G06F21/602—Providing cryptographic facilities or services
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T2201/00—General purpose image data processing
- G06T2201/005—Image watermarking
- G06T2201/0203—Image watermarking whereby the image with embedded watermark is reverted to the original condition before embedding, e.g. lossless, distortion-free or invertible watermarking
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Health & Medical Sciences (AREA)
- Bioethics (AREA)
- General Health & Medical Sciences (AREA)
- Computer Hardware Design (AREA)
- Computer Security & Cryptography (AREA)
- Software Systems (AREA)
- General Engineering & Computer Science (AREA)
- Image Processing (AREA)
Abstract
The application discloses a symmetric information hiding method based on carrier randomness, which relates to the technical field of information hiding, and generates a secret key according to the statistical characteristics of the lowest bit surface of a gray image by utilizing the natural randomness of the lowest bit surface of a carrier, so that the secret key randomness is ensured and meanwhile certain robustness is achieved; the application randomizes and disguises secret information based on the randomness of the carrier, acquires key information from the carrier, and improves the security of steganography.
Description
Technical Field
The application relates to the technical field of information hiding, in particular to a symmetrical information hiding method based on carrier randomness.
Background
The application of information hiding technology is more and more widespread nowadays, and the main purpose of most steganography algorithms is to improve the embedding capacity and reduce the distortion, so that the security of the method is not high. In 2001 Toby Sharp first proposed the idea of using keys in information hiding technology, improving steganography security. In the subsequent time, the method for using the password for information hiding basically takes over the thought of Sharp, and an encryption key is additionally arranged outside the carrier, but the method does not fully combine the password technology and the information hiding algorithm.
Aiming at the problems existing in the prior art, the application provides a symmetric information hiding method based on carrier randomness, which performs randomisation camouflage on secret information based on carrier randomness, acquires key information from a carrier, and improves the security of steganography.
Disclosure of Invention
The application aims to provide a symmetric information hiding method based on carrier randomness, which is used for randomizing and disguising secret information based on carrier randomness, acquiring key information from a carrier and improving the security of steganography.
The application provides a symmetrical information hiding method based on carrier randomness, which comprises the following steps:
extracting a gray level map Co of a key carrier, converting the lowest bit plane of the gray level map Co into a binary sequence, dividing the binary sequence into m groups, wherein each group comprises an odd number of binary bits, taking 0 as a key value if the number of 0 in the group is greater than the number of 1, taking 1 as the key value if the number of 0 in the group is less than the number of 1, and combining a plurality of key values according to the sequence of m groups;
encrypting a plaintext message Me by adopting a key K to obtain a ciphertext Ci;
obtaining a histogram of a gray level map Co, and translating a point between a peak point and a zero point in the histogram upwards or downwards to obtain a blank gray level value added with one or subtracted from the original gray level value;
and analyzing the value corresponding to each bit in the ciphertext Ci, if the corresponding value is 0, keeping the gray value corresponding to the ciphertext Ci unchanged, and if the corresponding value is 1, changing the corresponding gray value into a null gray value, and comprehensively analyzing the gray value to obtain the hidden camouflage object St in the gray map state.
Further, the method further comprises the following steps:
and sending the disguised object St to a receiver, extracting the ciphertext Ci from the gray value and the null gray value by the receiver, translating and recovering the histogram to obtain a gray map Co of the key carrier, extracting a key K from the gray map Co, and decrypting by using the key K to obtain a plaintext message Me.
Further, the step of converting the lowest bit plane of the gray scale map Co into a binary sequence is as follows:
converting the gray level map of the key carrier into a matrix of n x n;
and extracting the preparation key according to the n-by-n matrix, and converting the preparation key into a binary sequence according to rows.
Further, the method for extracting the preparation key comprises the following steps:
using the n matrix of gray map with formulaThe preliminary key is output.
Further, the step of obtaining the lowest bit plane of the gray scale map Co includes:
obtaining a digital matrix of the gray map Co by using an imread function in matlab;
and performing modular two operation on each numerical value in the numerical matrix to obtain the lowest bit plane.
The application has the following beneficial effects and advantages:
the symmetric information hiding method based on the carrier randomness utilizes the natural randomness of the lowest bit surface of the carrier to generate the secret key according to the statistical characteristics of the lowest bit surface of the gray image, ensures the secret key randomness and has certain robustness, and the secret key is introduced to enhance the security of secret information; the application randomizes and disguises secret information based on the randomness of the carrier, acquires key information from the carrier, and improves the security of steganography.
Drawings
FIG. 1 is a flow chart of randomized camouflage steganography provided by an embodiment of the present application;
FIG. 2 is a flow chart of randomized camouflage extraction according to an embodiment of the present application;
fig. 3 is a comparison chart of a reversible information hiding carrier image and a camouflage object histogram according to an embodiment of the present application.
Detailed Description
The following description of the embodiments of the present application, taken in conjunction with the accompanying drawings, will clearly and completely describe the embodiments of the present application, and it is evident that the described embodiments are some, but not all, embodiments of the present application. All other embodiments, which can be made by those skilled in the art based on the embodiments of the present application without making any inventive effort, shall fall within the scope of the present application.
Referring to fig. 1-3, the application provides a symmetric information hiding method based on carrier randomness, which comprises the following steps:
extracting a gray level map Co of a key carrier, converting the lowest bit plane of the gray level map Co into a binary sequence, dividing the binary sequence into m groups, wherein each group comprises odd binary bits, taking 0 as a key value if the number of 0 in the group is greater than 1, taking 1 as a key value if the number of 0 in the group is less than 1, combining a plurality of key values according to the sequence of m groups to obtain a key K, and converting the key K into a conversion formula of the binary sequence, wherein the conversion formula of the conversion formula is that
Encrypting a plaintext message Me by adopting a key K to obtain a ciphertext Ci;
obtaining a histogram of a gray level map Co, and translating a point between a peak point and a zero point in the histogram upwards or downwards to obtain a blank gray level value added with one or subtracted from the original gray level value;
and analyzing the value corresponding to each bit in the ciphertext Ci, if the corresponding value is 0, keeping the gray value corresponding to the ciphertext Ci unchanged, and if the corresponding value is 1, changing the corresponding gray value into a null gray value, and comprehensively analyzing the gray value to obtain the hidden camouflage object St in the gray map state.
Wherein, the lowest bit plane of the gray scale map Co refers to that each pixel of the 256-level gray scale map is represented by an eight-bit binary system, and the last bit of the eight-bit binary system is the lowest bit plane, so that the extraction of the lowest bit plane is equivalent to the extraction of the last bit of the eight-bit binary system of each pixel point of the picture. The step of obtaining the lowest bit plane of the gray map Co comprises the following steps:
obtaining a digital matrix of the gray map Co by using an imread function in matlab;
and performing modular two operation on each numerical value in the numerical matrix to obtain the lowest bit plane.
The key carrier is a carrier picture for information hiding, which is called as a key carrier, for the following reasons:
a. the key carrier is a carrier to be used for information hiding.
b. The key that encrypts the plaintext information is also derived from the carrier and is therefore called the key carrier.
Example 1
Referring to fig. 2, a disguised object St is transmitted to a receiver, the receiver extracts a ciphertext Ci from a gray value h and a null gray value (h+1 or h-1), and translates a recovery histogram to obtain a gray map Co of a key carrier, extracts a key K from the gray map Co, and decrypts the plaintext message Me using the key K.
Example 2
The step of extracting the key K by the binary sequence is as follows:
converting the gray level map of the key carrier into a matrix of n x n;
extracting a preparation key according to the n-by-n matrix, and converting the preparation key into a binary sequence according to rows;
dividing the binary sequence into m groups, each group containing an odd number of binary bits;
by passing throughA key is generated, the key being k=k1, K2, … Km.
The method for extracting the preparation key comprises the following steps:
using the n matrix of gray map with formulaThe preliminary key is output.
Wherein the odd group refers to writing the lowest bit plane into binary sequences and then grouping every odd binary sequence into one group, so that the odd group is called an odd group. Each odd group generates a 1bit key. The key K is a set of Ki, which refers to the key of the ith bit, and K refers to a set of overall keys of K1, K2,.
The foregoing disclosure is merely illustrative of some embodiments of the application, but the embodiments are not limited thereto and variations within the scope of the application will be apparent to those skilled in the art.
Claims (5)
1. The symmetrical information hiding method based on carrier randomness is characterized by comprising the following steps:
extracting a gray level map Co of a key carrier, converting the lowest bit plane of the gray level map Co into a binary sequence, dividing the binary sequence into m groups, wherein each group comprises an odd number of binary bits, taking 0 as a key value if the number of 0 in the group is greater than the number of 1, taking 1 as the key value if the number of 0 in the group is less than the number of 1, and combining a plurality of key values according to the sequence of m groups;
encrypting a plaintext message Me by adopting a key K to obtain a ciphertext Ci;
obtaining a histogram of a gray level map Co, and translating a point between a peak point and a zero point in the histogram upwards or downwards to obtain a blank gray level value added with one or subtracted from the original gray level value;
and analyzing the value corresponding to each bit in the ciphertext Ci, if the corresponding value is 0, keeping the gray value corresponding to the ciphertext Ci unchanged, and if the corresponding value is 1, changing the corresponding gray value into a null gray value, and comprehensively analyzing the gray value to obtain the hidden camouflage object St in the gray map state.
2. The method for hiding symmetric information based on carrier randomness of claim 1, further comprising:
and sending the disguised object St to a receiver, extracting the ciphertext Ci from the gray value and the null gray value by the receiver, translating and recovering the histogram to obtain a gray map Co of the key carrier, extracting a key K from the gray map Co, and decrypting by using the key K to obtain a plaintext message Me.
3. The method for hiding symmetric information based on carrier randomness as claimed in claim 1, wherein the step of converting the lowest bit plane of said gray map Co into a binary sequence is as follows:
converting the gray level map of the key carrier into a matrix of n x n;
and extracting the preparation key according to the n-by-n matrix, and converting the preparation key into a binary sequence according to rows.
4. A symmetric information hiding method based on carrier randomness as claimed in claim 3, wherein said method for extracting the preliminary key is:
using the n matrix of gray map with formulaThe preliminary key is output.
5. The method for hiding symmetric information based on carrier randomness as claimed in claim 1, wherein the step of obtaining the lowest bit plane of said gray map Co is:
obtaining a digital matrix of the gray map Co by using an imread function in matlab;
and performing modular two operation on each numerical value in the numerical matrix to obtain the lowest bit plane.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111045289.5A CN113744112B (en) | 2021-09-07 | 2021-09-07 | Symmetrical information hiding method based on carrier randomness |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111045289.5A CN113744112B (en) | 2021-09-07 | 2021-09-07 | Symmetrical information hiding method based on carrier randomness |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113744112A CN113744112A (en) | 2021-12-03 |
| CN113744112B true CN113744112B (en) | 2023-12-12 |
Family
ID=78736717
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111045289.5A Active CN113744112B (en) | 2021-09-07 | 2021-09-07 | Symmetrical information hiding method based on carrier randomness |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113744112B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115567329B (en) * | 2022-12-06 | 2023-02-28 | 互丰科技(北京)有限公司 | Data security encryption method for network information |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101452569A (en) * | 2008-12-05 | 2009-06-10 | 江南大学 | Processing method of image latent writing based on auxiliary pixel |
| WO2016205700A1 (en) * | 2015-06-19 | 2016-12-22 | Amazon Technologies, Inc. | Steganographic depth images |
| CN109617682A (en) * | 2018-12-12 | 2019-04-12 | 北京邮电大学 | A kind of ciphertext domain reversible information hidden method based on histogram left and right sidesing shifting |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7415155B2 (en) * | 2003-05-06 | 2008-08-19 | New Jersey Institute Of Technology | Methods and apparatus for reversible data hiding through histogram modification |
-
2021
- 2021-09-07 CN CN202111045289.5A patent/CN113744112B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101452569A (en) * | 2008-12-05 | 2009-06-10 | 江南大学 | Processing method of image latent writing based on auxiliary pixel |
| WO2016205700A1 (en) * | 2015-06-19 | 2016-12-22 | Amazon Technologies, Inc. | Steganographic depth images |
| CN109617682A (en) * | 2018-12-12 | 2019-04-12 | 北京邮电大学 | A kind of ciphertext domain reversible information hidden method based on histogram left and right sidesing shifting |
Non-Patent Citations (2)
| Title |
|---|
| 基于图像分割和随机LSB的信息隐藏算法;高华玲;;现代计算机(专业版)(15);全文 * |
| 基于海绵函数的快速伪随机序列生成方法;赵磊;郑东;任方;;计算机应用研究(01);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113744112A (en) | 2021-12-03 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108566500B (en) | Reversible hiding method of self-adaptive image encryption domain based on hybrid encryption mechanism | |
| CN109660696B (en) | New image encryption method | |
| Hussein et al. | Secure message embedding in audio | |
| Sethi et al. | A proposed novel architecture for information hiding in image steganography by using genetic algorithm and cryptography | |
| Jose et al. | A separable reversible data hiding in encrypted image with improved performance | |
| CN110677236B (en) | OFDM encryption method based on composite chaotic system and XOR operation | |
| CN103473733A (en) | Image encryption algorithm based on DNA encoding and chaotic mapping | |
| WO2014075469A1 (en) | Method and device for information hiding | |
| Abdulzahra et al. | Combining cryptography and steganography for data hiding in images | |
| CN109547663B (en) | Improved LSB image steganography method combined with cryptography | |
| CN111970507A (en) | Reversible data hiding method of ciphertext domain image based on pixel difference coding | |
| CN113744112B (en) | Symmetrical information hiding method based on carrier randomness | |
| Yahaya et al. | Cryptosystem for secure data transmission using Advance Encryption Standard (AES) and Steganography | |
| Debnath et al. | An advanced image encryption standard providing dual security: Encryption using hill cipher & RGB image steganography | |
| CN114401351B (en) | Image encryption and decryption method based on two-dimensional fractional order chaotic mapping | |
| CN108305298B (en) | Image recoverable information hiding method based on Sudoku matrix index | |
| Banupriya et al. | Video steganography using LSB algorithm for security application | |
| CN116016795A (en) | Image encryption method based on variable step length extraction random number and improved ZigZag conversion | |
| CN111400731B (en) | Quantum image encryption method based on DNACNot | |
| CN115883744A (en) | Watermark method, device and storage medium based on fractional order chaotic mapping | |
| Moon et al. | Innovative data security model using forensic audio video steganography for improving hidden data security and robustness | |
| CN107590369B (en) | Homomorphic encrypted domain reversible information hiding method based on code division multiplexing and value expansion | |
| Tiwari et al. | A Robust Method for Image Steganography based on chaos theory | |
| Akhtar et al. | An improved module based substitution steganography method | |
| CN113852456A (en) | Image encryption system based on Matlab chaotic mapping and feature extraction |
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 |