CN106157231A - A kind of based on image information encryption and the decryption method of improving Arnold conversion and LSB - Google Patents
A kind of based on image information encryption and the decryption method of improving Arnold conversion and LSB Download PDFInfo
- Publication number
- CN106157231A CN106157231A CN201610482879.7A CN201610482879A CN106157231A CN 106157231 A CN106157231 A CN 106157231A CN 201610482879 A CN201610482879 A CN 201610482879A CN 106157231 A CN106157231 A CN 106157231A
- Authority
- CN
- China
- Prior art keywords
- image
- frame
- pixel
- encryption
- hiding
- 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
-
- 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
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T2201/00—General purpose image data processing
- G06T2201/005—Image watermarking
Landscapes
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Facsimile Transmission Control (AREA)
- Storage Device Security (AREA)
Abstract
The invention discloses a kind of based on image information encryption and the decryption method of improving Arnold conversion and LSB, first this method uses the Arnold conversion of improvement that image carries out pretreatment, then it is embedded in background image with LSB algorithm and constructs the new images containing encrypted image.Ciphering process is broadly divided into four big steps: calculates quantity of information, input key that background image can accommodate, and uses the Arnold conversion of improvement hiding frame to carry out pretreatment, the size of the hiding frame of storage, uses LSB algorithm to be embedded in background image by hiding frame.Decrypting process is broadly divided into three big steps: extracts hiding frame size, LSB algorithm extracts and hide frame, input key and the hiding frame after extracting is carried out Arnold inverse transformation deciphering.The present invention has been greatly reinforced the confidentiality of information.
Description
Technical field
The present invention relates to Information Hiding Techniques field, a kind of based on the image letter improving Arnold conversion and LSB
Encryption for information and decryption method.
Background technology
Information Hiding Techniques (Steganography technique) is to add for image inside information security research field
Close hiding a kind of technology.Also it is the solution party of the typical concealed access issues of one of them in computer application field simultaneously
Case, in military field, the information encryption transmission field such as information disguising has a wide range of applications.
For this problem of Information Hiding Techniques, present stage air space algorithm the most sometimes and two kinds of solution party of transform-domain algorithm
Case.But both are due to shortcoming inherently, can not well be directly used in the actual application that image information is hidden.Time
The information that spatial domain major defect is hiding is easily detected, although and transform domain encryption technology is relatively preferable, but information
The capacity hidden is little, and is limited by the pixel distribution of image.
Although the research of image information concealing technology is extensively, but the most not yet there is a kind of perfect solution, and
And the hiding scheme that uses for different application scenarios is the most different.2007, Shao Li equality people " two dimension non equilateral image put
Disorderly conversion " literary composition discusses the Arnold conversion several algorithms for non equilateral image enciphering transformation of improvement；2012, the summer
Illuminate et al. then discusses present stage image concealing analytical technology in " Information Hiding Analysis based on image summary " literary composition
Development, introduce for embedded in the method for the detection of the image of secret information.The Information hiding purpose master of image at present
If preventing from being detected, being cracked out；But how to carry out anti-detection, anti-cracking is to go back problem demanding prompt solution at present.
Summary of the invention
The technical problem to be solved is to overcome the deficiencies in the prior art, and provides a kind of based on improving Arnold
The image information encryption of conversion and LSB and decryption method, utilize the Arnold conversion the improved hiding hum pattern to needing steganography
As converting, LSB algorithm is then utilized hiding frame to be embedded in background image image after generation encryption, after encryption
Image and background image cannot be differentiated from naked eyes；After only needing encryption during deciphering, image just sub-argument can go out hiding frame.
The present invention solves above-mentioned technical problem by the following technical solutions:
A kind of based on improvement Arnold conversion and LSB the image information encryption proposed according to the present invention and decryption method,
Comprise the following steps:
Step 1, loading background image, and calculate this background image open ended maximum pixel number；If hiding hum pattern
The pixel count of picture exceedes maximum pixel number, then user carries out cutting to hiding frame；
The Arnold conversion that step 2, employing improve carries out pretreatment to hiding frame；Specific as follows:
Step 2.1), user input numerical value key1, key2 of 2 keys, key1 and key2 is positive integer；
Step 2.2), user select any one in following cipher mode that hiding frame is encrypted:
The first cipher mode: the new coordinate of each hiding frame pixel is (x ', y '), wherein: x '=(x+
Key2*y), y '=y；
The second cipher mode: the new coordinate of each hiding frame pixel is (x ', y '), wherein, x '=x, y '
=(key2*x+y)；Wherein, (x y) is the original pixels coordinate of hiding frame needing encryption；
Then x ', y ' carry out complementation: x to the width A.width and height A.height of hiding frame respectively "
=x ' mod A.width；Y "=y ' mod A.height；
Step 2.3), by original coordinate be (x, pixel y) move new pixel (x ", y ") place；
Step 2.4), repeated execution of steps 2.2)-step 2.3) key1 time；
Step 3, the size of hiding frame is stored in the beginning of background image；
Step 4, will through the pretreated hiding frame of step 2 use LSB algorithm be embedded in background image, from
And generate the image after encryption；
Frame size is hidden in step 5, extraction；
Step 6, by LSB algorithm extract hide frame；
Step 7, user input key and the hiding frame after extracting are carried out Arnold inverse transformation deciphering, thus extensive
Answer the initial data of hiding frame.
Enter as a kind of image information encryption based on improvement Arnold conversion and LSB of the present invention and decryption method
One-step optimization scheme, described step 3 is specific as follows:
Step 3.1), traversal background image front 4 pixels, each pixel comprises 3 bytes；First by hiding hum pattern
Height A.height every 2bit mono-assembling and dismantling of picture divide, and the most directly replace in background image each byte in front 6 bytes
Most end 2bit；
Step 3.2), width A.width every 2bit mono-assembling and dismantling of hidden image A are divided, the most directly replace background
Most end 2bit of each byte in rear 6 bytes in image.
Enter as a kind of image information encryption based on improvement Arnold conversion and LSB of the present invention and decryption method
One-step optimization scheme, described step 4 is specific as follows:
Step 4.1), skip the size memory block of the hiding frame of front 4 pixels of background image, to hiding information
Image carries out LSB encryption；If primary iteration number of times i=1；
Step 4.2), take out the i-th byte hidden in frame successively, leave the highest 2bit of this byte in the back of the body
In the last 2bit of the 1st byte of (4+i) individual pixel of scape image, directly replace (4+i) individual pixel of background image
The last 2bit of the 1st byte；
Step 4.3), then take out the 6th of this byte, the data of the 5th be placed on (4+i) individual pixel of background image
The 2nd byte last 2bit in；
Step 4.4), when i less than hide frame all byte quantity, then i=i+1, repeat step 4.2)-step
4.4)；Until all bytes of hiding frame being all placed in background image, thus generate image after encryption.
Enter as a kind of image information encryption based on improvement Arnold conversion and LSB of the present invention and decryption method
One-step optimization scheme, described step 5 is specific as follows:
Step 5.1), load encryption after image to internal memory；
Step 5.2), extract front 4 pixel datas of image after encryption, wherein, according to encryption principle, front 2 pixels
For the altitude information of image, rear 2 pixels are the width data of image；In front 2 pixels, each pixel the most directly carries
Taking most end 2bit of the most each byte, be then stitched together and form the numerical value of 12bit, this numerical value hides frame exactly
Height number A.height；
Step 5.3), extract rear 2 pixel datas in front 4 pixels of image after encryption, in rear 2 pixels, often
Most end 2bit of the most each byte of individual pixel extracting directly in order, and direct splicing becomes the numerical value of 12bit in order, should
Numerical value is exactly the width numerical value A.width hiding frame.
Enter as a kind of image information encryption based on improvement Arnold conversion and LSB of the present invention and decryption method
One-step optimization scheme, described step 6 is specific as follows:
Step 6.1), skip front 4 pixels of image after encryption；
Step 6.2) from the beginning of the 5th pixel of the image after encryption, by most end 2bit of each byte of each pixel
Extract and splice in order, the hiding frame after ultimately generating with improvement Arnold conversion.
Enter as a kind of image information encryption based on improvement Arnold conversion and LSB of the present invention and decryption method
One-step optimization scheme, described step 7 is specific as follows:
Step 7.1) if the first cipher mode, then according to formula x1=(x "-key2*y "), y1=y " carries out figure
As Arnold inverse transformation is deciphered；If the second cipher mode, then according to formula x1=x ", y1=(-key2*x "+y ") enters
Row image Arnold inverse transformation is deciphered；
Step 7.2), then the width A.width of hiding frame and height A.height is taken by x1, y1 respectively
Remaining computing: x=x1 mod A.width, y=y1mod A.height；If x < 0, x=x+A.width, if y < 0, y=
y+A.height；
Step 7.3), repeated execution of steps 7.1) to step 7.2) key1 time, thus recovered hiding frame
Initial data.
The present invention uses above technical scheme compared with prior art, has following technical effect that
(1) Arnold conversion is used in the middle of image information concealing technology；
(2) LSB algorithm is used to combine Arnold conversion embedded images so that hiding information capacity is bigger, and due to
Present random arrangement after image conversion, comprise hiding information therefore, it is difficult to be detected；
(3) user is encrypted by the form of 3 keys, has been greatly reinforced the confidentiality of information；
(4) after encryption, image has certain anti-damage ability, loses certain Pixel Information and hides frame still
Can be resumed；
(5) using the Arnold conversion algorithm improved, can be encrypted non-isometric image, tradition Arnold can only
Rectangular image is encrypted scramble.
Accompanying drawing explanation
Fig. 1 is the encryption and decryption schematic diagram of the present invention.
Fig. 2 is the flow chart of the ciphering process of the present invention.
Fig. 3 is the flow chart of the decrypting process of the present invention.
Fig. 4 is the logic chart of the LSB storage data that this method uses.
Detailed description of the invention
In order to make the object, technical solutions and advantages of the present invention clearer, below in conjunction with the accompanying drawings and the specific embodiments
Describe the present invention.
Describing for convenience, the major variable in simple definition algorithm is: hides frame A, background image B, embeds
Image C after the encryption of rear generation, wherein represents the height of image with height, and width represents the width of image, A.width table
Showing the width of A image, A.height represents the height of A image.B, C image is also same.Wherein user needs the key of input to have two
Individual, key key1 and key key2, encrypted location is No. 1 or No. 2；
Fig. 1 is the encryption and decryption schematic diagram of the present invention, and first this method uses the Arnold conversion of improvement to carry out pre-to image
Process, then it is embedded in background image with LSB algorithm and constructs the new images containing encrypted image.Ciphering process is main
It is divided into four big steps: calculate quantity of information, input key that background image can accommodate, and use the Arnold conversion pair of improvement
Hiding frame carries out pretreatment, the size of frame is hidden in storage, use LSB algorithm to be embedded into by hiding frame
In background image.Decrypting process is broadly divided into three big steps: extracts and hides frame size, by the hiding letter of LSB algorithm extraction
Breath image, input key also carry out Arnold inverse transformation deciphering to the hiding frame after extracting.
Fig. 2 is the flow chart of the ciphering process of the present invention, and encrypting step is:
Step 1) load background image B, and estimate this background image B and can accommodate great hiding information:
Step 1.1) by formulaCalculate the maximum pixel number of open ended hiding frame；
Step 1.2) if the pixel count hiding frame A is not above the maximum pixel that previous step is calculated
Number, then perform next step, otherwise, need user that hiding frame A is carried out cutting.
Step 2) use the Arnold conversion improved that hiding frame A carries out pretreatment:
Step 2.1) user inputs the numerical value of 2 keys, key1 and key2, is positive integer；
Step 2.2) user's Choice encryption position is No. 1 or No. 2；Key1, key2 and encrypted location user can not lose,
Also need three values all correctly could recover during original image；Wherein key1 is as the number of transitions of Arnold conversion；
Step 2.3) hiding hum pattern A picture is taked the Arnold conversion after improving, if user's Choice encryption position is 1
Number position, new x coordinate and the new y-coordinate computing formula of the most each image pixel be: x '=(x+key2*y), y '=y, as
Really user's Choice encryption position is No. 2 positions, and new x coordinate and the new y-coordinate computing formula of the most each image pixel be: x '
=x, y '=(key2*x+y), then the width A.width and height A.height of hiding frame is carried out by x ', y ' respectively
Complementation: x "=x ' mod A.width；Y "=y ' mod A.height；
Step 2.4) obtain new coordinate (x ", " after), by original, (x, y) pixel of coordinate moves new pixel to y
Point (x ", y ") place；
Step 2.5) according to the numerical values recited repeated execution of steps 2.3 of key1) to step 2.4) key1 time；
Step 3) size of hiding frame A is stored in the beginning of background image B:
Step 3.1) traversal front 4 pixels of background image B, after being loaded into internal memory due to image, each pixel comprises 3 bytes,
The most corresponding channel B, G passage, R passage (blue channel, green passage, red passage).Because 4 pixels amount to 12 bytes before this.Owing to repairing
Most end 2bit changing each byte has no effect on the quality of image, and user's naked eyes cannot be differentiated, therefore, and the most end of each byte
2bit can be used to store data.First the width A.height of hiding frame A is stored in front 2 pixels (the most front 6 words
Joint), the most each byte can deposit 2bit data, the most altogether 12bit, the highest deposits 212-1=4095 pixels tall, storage side
Formula is height A.height every 2bit mono-assembling and dismantling of hiding frame A to be divided, and the most directly replaces 6 words before background image
Every byte most end 2bit of joint；
Step 3.2) the width A.width of hidden image A is stored in rear 2 pixels (6 bytes after i.e.), it neutralizes front 6 words
As joint, each byte 2bit data, 12bit the most altogether, the highest deposits 212The hiding frame of-1=4095 pixels tall.
Storage mode and step 3.1) in hide frame A height A.height storage mode the same；
Step 4) the hiding frame A after Arnold conversion is embedded in background image B:
Step 4.1) skip the hidden image A size memory block of front 4 pixels of background image B, start image is carried out
LSB encrypts.First take out 1 byte (8bit) (being designated as t) of hidden image A, leave the highest 2bit of this t byte in Background
In the last 2bit of the 1st byte of the 5th pixel of picture B, directly replace the end of the 5th the 1st byte of pixel of background image B
2bit。
Step 4.2) then take out the second highest 2bit of t, 6,5 bit data are placed on the 2nd of the 5th pixel of background image
In the last 2bit of byte, by that analogy, until all bytes of hiding frame A are all put in background image.So
It is generated as image C after encryption.
Step 5) image C after encryption is preserved.
Fig. 3 is the flow chart of the decrypting process of the present invention, and decryption step is:
Step 1) extract and hide frame size:
Step 1.1) load encryption after image C to internal memory.
Step 1.2) extract front 4 pixel datas of image C after encryption, wherein, according to encryption principle, front 2 pixels are figure
The altitude information of picture, rear 2 pixels are the width data of image.In front 2 pixels, each pixel extracting directly in order is wherein
Most end 2bit of each byte, is then stitched together and forms the numerical value of 12bit, and this numerical value is exactly the height hiding frame
Numerical value A.height；
Step 1.3) rear 2 pixel datas that extract after encryption in front 4 pixels of image C and according to step 1.2) method
The most end 2bit direct splicing in order extracting the most each byte becomes the numerical value of 12bit, and this numerical value hides frame exactly
Width numerical value Awidth；
Step 2) extract and hide frame:
Step 2.1) skip front 4 pixels of image after encryption；
Step 2.2) from the beginning of the 5th pixel, most end 2bit of each byte of each pixel (3 bytes) extracts
Splice；1st byte-extraction most end 2bit data of the first the 5th pixel are to the 1st of the 1st pixel hiding frame A the
The 7 of byte, 8；
Step 2.3) extract the most end 2bit data of the 5th pixel the 2nd byte the 1st pixel to hiding frame A
5,6 of 1st byte,
Step 2.4) by that analogy, extract (8bit correspondence 1 after the 1st byte of hiding the 1st pixel of frame A
Individual byte), extract the 2nd byte, extract also according to order, until the pixel of all of hiding frame extracts complete,
That hides frame is sized at step 1.2) and step 1.3) size that extracts；Ultimately generate with improving Arnold
Hiding frame A after conversion；
Step 3) the hiding frame A after extracting is carried out Arnold inverse transformation deciphering:
Step 3.1) user inputs 2 keys key1, key2 and an encrypted location；
Step 3.2) if No. 1 position, then according to formula x1=(x "-key2*y "), y1=y " carries out image Arnold
Inverse transformation is deciphered, if No. 2 positions are then according to formula x1=x ", y1=(-key2*x "+y ") carries out image Arnold contravariant
Change deciphering；
Step 3.3) then the width A.width and height A.height of hiding frame is taken by x1, y1 respectively
Remaining computing: x=x1 mod A.width；Y=y1 mod A.height；If x < 0, x=x+A.width, if y < 0, y
=y+A.height；
Step 3.4) according to the numerical value repeated execution of steps 3.2 of key key1) to step 3.3) key1 time, thus recover
The initial data of hiding frame；
Step 4) hiding frame is preserved, resume work.
Above in conjunction with accompanying drawing, embodiments of the present invention are explained in detail, but the present invention is not limited to above-mentioned enforcement
Mode, in the ken that those of ordinary skill in the art are possessed, it is also possible on the premise of without departing from present inventive concept
Make a variety of changes.
Fig. 4 is the LSB algorithm core concept in the decrypting process of the present invention:
It can be seen that LSB algorithm of the present invention deciphering thought is the last position 2bit number of each byte taking out each pixel
Replace by binary form by the data needing embedding according to by them.
The above, the only detailed description of the invention of the present invention, but protection scope of the present invention is not limited thereto, and any
Those familiar with the art in the technical scope that the invention discloses, the change that can readily occur in or replacement, all answer
Contain within the scope of the present invention.
Claims (6)
1. encrypt and decryption method based on the image information improving Arnold conversion and LSB for one kind, it is characterised in that include following
Step:
Step 1, loading background image, and calculate this background image open ended maximum pixel number；If hiding frame
Pixel count exceedes maximum pixel number, then user carries out cutting to hiding frame；
The Arnold conversion that step 2, employing improve carries out pretreatment to hiding frame；Specific as follows:
Step 2.1), user input numerical value key1, key2 of 2 keys, key1 and key2 is positive integer；
Step 2.2), user select any one in following cipher mode that hiding frame is encrypted:
The first cipher mode: the new coordinate of each hiding frame pixel is (x ', y '), wherein: x '=(x+key2*
Y), y '=y；
The second cipher mode: the new coordinate of each hiding frame pixel is (x ', y '), wherein, x '=x, y '=
(key2*x+y)；Wherein, (x y) is the original pixels coordinate of hiding frame needing encryption；
Then x ', y ' carry out complementation respectively to the width A.width of hiding frame and height A.height: x "=x '
mod A.width；Y "=y ' mod A.height；
Step 2.3), by original coordinate be (x, pixel y) move new pixel (x ", y ") place；
Step 2.4), repeated execution of steps 2.2)-step 2.3) key1 time；
Step 3, the size of hiding frame is stored in the beginning of background image；
Step 4, LSB algorithm will be used to be embedded in background image through the pretreated hiding frame of step 2, thus raw
Become the image after encryption；
Frame size is hidden in step 5, extraction；
Step 6, by LSB algorithm extract hide frame；
Step 7, user input key and the hiding frame after extracting are carried out Arnold inverse transformation deciphering, thus recovering
Hide the initial data of frame.
A kind of image information encryption based on improvement Arnold conversion and LSB the most according to claim 1 and decryption method,
It is characterized in that, described step 3 is specific as follows:
Step 3.1), traversal background image front 4 pixels, each pixel comprises 3 bytes；First by hiding frame
Highly A.height every 2bit mono-assembling and dismantling divide, and the most directly replace in background image in front 6 bytes each byte
End 2bit；
Step 3.2), width A.width every 2bit mono-assembling and dismantling of hidden image A are divided, the most directly replace background image
In most end 2bit of each byte in rear 6 bytes.
A kind of image information encryption based on improvement Arnold conversion and LSB the most according to claim 2 and decryption method,
It is characterized in that, described step 4 is specific as follows:
Step 4.1), skip the size memory block of the hiding frame of front 4 pixels of background image, to hiding frame
Carry out LSB encryption；If primary iteration number of times i=1；
Step 4.2), take out the i-th byte hidden in frame successively, leave the highest 2bit of this byte in Background
In the last 2bit of the 1st byte of (4+i) individual pixel of picture, directly replace (4+i) individual pixel the 1st of background image
The last 2bit of byte；
Step 4.3), then take out the 6th of this byte, the data of the 5th be placed on background image (4+i) individual pixel
In the last 2bit of 2 bytes；
Step 4.4), when i less than hide frame all byte quantity, then i=i+1, repeat step 4.2)-step
4.4)；Until all bytes of hiding frame being all placed in background image, thus generate image after encryption.
A kind of image information encryption based on improvement Arnold conversion and LSB the most according to claim 3 and decryption method,
It is characterized in that, described step 5 is specific as follows:
Step 5.1), load encryption after image to internal memory；
Step 5.2), extract front 4 pixel datas of image after encryption, wherein, according to encryption principle, front 2 pixels are figure
The altitude information of picture, rear 2 pixels are the width data of image；In front 2 pixels, each pixel extracting directly in order its
In most end 2bit of each byte, be then stitched together and form the numerical value of 12bit, this numerical value is exactly the height hiding frame
Number of degrees value A.height；
Step 5.3), extract rear 2 pixel datas in front 4 pixels of image after encryption, in rear 2 pixels, each picture
Most end 2bit of the element the most each byte of extracting directly in order, and direct splicing becomes the numerical value of 12bit in order, this numerical value
It is exactly the width numerical value A.width hiding frame.
A kind of image information encryption based on improvement Arnold conversion and LSB the most according to claim 4 and decryption method,
It is characterized in that, described step 6 is specific as follows:
Step 6.1), skip front 4 pixels of image after encryption；
Step 6.2) from the beginning of the 5th pixel of the image after encryption, most end 2bit of each byte of each pixel is extracted
Splice the most in order, the hiding frame after ultimately generating with improvement Arnold conversion.
A kind of image information encryption based on improvement Arnold conversion and LSB the most according to claim 4 and decryption method,
It is characterized in that, described step 7 is specific as follows:
Step 7.1) if the first cipher mode, then according to formula x1=(x "-key2*y "), y1=y " carries out image
Arnold inverse transformation is deciphered；If the second cipher mode, then according to formula x1=x ", y1=(-key2*x "+y ") is carried out
Image Arnold inverse transformation is deciphered；
Step 7.2), then x1, y1 carry out remainder fortune to the width A.width of hiding frame and height A.height respectively
Calculate: x=x1mod A.width, y=y1mod A.height；If x < 0, x=x+A.width, if y < 0, y=y+
A.height；
Step 7.3), repeated execution of steps 7.1) to step 7.2) key1 time, thus recovered the original of hiding frame
Data.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610482879.7A CN106157231B (en) | 2016-06-27 | 2016-06-27 | A kind of image information encryption and decryption method based on improvement Arnold conversion and LSB |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610482879.7A CN106157231B (en) | 2016-06-27 | 2016-06-27 | A kind of image information encryption and decryption method based on improvement Arnold conversion and LSB |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106157231A true CN106157231A (en) | 2016-11-23 |
| CN106157231B CN106157231B (en) | 2018-11-27 |
Family
ID=57350059
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610482879.7A Active CN106157231B (en) | 2016-06-27 | 2016-06-27 | A kind of image information encryption and decryption method based on improvement Arnold conversion and LSB |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106157231B (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107634965A (en) * | 2017-10-15 | 2018-01-26 | 天津飞眼无人机科技有限公司 | The hidden biography system for the information that unmanned plane obtains |
| CN108805786A (en) * | 2017-05-05 | 2018-11-13 | 北京大学 | Steganalysis method and device are matched based on least significant bit |
| CN110780834A (en) * | 2019-10-31 | 2020-02-11 | 深圳云里物里科技股份有限公司 | Method, system and device for locally updating picture of display equipment |
| CN113452688A (en) * | 2021-06-24 | 2021-09-28 | 山东三未信安信息科技有限公司 | Image encryption and decryption method and device based on SM4 and SM2 algorithms |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105118018A (en) * | 2015-08-17 | 2015-12-02 | 安徽大学 | An image hiding method based on a video carrier and under an off-line controllable mechanism |
| CN105303512A (en) * | 2015-09-18 | 2016-02-03 | 安徽大学 | Video dual watermark method based on SVD and QR codes |
-
2016
- 2016-06-27 CN CN201610482879.7A patent/CN106157231B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105118018A (en) * | 2015-08-17 | 2015-12-02 | 安徽大学 | An image hiding method based on a video carrier and under an off-line controllable mechanism |
| CN105303512A (en) * | 2015-09-18 | 2016-02-03 | 安徽大学 | Video dual watermark method based on SVD and QR codes |
Non-Patent Citations (3)
| Title |
|---|
| GIRISH 等: "Encryption of an Image Using Least Significant Bit Substitution Method and Arnold Transformation", 《INTERNATIONAL JOURNAL OF COMBINED RESEARCH & DEVELOPMENT（IJCRD）》 * |
| 朱宁: "Arnold加密算法改进", 《中国优秀硕士学位论文全文数据库 信息科技辑》 * |
| 陈中 等: "基于Arnold变换的改进LSB水印嵌入方法研究", 《衡阳师范学院学报》 * |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108805786A (en) * | 2017-05-05 | 2018-11-13 | 北京大学 | Steganalysis method and device are matched based on least significant bit |
| CN108805786B (en) * | 2017-05-05 | 2022-05-10 | 北京大学 | Steganalysis method and device based on least significant bit matching |
| CN107634965A (en) * | 2017-10-15 | 2018-01-26 | 天津飞眼无人机科技有限公司 | The hidden biography system for the information that unmanned plane obtains |
| CN107634965B (en) * | 2017-10-15 | 2023-09-01 | 天津飞眼无人机科技有限公司 | Hidden transmission system for information acquired by unmanned aerial vehicle |
| CN110780834A (en) * | 2019-10-31 | 2020-02-11 | 深圳云里物里科技股份有限公司 | Method, system and device for locally updating picture of display equipment |
| CN113452688A (en) * | 2021-06-24 | 2021-09-28 | 山东三未信安信息科技有限公司 | Image encryption and decryption method and device based on SM4 and SM2 algorithms |
| CN113452688B (en) * | 2021-06-24 | 2022-07-08 | 山东三未信安信息科技有限公司 | Image encryption and decryption method and device based on SM4 and SM2 algorithms |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106157231B (en) | 2018-11-27 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Chai et al. | TPE-GAN: Thumbnail preserving encryption based on GAN with key | |
| CN107809644B (en) | A kind of encryption area image reversible data concealing method of double-encryption | |
| Li et al. | Chaotic image encryption using pseudo-random masks and pixel mapping | |
| Rawat et al. | A steganography technique for hiding image in an image using lsb method for 24 bit color image | |
| CN104751401B (en) | A kind of novel Piecewise linear chaotic map image encryption and coding method | |
| CN106157231A (en) | A kind of based on image information encryption and the decryption method of improving Arnold conversion and LSB | |
| CN107103631A (en) | Encrypted domain reversible information hidden method based on classification scramble and hiding information classification | |
| CN103778590A (en) | Method and device for utilizing digital image to store and transmit information | |
| CN103440613B (en) | The color image encrypting method of hyperchaos Rossler system | |
| Gamido et al. | Implementation of modified AES as image encryption scheme | |
| CN109547663A (en) | A kind of improvement LSB image latent writing method of combining cipher | |
| CN107070649A (en) | A kind of big file selective cryptographic method for reducing write-in | |
| CN112906043A (en) | Image encryption method based on chaotic mapping and chaotic S-box substitution | |
| Wang et al. | Study on image encryption algorithm based on arnold transformation and chaotic system | |
| Sajitha et al. | Review on various image encryption schemes | |
| CN105872305B (en) | A kind of completely separable encryption area image reversible data concealing method | |
| Li et al. | An image encryption method based on tent and Lorenz chaotic systems | |
| Gutiérrez-Cárdenas | Secret key steganography with message obfuscation by pseudo-random number generators | |
| Bin et al. | Image encryption algorithm based on chaotic map and S-DES | |
| Abu-Alhaija | Crypto-Steganographic LSB-based System for AES-Encrypted Data | |
| Choudhary et al. | An improved pixel sieve method for visual cryptography | |
| Xu et al. | An information hiding algorithm based on bitmap resource of portable executable file | |
| Li et al. | An optical image encryption scheme based on depth-conversion integral imaging and chaotic maps | |
| Fadhil | Accelerating Concealed ISB Steganography and triple-DES encryption using massive parallel GPU | |
| Lan et al. | A Color Image Encryption Algorithm Based on Improved DES |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |