CN110069901A - The more resume images of spatial domain based on chaos system - Google Patents

The more resume images of spatial domain based on chaos system Download PDF

Info

Publication number
CN110069901A
CN110069901A CN201910332538.5A CN201910332538A CN110069901A CN 110069901 A CN110069901 A CN 110069901A CN 201910332538 A CN201910332538 A CN 201910332538A CN 110069901 A CN110069901 A CN 110069901A
Authority
CN
China
Prior art keywords
image
key
iteration
width
diffused
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
Application number
CN201910332538.5A
Other languages
Chinese (zh)
Other versions
CN110069901B (en
Inventor
王书雯
张伟
于海
朱志良
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Northeastern University China
Original Assignee
Northeastern University China
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Northeastern University China filed Critical Northeastern University China
Priority to CN201910332538.5A priority Critical patent/CN110069901B/en
Publication of CN110069901A publication Critical patent/CN110069901A/en
Application granted granted Critical
Publication of CN110069901B publication Critical patent/CN110069901B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • 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/10—Protecting distributed programs or content, e.g. vending or licensing of copyrighted material ; Digital rights management [DRM]
    • 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
    • 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/62—Protecting access to data via a platform, e.g. using keys or access control rules
    • G06F21/6209—Protecting access to data via a platform, e.g. using keys or access control rules to a single file or object, e.g. in a secure envelope, encrypted and accessed using a key, or with access control rules appended to the object itself

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Software Systems (AREA)
  • Computer Hardware Design (AREA)
  • Computer Security & Cryptography (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • General Health & Medical Sciences (AREA)
  • Health & Medical Sciences (AREA)
  • Bioethics (AREA)
  • Multimedia (AREA)
  • Technology Law (AREA)
  • Facsimile Transmission Control (AREA)

Abstract

The invention belongs to field of image processing, the more resume images of spatial domain based on chaos system, including a kind of more image scrambling modes of bit-level and a kind of more image diffusion ways are provided.In the algorithm, the pixel in piece image is may be dispersed into after scramble in different images, and the small variations in a width plaintext image can be diffused into all images.The algorithm either can reach higher safety in histogram analysis, correlation coefficient analysis and the Analysis of Entropy, and structure is simple, and encryption efficiency is high, it is easy to accomplish, the fields such as business, E-Government, individual affair can be used in.

Description

The more resume images of spatial domain based on chaos system
Technical field
The invention belongs to field of image processing, the information protection in digital medium information field is related generally to, information is pacified Full technology and encryption technology.Specifically related to a kind of more resume images of the spatial domain based on chaos system.
Background technique
Nowadays, the high speed development of computer and network technologies brings earth-shaking variation to people's lives, various Digital information is widely used, propagates.Wherein, the application scenarios of multimedia messages especially digital picture are related to much leading Domain.Image can carry many privacy informations, and the image information of the special dimensions such as military, business be even more have to confidentiality it is very high Requirement.However, digital picture has the characteristics that data volume is big, pixel interdependence is high, data redudancy is big, added using traditional It is not very suitable that close algorithm such as DES, AES, which carry out encryption to it,.Therefore, it is necessary to design the encryption for digital picture Algorithm.
In order to ensure the safety of image information, many single image encryption (SIE) algorithms are suggested.It is rapidly sent out in big data It generally requires to carry out batch processing to multiple image today of exhibition.Although SIE algorithm can be theoretically used for multiple times in multiple image It is encrypted, but such processing mode may make encryption efficiency undesirable.Therefore, more image encryptions (MIE) are as a kind of new Emerging multi-media safety technology, receives much attention because of its high efficiency.However, major part MIE algorithm be transform domain to image into Row encryption, and Image Compression is combined, it can be significantly distorted to the picture strip after decryption, this is in application scenes It is not allowed to.In addition, conversion process of the image between spatial domain and transform domain can reduce encryption efficiency.
In recent years, some internal characteristics of digital picture are paid attention to.For example, the different bits of pixel carry Different information content.If the bit depth of image is 8, lowest bit position contains only the information content less than 1%, and lower 4 bits have altogether and contain only information content less than 6%.Moreover, usually having very between the high bit plane of plaintext image Strong correlation.In view of these internal characteristics, the resume image of some bit-levels is suggested.However, these algorithms It is SIE algorithm mostly.Tang etc. proposes a kind of MIE algorithm based on Bit Plane Decomposition and chaotic maps, but its operation is multiple Miscellaneous, encryption efficiency is unsatisfactory.Therefore, in order to carry out bulk encryption processing to multiple image, a kind of efficient bit is designed Grade MIE algorithm important in inhibiting.
Summary of the invention
It is frequently necessary to carry out batch processing to multiple image in the practical application of Encryption Algorithm, conventional algorithm is used for multiple times It is lower to carry out encryption efficiency.And often combined with Image Compression for the Encryption Algorithm of more images, it is therefore desirable to a kind of It can satisfy the more Image Encryption Schemes for not allowing the application scenarios being distorted.Moreover, existing MIE algorithm be usually to image into The MIE algorithm of row Pixel-level operations, bit-level is more rare.
This method uses scramble-diffusion Encryption Architecture, using PWLCM system, i.e. chaos system, occurs as pseudo random number Device.Fig. 1 is the overall flow schematic diagram of Encryption Algorithm.
Multiple image is handled simultaneously in the scramble stage.Plaintext image is subjected to Bit Plane Decomposition first, and bit plane is existed It is logically divided into the bianry image block that some sizes are identical, do not overlap, the sequence then generated according to chaos sequence sequence Bianry image block is rearranged, realizes bit-level scramble.Fig. 2 is the schematic diagram of bianry image block.
Image after diffusion phase successively handles several scrambles.In order to effectively resist differential attack, by image slices vegetarian refreshments Gray value associate with the control parameter of chaos system, itself and chaos sequence after quantization are then subjected to two-wheeled exclusive or fortune Calculate operation.
The present invention the specific technical proposal is:
The more resume images of spatial domain based on chaos system, include the following steps:
Step 1: input plaintext image file and key；
The plaintext image is k width having a size of m × n-pixel gray level image, bit depth d；The key form For (x, y, d1,p1,d2,p2), wherein (x, y) is the size of image block, (d1,p1) be the scramble stage key, (d2,p2) it is to expand The key in the stage of dissipating；
Step 2: shuffle operation, detailed process are carried out to plaintext image are as follows:
Step 2.1: iteration PWLCM system uses formula (1):
P in formula is control parameter, xiIt is system initial value x0Value after iteration i times, p ∈ (0,0.5), xi∈(0,1)；With D in key1As system initial value, p1As control parameter, by PWLCM system iterationIt is secondary, house L iteration as a result, obtaining length and being before abandoningChaos sequence Sp；
Step 2.2: resetting chaos sequence；
By the chaos sequence S in step 2.1pIt is arranged according to ascending order, the sequence after each element is reset in records series obtains It is to lengthIndex sequence I；
Step 2.3: scramble bianry image block；
Image having a size of m × n is logically divided into the image block having a size of x × y, that is, is marked offA figure As block；The image that bit depth is d is subjected to Bit Plane Decomposition, available d bit plane；K width bit depth is the plaintext image of d It is logically divided into altogetherA bianry image block；By the bianry image block according to from each image The upper left corner to the lower right corner, the 1st bit plane to d bit plane, the 1st width image to kth width image sequence number consecutively, own The serial number range of bianry image block is Then, according to the index in step 2.2 Sequence I rearranges bianry image block: if Ii=j, then by the value (0 of all pixels point of the bianry image block of serial number i Or it 1) copies to correspondingly on the respective pixel point of bianry image block of serial number j in ciphertext image；It completes after resetting, it is close The image of generation after storing plaintext image scrambling in texts and pictures picture；
Step 3: operation is diffused to the image after scramble；
Step 3.1: carrying out first round dispersion operation；
With the d in key2As system initial value, p2Iteration is obtained l times for PWLCM system iteration l times as control parameter State value x afterwardsl, the control parameter of PWLCM system is calculated using formula (2) later:
Wherein PjIt is grey scale pixel value, i ∈ { 1,2 ..., k }；By xlAs system initial value, key is calculated1Join as control Continuation iteration m × n times of PWLCM system are generated chaos sequence S, are diffused behaviour to the 2nd width image according to formula (3) by number Make:
Wherein CjIt is encrypted pixel, j ∈ { 1,2 ..., m × n }, round are downward rounding operations, and mod is remainder Number operation；Then, by xlAs system initial value, key is calculated2As control parameter, iteration PWLCM system, in an identical manner Operation is diffused to the 3rd width image；Successively calculate keyiThen operation is diffused to (i+1) width image, wherein i ∈ {1,2,…,k-1}；Finally, calculating keyk, operation is diffused to the 1st width image；
Step 3.2: carrying out the second wheel dispersion operation；
By xlAs system initial value, key is calculatedkAs control parameter, iteration PWLCM system, to spread phase with the first round Same mode is diffused operation to (k-1) width image；Then, by xlAs system initial value, key is calculatedk-1As control Parameter, iteration PWLCM system, is diffused operation to (k-2) width image in an identical manner；Successively calculate keyiAnd it is right (i-1) width image is diffused operation, wherein i ∈ { 2 ..., k }；Finally, calculating key1, behaviour is diffused to kth width image Make；
Step 4: output ciphertext image file.
The invention has the benefit that a kind of more resume images of the spatial domain based on chaos system are provided, including A kind of more image scrambling modes of bit-level and a kind of more image diffusion ways.In the algorithm, the pixel warp in piece image May be dispersed into different images after crossing scramble, and the small variations in a width plaintext image can be diffused into it is all In image.The algorithm either can reach higher peace in histogram analysis, correlation coefficient analysis and the Analysis of Entropy Quan Xing.The algorithm structure is simple, and encryption efficiency is high, it is easy to accomplish, business, E-Government, individual affair etc. can be used in Field.
Detailed description of the invention
Fig. 1 algorithm overall flow schematic diagram.
Fig. 2 bianry image block schematic diagram；(a) bianry image block divides schematic diagram；(b) bianry image block detailed schematic.
Fig. 3 is the sequential schematic that diffusion phase Chaotic system control parameter calculates.(a) chaos in first round dispersion operation The sequential schematic that system control parameters calculate；(b) sequence that Chaotic system control parameter calculates in the second wheel dispersion operation is shown It is intended to.
Fig. 4 plaintext and its histogram, ciphertext and its histogram；(1) Elaine plaintext image；(2) Baboon plaintext image； (3) Fishing Boat plaintext image；(4) Couple plaintext image；(5) Elaine plaintext histogram；(6) Baboon plaintext column Shape figure；(7) Fishing Boat plaintext histogram；(8) Couple plaintext histogram；(9) Elaine ciphertext image；(10) Baboon ciphertext image；(11) Fishing Boat ciphertext image；(12) Couple ciphertext image；(13) Elaine ciphertext column Figure；(14) Baboon ciphertext histogram；(15) Fishing Boat ciphertext histogram；(16) Couple ciphertext histogram.
Specific embodiment
Technical solution is specifically described with attached drawing with reference to embodiments.
For the validity for assessing this algorithm, Elaine, tetra- width standard of Baboon, Fishing Boat, Couple is selected to survey Attempt to be tested and be analyzed.The size of above-mentioned image is 512*512 pixel.
Embodiment: General Implementing principle and detailed step
Step 1: input plaintext image file and key；
The plaintext image is k width having a size of m × n-pixel gray level image, bit depth d；The key form For (x, y, d1,p1,d2,p2), wherein (x, y) is the size of image block, (d1,p1) be the scramble stage key, (d2,p2) it is to expand The key in the stage of dissipating；
Step 2: shuffle operation, detailed process are carried out to plaintext image are as follows:
Step 2.1: iteration PWLCM system, formula are as follows:
P in formula is control parameter, xiIt is system initial value x0Value after iteration i times, p ∈ (0,0.5), xi∈(0,1)；With D in key1As system initial value, p1As control parameter, by PWLCM system iterationIt is secondary, house L iteration as a result, obtaining length and being before abandoningChaos sequence Sp；
Step 2.2: resetting chaos sequence；
By the chaos sequence S in step 2.1pIt is arranged according to ascending order, the sequence after each element is reset in records series obtains It is to lengthIndex sequence I；
Step 2.3: scramble bianry image block；
Image having a size of m × n is logically divided into the image block having a size of x × y, can be marked offA figure As block；The image that bit depth is d is subjected to Bit Plane Decomposition, available d bit plane；K width bit depth is the plaintext image of d It is logically divided into altogetherA bianry image block；By these bianry image blocks according to from each image The upper left corner to the lower right corner, the 1st bit plane to d bit plane, the 1st width image to kth width image sequence number consecutively, own The serial number range of bianry image block is Then, according to the index in step 2.2 Sequence I rearranges bianry image block: if Ii=j, then by the value of all pixels point of the bianry image block of serial number i (0 or 1) is copied to correspondingly on the respective pixel point of the bianry image block of serial number j in ciphertext image；It completes after resetting, The image of generation after storing plaintext image scrambling in ciphertext image；
Step 3: operation is diffused to the image after scramble；
Step 3.1: carrying out first round dispersion operation；
With the d in key2As system initial value, p2Iteration is obtained l times for PWLCM system iteration l times as control parameter State value x afterwardsl, the control parameter of PWLCM system is calculated using following formula later:
Wherein PjIt is grey scale pixel value, i ∈ { 1,2 ..., k }；By xlAs system initial value, key is calculated1Join as control Continuation iteration m × n times of PWLCM system are generated chaos sequence S, are diffused according to following formula to the 2nd width image by number Operation:
Wherein CjIt is encrypted pixel, j ∈ { 1,2 ..., m × n }, round are downward rounding operations, and mod is remainder Number operation；Then, by xlAs system initial value, key is calculated2As control parameter, iteration PWLCM system, in an identical manner Operation is diffused to the 3rd width image；Similarly, key is successively calculatediThen operation is diffused to (i+1) width image, Middle i ∈ 1,2 ..., k-1 }；Finally, calculating keyk, operation is diffused to the 1st width image；
Step 3.2: carrying out the second wheel dispersion operation；
By xlAs system initial value, key is calculatedkAs control parameter, iteration PWLCM system, to spread phase with the first round Same mode is diffused operation to (k-1) width image；Then, by xlAs system initial value, key is calculatedk-1As control Parameter, iteration PWLCM system, is diffused operation to (k-2) width image in an identical manner；Similarly, it successively calculates keyiAnd operation is diffused to (i-1) width image, wherein i ∈ { 2 ..., k }.Finally, calculating key1, to kth width image into Row dispersion operation；
Step 4: output ciphertext image file.
2 analyze cipher round results by taking histogram as an example
The histogram of image contains the demographic information of its pixel gray value, the plaintext image comprising specific information its Histogram often has the feature of certain fixations.It is analyzed by the histogram to image information, statistics can be carried out and attacked It hits.Therefore, the histogram of ciphertext image should as far as possible uniformly.Fig. 4 is plaintext image, ciphertext image and its histogram.
3 analyze algorithm by taking relative coefficient as an example
There is very high correlation between the neighbor pixel of plaintext image, often to cause visual redundancy.Encryption Algorithm needs to eliminate this correlation, make horizontal direction, vertical direction, diagonally adjacent neighbor pixel relative coefficient All close to 0.Table 1 lists the relative coefficient of plaintext image and corresponding ciphertext.
1 correlation coefficient analysis of table
4 analyze algorithm by taking comentropy as an example
Comentropy is the randomness of description information and the common counter of unpredictability.Its calculation formula is as follows:
The comentropy of image is bigger, illustrates that its pixel gray level Distribution value is more random.For bit depth is 8 image, Comentropy should be close to 8 after encryption for it.Table 2 lists the comentropy of plaintext image and ciphertext image.
2 the Analysis of Entropy of table
Test chart Plaintext image information entropy Ciphertext image information entropy
Elaine 7.50598 7.99921
Baboon 7.37196 7.99949
Fishing Boat 7.19137 7.99929
Couple 7.20101 7.9993

Claims (2)

1. the more resume images of spatial domain based on chaos system, which is characterized in that
Firstly, using PWLCM system as pseudorandom number generator using scramble-diffusion Encryption Architecture；
Secondly, handling multiple image simultaneously in the scramble stage: plaintext image first being carried out Bit Plane Decomposition, and bit plane is being patrolled It is divided into the bianry image block that size is identical, does not overlap on volume, the sequence then generated according to chaos sequence sequence is to two-value Image block is rearranged, and realizes bit-level scramble；
Finally, the image after diffusion phase successively handles several scrambles: by the gray value of image slices vegetarian refreshments and chaos system Then it is carried out the operation of two-wheeled XOR operation with the chaos sequence after quantization by control parameter association.
2. the more resume images of the spatial domain according to claim 1 based on chaos system, which is characterized in that specific packet Include following steps:
Step 1: input plaintext image file and key；
The plaintext image is k width having a size of m × n-pixel gray level image, bit depth d；The key form be (x, y,d1,p1,d2,p2), wherein (x, y) is the size of image block, (d1,p1) be the scramble stage key, (d2,p2) it is diffusion phase Key；
Step 2: shuffle operation, detailed process are carried out to plaintext image are as follows:
Step 2.1: iteration PWLCM system uses formula (1):
P in formula is control parameter, xiIt is system initial value x0Value after iteration i times, p ∈ (0,0.5), xi∈(0,1)；With key In d1As system initial value, p1As control parameter, by PWLCM system iterationIt is secondary, give up preceding l Secondary iteration as a result, obtaining length and beingChaos sequence Sp；
Step 2.2: resetting chaos sequence；
By the chaos sequence S in step 2.1pIt is arranged according to ascending order, the sequence after each element is reset in records series is grown Degree isIndex sequence I；
Step 2.3: scramble bianry image block；
Image having a size of m × n is logically divided into the image block having a size of x × y, that is, is marked offA image block； The image that bit depth is d is subjected to Bit Plane Decomposition, available d bit plane；K width bit depth is that the plaintext image of d has altogether It is logically divided intoA bianry image block；By the bianry image block according to from a left side for each image Upper angle to the lower right corner, the 1st bit plane to d bit plane, the 1st width image to kth width image sequence number consecutively, all two-values The serial number range of image block is Then, according to the index sequence I in step 2.2 Bianry image block is rearranged: if Ii=j, then it is the value of all pixels point of the bianry image block of serial number i one is a pair of It copies to answering on the respective pixel point of the bianry image block of serial number j in ciphertext image；It completes after resetting, is deposited in ciphertext image The image of generation after having stored up plaintext image scrambling；
Step 3: operation is diffused to the image after scramble；
Step 3.1: carrying out first round dispersion operation；
With the d in key2As system initial value, p2As control parameter, by PWLCM system iteration l times, after obtaining iteration l times State value xl, the control parameter of PWLCM system is calculated using formula (2) later:
Wherein PjIt is grey scale pixel value, i ∈ { 1,2 ..., k }；By xlAs system initial value, key is calculated1As control parameter, By continuation iteration m × n times of PWLCM system, chaos sequence S is generated, operation is diffused to the 2nd width image according to formula (3):
Wherein CjIt is encrypted pixel, j ∈ { 1,2 ..., m × n }, round are downward rounding operations, and mod is to take the remainder fortune It calculates；Then, by xlAs system initial value, key is calculated2As control parameter, iteration PWLCM system, in an identical manner to 3 width images are diffused operation；Successively calculate keyiThen operation is diffused to (i+1) width image, wherein i ∈ 1, 2,…,k-1}；Finally, calculating keyk, operation is diffused to the 1st width image；
Step 3.2: carrying out the second wheel dispersion operation；
By xlAs system initial value, key is calculatedkAs control parameter, iteration PWLCM system is identical to spread with the first round Mode is diffused operation to (k-1) width image；Then, by xlAs system initial value, key is calculatedk-1Join as control Number, iteration PWLCM system are diffused operation to (k-2) width image in an identical manner；Successively calculate keyiAnd to (i-1) width image is diffused operation, wherein i ∈ { 2 ..., k }；Finally, calculating key1, behaviour is diffused to kth width image Make；
Step 4: output ciphertext image file.
CN201910332538.5A 2019-04-24 2019-04-24 Space domain multi-image encryption algorithm based on chaotic system Expired - Fee Related CN110069901B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201910332538.5A CN110069901B (en) 2019-04-24 2019-04-24 Space domain multi-image encryption algorithm based on chaotic system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910332538.5A CN110069901B (en) 2019-04-24 2019-04-24 Space domain multi-image encryption algorithm based on chaotic system

Publications (2)

Publication Number Publication Date
CN110069901A true CN110069901A (en) 2019-07-30
CN110069901B CN110069901B (en) 2020-11-20

Family

ID=67368722

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910332538.5A Expired - Fee Related CN110069901B (en) 2019-04-24 2019-04-24 Space domain multi-image encryption algorithm based on chaotic system

Country Status (1)

Country Link
CN (1) CN110069901B (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113132079A (en) * 2021-03-31 2021-07-16 广东工业大学 Multi-image encryption method and decryption method

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1350219A1 (en) * 2001-01-09 2003-10-08 Kevin Short Method and apparatus for the compression and decompression of image files using a chaotic system
CN106604040A (en) * 2016-12-12 2017-04-26 中国矿业大学 Multi-image encryption method based on mixed primitives and full permutation
CN107590394A (en) * 2017-08-10 2018-01-16 河海大学 A kind of image encryption method based on chaotic maps and bit recombination
CN109150492A (en) * 2018-08-17 2019-01-04 中国矿业大学 More image encryption methods based on three-dimensional scramble model and chaos
CN109241755A (en) * 2018-08-17 2019-01-18 中国矿业大学 Image encryption method based on three-dimensional scramble model and chaos
CN109376793A (en) * 2018-11-08 2019-02-22 深圳信息职业技术学院 A kind of image encryption method based on four-dimensional Chen Shi hyperchaotic system and K-means cluster
CN109379510A (en) * 2018-09-13 2019-02-22 桂林电子科技大学 A kind of image encryption method based on two dimension Logistic chaotic system algorithm

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1350219A1 (en) * 2001-01-09 2003-10-08 Kevin Short Method and apparatus for the compression and decompression of image files using a chaotic system
CN106604040A (en) * 2016-12-12 2017-04-26 中国矿业大学 Multi-image encryption method based on mixed primitives and full permutation
CN107590394A (en) * 2017-08-10 2018-01-16 河海大学 A kind of image encryption method based on chaotic maps and bit recombination
CN109150492A (en) * 2018-08-17 2019-01-04 中国矿业大学 More image encryption methods based on three-dimensional scramble model and chaos
CN109241755A (en) * 2018-08-17 2019-01-18 中国矿业大学 Image encryption method based on three-dimensional scramble model and chaos
CN109379510A (en) * 2018-09-13 2019-02-22 桂林电子科技大学 A kind of image encryption method based on two dimension Logistic chaotic system algorithm
CN109376793A (en) * 2018-11-08 2019-02-22 深圳信息职业技术学院 A kind of image encryption method based on four-dimensional Chen Shi hyperchaotic system and K-means cluster

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
宋金林等: "整合ChaCha20哈希运算的分块扩散自适应图像加密算法", 《万方数据库》 *

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113132079A (en) * 2021-03-31 2021-07-16 广东工业大学 Multi-image encryption method and decryption method
CN113132079B (en) * 2021-03-31 2023-08-18 广东工业大学 Multi-image encryption method and decryption method

Also Published As

Publication number Publication date
CN110069901B (en) 2020-11-20

Similar Documents

Publication Publication Date Title
Shahna et al. A novel image encryption scheme using both pixel level and bit level permutation with chaotic map
Chai et al. An image encryption algorithm based on chaotic system and compressive sensing
Hosny et al. Novel encryption for color images using fractional-order hyperchaotic system
Loukhaoukha et al. A secure image encryption algorithm based on Rubik′ s cube principle
François et al. A new image encryption scheme based on a chaotic function
Parvez et al. Vibrant color image steganography using channel differences and secret data distribution
CN112202545B (en) Image encryption method based on Y-type filling curve and variable-step Joseph traversal
CN107330338B (en) Color image encryption and decryption method and system based on double-chaos cross diffusion
Houssein et al. An image steganography algorithm using haar discrete wavelet transform with advanced encryption system
Patidar et al. Image encryption through a novel permutation-substitution scheme based on chaotic standard map
Kanwal et al. Analytic study of a novel color image encryption method based on the chaos system and color codes
Liu et al. A color image encryption scheme based on a novel 3d chaotic mapping
Liu et al. A sensitive image encryption algorithm based on a higher-dimensional chaotic map and steganography
Sharma et al. A new image encryption using modified aes algorithm and its comparision with aes
Sethi et al. Chaos-based uncompressed frame level video encryption
CN110069901A (en) The more resume images of spatial domain based on chaos system
Mondal et al. An improved cryptography scheme for secure image communication
Kayani et al. Efficient region of interest encryption based on a new chaotic map
Ye et al. An image encryption scheme based on chaotic systems with changeable parameters
Ye A highly secure image encryption scheme using compound chaotic maps
Li et al. Ftpe-Bc: Fast Thumbnail-Preserving Image Encryption Using Block-Churning
Vanamala et al. Genetic algorithm and chaotic maps based visually meaningful image encryption
Rakesh et al. Multilevel image encryption
Jagadeesh et al. A new image scrambling scheme through chaotic permutation and geometric grid based noise induction
Ye et al. Information security analysis of deterministic encryption and chaotic encryption in spatial domain and frequency domain

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
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20201120