CN104680474A - Digital image encryption and decryption method - Google Patents
Digital image encryption and decryption method Download PDFInfo
- Publication number
- CN104680474A CN104680474A CN201510059294.XA CN201510059294A CN104680474A CN 104680474 A CN104680474 A CN 104680474A CN 201510059294 A CN201510059294 A CN 201510059294A CN 104680474 A CN104680474 A CN 104680474A
- Authority
- CN
- China
- Prior art keywords
- pixe
- matr
- matrix
- scramble
- pixel
- 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.)
- Pending
Links
Landscapes
- Two-Way Televisions, Distribution Of Moving Picture Or The Like (AREA)
Abstract
The invention discloses a digital image encryption and decryption method. The digital image encryption and decryption method comprises the following steps: scrambling pixels: firstly, carrying out pixel scrambling on an image to be encrypted by using a pre-stored random first mapping table, and moving a pixel point to a new position correspondingly represented by a scrambling matrix; scrambling partitioning: then carrying out partitioning matrix scrambling on the new position, which is correspondingly represented by moving the pixel point to the scrambling matrix, by using a pre-stored random second mapping table, to obtain a final encrypted image; in a decryption process, carrying out reversed treatment; and using a mapping table which is the same as the pixel scrambling and the partitioning scrambling to restore an original image. The digital image encryption and decryption method adopts a lookup table manner with the strong randomness to carry out the pixel scrambling; the quantity of lookup tables, the values of units in the tables, iteration times and utilization sequences are flexibly changed by customization of a user, so that the encryption safety is improved.
Description
Technical field
The present invention relates to digital image processing techniques field, be specifically related to a kind of method of digital picture encryption and decryption.
Background technology
Information age, digital picture becomes a kind of information gradually and stores and the important means exchanged.Store at image and in transmitting procedure, the leakage of data may be suffered from or maliciously distort.How safely and effectively the study hotspot that deciphering is current digital image safety to be encrypted to image.
" image scrambling " is a kind of important means of image encryption.Common Image Scrambling Algorithm has Arnold conversion, Gray code conversion etc.These methods respectively have relative merits, and such as Arnold conversion can be rated as classics, but because there being obvious periodicity, low deficient in stability during height when making scramble degree, and deciphering required time is very long; Gray conversion, also because having periodically, causes attack tolerant not high; And due to the plaintext operator of this type of algorithm be pre-determined, so be easily subject to cryptanalytic attack.
The another kind of Image Scrambling Algorithm based on chaos transformation, as Baker conversion, Fibonacci conversion, though this type of algorithm has the pseudo-randomness of its dynamic system, but shortcoming must determine that a fixing parameter and initial value are as key to chaos system, and it is restricted to image array size, be only applicable to square matrix, matrix size must be the multiple of 2 or square power, thus limits attack tolerant and the scope of application of algorithm.
Summary of the invention
Instant invention overcomes the deficiencies in the prior art, a kind of method improving the digital picture encryption and decryption of cryptographic security is provided.
Consider the problems referred to above of prior art, according to an aspect disclosed by the invention, the present invention by the following technical solutions:
A method for digital picture encryption and decryption, it comprises the following steps:
Step one, pixel permutation
First utilize random first mapping table prestored to treat encrypted image and carry out pixel permutation, pixel is moved to the new position that Scrambling Matrix correspondence represents;
Step 2, piecemeal scramble
Then random second mapping table prestored is utilized to carry out partitioned matrix scramble, to obtain final encrypted image to the new position that described pixel moves to the expression of Scrambling Matrix correspondence;
Reverse process when step 3, deciphering
Use the mapping table identical with piecemeal scramble with described pixel permutation respectively, to restore original image.
In order to realize the present invention better, further technical scheme is:
According to one embodiment of the invention, it also comprises and adopts ranks numbers identical and multiple look-up table scrambles that value is different.
According to another embodiment of the invention, it also comprises:
(1) the image array forigi (M, N) of M × N is carried out to the matrix scrambling of pixel permutation based on C_pixe_m × C_pixe_n and C_matr_m × C_matr_n:
1) ranks number---C_pixe_m and C_pixe_n of pixel permutation matrix is first determined:
Calculate M ÷ C_pixe_m=m_pixe ... re_pixe_m;
N÷C_pixe_n＝n_pixe…re_pixe_n；
The determination of A.C_pixe_m:
First make C_pixe_m=13, if re_pixe_m=0, then determine that C_pixe_m gets 13;
If re_pixe_m ≠ 0, then make C_pixe_m=12 again, 11 ..., as re_pixe_m=0, can determine that C_pixe_m is corresponding value;
If until C_pixe_m=4 cannot meet the situation of re_pixe_m=0, then getting C_pixe_m is that re_pixe_m is minimum, the respective value namely under remainder minimum.If remainder is minimum when being 10 than divisor, then get C_pixe_m=10;
B. in like manner determine the value of C_pixe_n, make re_pixe_n=0; If without the situation of re_pixe_n=0, then getting C_pixe_n is that re_pixe_n is minimum, the respective value namely under remainder minimum.If remainder is minimum when being 10 than divisor, then get C_pixe_n=8;
2) pixel permutation is carried out.The unit matrix of total m_pixe × n_pixe C_pixe_m × C_pixe_n carries out pixel permutation.With " C_pixe_m × C_pixe_n pixel permutation look-up table ", pixel permutation is carried out to them.Can only with a look-up table scramble once, also can iteration scramble repeatedly, also can scramble repeatedly but each with different look-up tables, thus obtain pixel permutation matrix fpixe (M, N);
3) row matrix columns---C_matr_m and C_matr_n of piecemeal scramble is determined again:
m_pixe÷C_matr_m＝m_matr…re_matr_m；
n_pixe÷C_matr_n＝n_matr…re_matr_n：
Work as C_matr_m=13, if re_matr_m_x=0, then determine that C_matr_m gets 13; If re_matr_m ≠ 0, then make C_matr_m=12 again, 11 ..., as re_matr_m=0, then determine that C_matr_m is respective value;
If until C_matr_m=4 is without the situation of re_matr_m=0, then getting C_matr_m is that re_matr_m is minimum, the corresponding x value namely under remainder minimum.If all less than the remainder in other situation than re_matr_m_5, then get C_matr_m=5;
In like manner determine the value of C_matr_n, make re_matr_n=0; If without the situation of re_matr_n=0, then getting C_matr_n is that re_matr_n is minimum, the corresponding y value namely under remainder minimum.If remainder corresponding when being 7 than divisor is minimum, then get C_matr_n=7;
4) piecemeal scramble is carried out.The partitioned matrix of total m_matr × n_matr C_matr_m × C_matr_n; The unit matrix of each C_pixe_1 × C_pixe_n is used as a pixel value, with " C_matr_m × C_matr_n matrix scrambling look-up table ", matrix scrambling is carried out to the partitioned matrix of each m_matr × n_matr;
5) the final image fperm (M, N) after two step scrambles is finally obtained;
(2) carry out restoring based on the partitioned matrix recovery of C_matr_m × C_matr_n and the pixel of C_pixe_m × C_pixe_n to the image array of fperm (M, N):
1) first carry out matrix recovery: to the partitioned matrix of m_matr × n_matr C_matr_m × C_matr_n, carry out scramble recovery with " C_matr_m × C_matr_n matrix scrambling look-up table ".Scramble iterations and correspondence look-up table used must be used consistent with during partitioned matrix scramble before;
2) pixel is restored: carry out scramble recovery to the unit matrix of m_pixe × n_pixe C_pixe_m × C_pixe_n with " C_pixe_m × C_pixe_n pixel permutation look-up table ".Scramble iterations and corresponding look-up table must be used consistent with during pixel permutation before.
Compared with prior art, one of beneficial effect of the present invention is:
The method of a kind of digital picture encryption and decryption of the present invention, the strong look-up table mode of randomness is adopted to carry out pixel permutation, instead of adopt certain fixing scramble formula to carry out pixel permutation or recovery, the value of the interior unit of the quantity of look-up table, table, iterations, use order, all make by oneself according to user and reach change flexibly, thus improve the security of encryption.
Accompanying drawing explanation
In order to clearer explanation present specification embodiment or technical scheme of the prior art, below the accompanying drawing used required in the description to embodiment or prior art is briefly described, apparently, the accompanying drawing that the following describes is only the reference to some embodiments in present specification, for those skilled in the art, when not paying creative work, other accompanying drawing can also be obtained according to these accompanying drawings.
Fig. 1 shows the schematic diagram of the scramble look-up table according to one embodiment of the invention spendable 8 × 8.
Fig. 2 shows the schematic diagram of the scramble look-up table of spendable according to a further embodiment of the invention 8 × 8.
Fig. 3 shows the schematic diagram of the scramble look-up table according to one embodiment of the invention spendable 8 × 12.
Fig. 4 shows algorithm flow chart schematic diagram in accordance with another embodiment of the present invention.
Embodiment
Below in conjunction with embodiment, the present invention is described in further detail, but embodiments of the present invention are not limited thereto.
For the encryption and decryption of image, require that algorithm is succinctly effective, safe and reliable on the one hand, there is undetectability and randomness; Another aspect requires that the scope of application is wide, and scrambling effect is good, can perfect restored image during deciphering.
Based on above consideration, the invention provides a kind of new Method for Digital Image Scrambling:
This algorithm divides " pixel permutation " and " piecemeal scramble " two steps: first utilize the Random Maps table 1 prestored to treat encrypted image forigi (x, y) pixel permutation is carried out, pixel is moved to the new position that Scrambling Matrix correspondence represents, obtain fpixe (x, y); Then utilize the Random Maps table 2 couple fpixe (x, y) prestored to carry out partitioned matrix scramble, obtain final encrypted image fperm (x, y).Reverse process during deciphering, as long as use original identical mapping table, reliably can restore original image.
Each step can a scramble once, also can scramble repeatedly, can also value is different with ranks number is identical multiple look-up table scrambles repeatedly.Iterations is more, consuming time longer, but randomness is also better, is more not easily cracked.
The benefit of the method is that algorithm is succinctly effective, does not need to determine scramble mobile route in advance, does not also need first to generate chaos sequence based on certain parameter; To picture size without square restriction, (cromogram also first can convert gray-scale map to through algorithm process can to carry out disorder processing to the gray level image of any M × N, scramble is carried out again by the method), can entire image be traveled through, thus there is higher execution efficiency.Again because reduction step is the reverse process of scramble, so perfect reduction can be ensured.
Particularly, a kind of method of digital picture encryption and decryption, it comprises the following steps:
Step one, pixel permutation
First utilize random first mapping table prestored to treat encrypted image and carry out pixel permutation, pixel is moved to the new position that Scrambling Matrix correspondence represents;
Step 2, piecemeal scramble
Then random second mapping table prestored is utilized to carry out partitioned matrix scramble, to obtain final encrypted image to the new position that described pixel moves to the expression of Scrambling Matrix correspondence;
Reverse process when step 3, deciphering
Use the mapping table identical with piecemeal scramble with described pixel permutation respectively, to restore original image.
It also comprises and adopts ranks numbers identical and multiple look-up table scrambles that value is different.
The concrete steps of one embodiment can comprise:
(1) the image array forigi (M, N) of M × N is carried out to the matrix scrambling of pixel permutation based on C_pixe_m × C_pixe_n and C_matr_m × C_matr_n:
1) ranks number---C_pixe_m and C_pixe_n of pixel permutation matrix is first determined:
Calculate M ÷ C_pixe_m=m_pixe ... re_pixe_m;
N÷C_pixe_n＝n_pixe…re_pixe_n；
The determination of A.C_pixe_m:
First make C_pixe_m=13, if re_pixe_m=0, then determine that C_pixe_m gets 13;
If re_pixe_m ≠ 0, then make C_pixe_m=12 again, 11 ..., as re_pixe_m=0, can determine that C_pixe_m is corresponding value;
If until C_pixe_m=4 cannot meet the situation of re_pixe_m=0, then getting C_pixe_m is that re_pixe_m is minimum, the respective value namely under remainder minimum; If remainder is minimum when divisor is 10, then get C_pixe_m=10;
B. in like manner determine the value of C_pixe_n, make re_pixe_n=0; If without the situation of re_pixe_n=0, then getting C_pixe_n is that re_pixe_n is minimum, the respective value namely under remainder minimum; If remainder is minimum when divisor is 10, then get C_pixe_n=8;
2) pixel permutation is carried out:
The unit matrix of total m_pixe × n_pixe C_pixe_m × C_pixe_n carries out pixel permutation; Pixel permutation is carried out with " C_pixe_m × C_pixe_n pixel permutation look-up table "; With a look-up table scramble once, or iteration scramble is repeatedly, or scramble is repeatedly but at every turn with different look-up tables, thus obtains pixel permutation matrix fpixe (M, N);
3) row matrix columns---C_matr_m and C_matr_n of piecemeal scramble is determined again:
m_pixe÷C_matr_m＝m_matr…re_matr_m；
n_pixe÷C_matr_n＝n_matr…re_matr_n：
Work as C_matr_m=13, if re_matr_m_x=0, then determine that C_matr_m gets 13; If re_matr_m ≠ 0, then make C_matr_m=12 again, 11 ..., as re_matr_m=0, then determine that C_matr_m is respective value;
If until C_matr_m=4 is without the situation of re_matr_m=0, then getting C_matr_m is that re_matr_m is minimum, the corresponding x value namely under remainder minimum.If all less than the remainder in other situation than re_matr_m_5, then get C_matr_m=5;
In like manner determine the value of C_matr_n, make re_matr_n=0; If without the situation of re_matr_n=0, then getting C_matr_n is that re_matr_n is minimum, the corresponding y value namely under remainder minimum.If remainder corresponding when being 7 than divisor is minimum, then get C_matr_n=7;
4) piecemeal scramble is carried out; The partitioned matrix of total m_matr × n_matr C_matr_m × C_matr_n; The unit matrix of each C_pixe_1 × C_pixe_n is used as a pixel value, with " C_matr_m × C_matr_n matrix scrambling look-up table ", matrix scrambling is carried out to the partitioned matrix of each m_matr × n_matr;
5) the final image fperm (M, N) after two step scrambles is finally obtained;
(2) carry out restoring based on the partitioned matrix recovery of C_matr_m × C_matr_n and the pixel of C_pixe_m × C_pixe_n to the image array of fperm (M, N):
1) first carry out matrix recovery: to the partitioned matrix of m_matr × n_matr C_matr_m × C_matr_n, carry out scramble recovery with " C_matr_m × C_matr_n matrix scrambling look-up table "; Scramble iterations and correspondence look-up table used must be used consistent with during partitioned matrix scramble before;
2) pixel is restored: carry out scramble recovery to the unit matrix of m_pixe × n_pixe C_pixe_m × C_pixe_n with " C_pixe_m × C_pixe_n pixel permutation look-up table ", and scramble iterations and the look-up table of correspondence are necessary used consistent with during pixel permutation before.
The look-up table that prestores comprises following dimension size:
13×13，12×12，11×11，10×10，9×9，8×8，7×7，6×6，5×5，4×4，
13×12，13×11，13×10，13×9，13×8，13×7，13×6，13×5，13×4，
12×13，12×11，12×10，12×9，12×8，12×7，12×6，12×5，12×4，
11×13，11×12，11×10，11×9，11×8，11×7，11×6，11×5，11×4，
10×13，10×12，10×11，10×9，10×8，10×7，10×6，10×5，10×4，
9×13，9×12，9×11，9×10，9×8，9×7，9×6，9×5，9×4，
8×13，8×12，8×11，8×10，8×9，8×7，8×6，8×5，8×4，
7×13，7×12，7×11，7×10，7×9，7×8，7×6，7×5，7×4，
6×13，6×12，6×11，6×10，6×9，6×8，6×7，6×5，6×4，
5×13，5×12，5×11，5×10，5×9，5×8，5×7，5×6，5×4，
4×13，4×12，4×11，4×10，4×9，4×8，4×7，4×6，4×5
Totally 100 kinds.
Another embodiment, see shown in Fig. 1 to Fig. 4, the image array of such as 256 × 256: first pixel permutation is carried out to 32 × 32 unit matrixs certain " 8 × 8 look-up table " prestored; And then partitioned matrix scramble is carried out to 4 × 4 partitioned matrix certain " 8 × 8 look-up table " prestored.During recovery, first matrix recovery is carried out to " 8 × 8 look-up table " used during 4 × 4 partitioned matrix piecemeal scrambles; And then pixel recovery is carried out to " 8 × 8 look-up table " used during 32 × 32 unit matrix pixel permutation.
The image array of 1366 × 768: first with " 10 × 8 look-up table ", pixel permutation is carried out to 136 × 96 unit matrixs; And then with " 8 × 12 look-up table ", partitioned matrix scramble is carried out to 17 × 8 partitioned matrix.During recovery, first with " 8 × 12 look-up table ", the recovery of piecemeal scramble is carried out to 17 × 8 partitioned matrix; And then with " 8 × 8 look-up table ", pixel permutation recovery is carried out to 136 × 96 unit matrixs.
The image array of 1920 × 1024, then first carry out pixel permutation to 160 × 128 unit matrixs with " 12 × 8 look-up table "; And then with " 10 × 8 look-up table ", piecemeal scramble is carried out to 16 × 16 partitioned matrix.During recovery, first with " 10 × 8 look-up table ", the recovery of partitioned matrix scramble is carried out to 16 × 16 partitioned matrix; And then with " 12 × 8 look-up table ", pixel permutation recovery is carried out to 160 × 128 unit matrixs.
The present invention is described in detail below with image forigi (1024, the 768) scramble of 1024 × 768:
One. carry out pixel permutation and piecemeal scramble:
1. first determine matrix ranks parameter---C_pixe_m and the C_pixe_n value of pixel permutation:
The determination of A.C_pixe_m:
First make C_pixe_m=13, calculate 1024 ÷ 13=78 ... 10;
Make C_pixe_m=12, calculate 1024 ÷ 12=85 ... 4;
Make C_pixe_m=11, calculate 1024 ÷ 11=93 ... 1;
Make C_pixe_m=10, calculate 1024 ÷ 10=102 ... 4;
Make C_pixe_m=9, calculate 1024 ÷ 9=113 ... 7;
Make C_pixe_m=8, calculate 1024 ÷ 8=128 ... 0; So, get C_pixe_m=8.
B. in like manner C_pixe_n=12 is determined
2. carry out pixel permutation.The unit matrix having 128 × 64 8 × 12 carries out pixel permutation.With certain " 8 × 12 " pixel permutation look-up table, pixel permutation is carried out successively to them.Here can according to actual required iteration twice, namely first with certain " 8 × 12 " look-up table scramble once, keep in video memory; Then with this look-up table by image data temporary again scramble once, and then obtain final pixel permutation matrix fpixe (1024,768).
3. determine partitioned matrix ranks parameter size---C_matr_m and the C_matr_n value of matrix scrambling again:
The determination of A.C_matr_m:
First make C_matr_m=13, calculate 128 ÷ 13=9 ... 11;
Make C_matr_m=12, calculate 128 ÷ 12=10 ... 8;
Make C_matr_m=11, calculate 128 ÷ 11=11 ... 7;
Make C_matr_m=10, calculate 128 ÷ 10=12 ... 8;
Make C_matr_m=9, calculate 128 ÷ 9=14 ... 2;
Make C_matr_m=8, calculate 128 ÷ 8=16 ... 0; So, get C_matr_m=8.
B. in like manner C_matr_n=8 is determined.
1. carry out matrix scrambling.Have the partitioned matrix of 128 8 × 8; The unit matrix of each 8 × 12 is used as a pixel value, and the partitioned matrix to each 16 × 8 carries out piecemeal scramble with " 8 × 8 look-up table ".Here a kind of look-up table is used, iteration twice for same.
2. finally obtain the image array fperm (1024,768) after two kinds of scrambles.
Two. carry out restoring based on the partitioned matrix recovery of 8 × 8 and the unit matrix pixel of 8 × 12 to the image array of fperm (1024,768):
1. first carry out matrix recovery: to 16 × 8 partitioned matrix, carry out scramble recovery with " 8 × 8 matrix scrambling look-up table ".Scramble number of times and correspondence look-up table used must be consistent with during scramble, thus restore pixel permutation image array fpixe (1024,768).
2. pixel is restored: carry out scramble recovery to the unit matrixs of 128 × 64 8 × 12 with " 8 × 12 pixel permutation look-up table ".Scramble number of times must be consistent with during scramble with corresponding look-up table, thus restore original image matrix forigi (1024,768).
In this instructions, each embodiment adopts the mode of going forward one by one to describe, and what each embodiment stressed is the difference with other embodiment, identical similar portion cross-reference between each embodiment.
Spoken of in this manual " embodiment ", " another embodiment ", " embodiment ", etc., refer to the specific features, structure or the feature that describe in conjunction with this embodiment and be included at least one embodiment of the application's generality description.Multiple place occurs that statement of the same race is not necessarily refer to same embodiment in the description.Furthermore, when describing specific features, structure or a feature in conjunction with any embodiment, what advocate is also fall within the scope of the invention to realize this feature, structure or feature in conjunction with other embodiments.
Although with reference to multiple explanatory embodiment of the present invention, invention has been described here, but, should be appreciated that, those skilled in the art can design a lot of other amendment and embodiment, these amendments and embodiment will drop within spirit disclosed in the present application and spirit.More particularly, in the scope of and claim open in the application, multiple modification and improvement can be carried out to the building block of subject combination layout and/or layout.Except the modification of carrying out building block and/or layout is with except improvement, to those skilled in the art, other purposes also will be obvious.
Claims (3)
1. a method for digital picture encryption and decryption, is characterized in that it comprises the following steps:
Step one, pixel permutation
First utilize random first mapping table prestored to treat encrypted image and carry out pixel permutation, pixel is moved to the new position that Scrambling Matrix correspondence represents;
Step 2, piecemeal scramble
Then random second mapping table prestored is utilized to carry out partitioned matrix scramble, to obtain final encrypted image to the new position that described pixel moves to the expression of Scrambling Matrix correspondence;
Reverse process when step 3, deciphering
Use the mapping table identical with piecemeal scramble with described pixel permutation respectively, to restore original image.
2. the method for digital picture encryption and decryption according to claim 1, is characterized in that it also comprises and adopts ranks numbers identical and multiple look-up table scrambles that value is different.
3. the method for digital picture encryption and decryption according to claim 1, is characterized in that it comprises:
(1) the image array forigi (M, N) of M × N is carried out to the matrix scrambling of pixel permutation based on C_pixe_m × C_pixe_n and C_matr_m × C_matr_n:
1) ranks number---C_pixe_m and C_pixe_n of pixel permutation matrix is first determined:
Calculate M ÷ C_pixe_m=m_pixe ... re_pixe_m;
N÷C_pixe_n＝n_pixe…re_pixe_n；
The determination of A.C_pixe_m:
First make C_pixe_m=13, if re_pixe_m=0, then determine that C_pixe_m gets 13;
If re_pixe_m ≠ 0, then make C_pixe_m=12 again, 11 ..., as re_pixe_m=0, can determine that C_pixe_m is corresponding value;
If until C_pixe_m=4 cannot meet the situation of re_pixe_m=0, then getting C_pixe_m is that re_pixe_m is minimum, the respective value namely under remainder minimum; If remainder is minimum when divisor is 10, then get C_pixe_m=10;
B. in like manner determine the value of C_pixe_n, make re_pixe_n=0; If without the situation of re_pixe_n=0, then getting C_pixe_n is that re_pixe_n is minimum, the respective value namely under remainder minimum; If remainder is minimum when divisor is 10, then get C_pixe_n=8;
2) pixel permutation is carried out:
The unit matrix of total m_pixe × n_pixe C_pixe_m × C_pixe_n carries out pixel permutation; Pixel permutation is carried out with " C_pixe_m × C_pixe_n pixel permutation look-up table "; With a look-up table scramble once, or iteration scramble is repeatedly, or scramble is repeatedly but at every turn with different look-up tables, thus obtains pixel permutation matrix fpixe (M, N);
3) row matrix columns---C_matr_m and C_matr_n of piecemeal scramble is determined again:
m_pixe÷C_matr_m＝m_matr…re_matr_m；
n_pixe÷C_matr_n＝n_matr…re_matr_n：
Work as C_matr_m=13, if re_matr_m_x=0, then determine that C_matr_m gets 13; If re_matr_m ≠ 0, then make C_matr_m=12 again, 11 ..., as re_matr_m=0, then determine that C_matr_m is respective value;
If until C_matr_m=4 is without the situation of re_matr_m=0, then getting C_matr_m is that re_matr_m is minimum, the corresponding x value namely under remainder minimum; If all less than the remainder in other situation than re_matr_m_5, then get C_matr_m=5;
In like manner determine the value of C_matr_n, make re_matr_n=0; If without the situation of re_matr_n=0, then getting C_matr_n is that re_matr_n is minimum, the corresponding y value namely under remainder minimum; If remainder corresponding when being 7 than divisor is minimum, then get C_matr_n=7;
4) piecemeal scramble is carried out; The partitioned matrix of total m_matr × n_matr C_matr_m × C_matr_n; The unit matrix of each C_pixe_1 × C_pixe_n is used as a pixel value, with " C_matr_m × C_matr_n matrix scrambling look-up table ", matrix scrambling is carried out to the partitioned matrix of each m_matr × n_matr;
5) the final image fperm (M, N) after two step scrambles is finally obtained;
(2) carry out restoring based on the partitioned matrix recovery of C_matr_m × C_matr_n and the pixel of C_pixe_m × C_pixe_n to the image array of fperm (M, N):
1) first carry out matrix recovery: to the partitioned matrix of m_matr × n_matr C_matr_m × C_matr_n, carry out scramble recovery with " C_matr_m × C_matr_n matrix scrambling look-up table "; Scramble iterations and correspondence look-up table used must be used consistent with during partitioned matrix scramble before;
2) pixel is restored: carry out scramble recovery to the unit matrix of m_pixe × n_pixe C_pixe_m × C_pixe_n with " C_pixe_m × C_pixe_n pixel permutation look-up table ", and scramble iterations and the look-up table of correspondence are necessary used consistent with during pixel permutation before.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510059294.XA CN104680474A (en) | 2015-02-04 | 2015-02-04 | Digital image encryption and decryption method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510059294.XA CN104680474A (en) | 2015-02-04 | 2015-02-04 | Digital image encryption and decryption method |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN104680474A true CN104680474A (en) | 2015-06-03 |
Family
ID=53315474
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510059294.XA Pending CN104680474A (en) | 2015-02-04 | 2015-02-04 | Digital image encryption and decryption method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104680474A (en) |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105847629A (en) * | 2016-03-18 | 2016-08-10 | 大连大学 | Reversible information hiding method for encrypted image |
| CN106408499A (en) * | 2016-09-13 | 2017-02-15 | Tcl集团股份有限公司 | Method and device for getting reverse mapping table for image processing |
| CN106921488A (en) * | 2015-12-25 | 2017-07-04 | 航天信息股份有限公司 | A kind of label data encryption method and label data decryption method |
| CN108171188A (en) * | 2018-01-04 | 2018-06-15 | 天津大学 | For the MCM methods of Rapid matching identification finger vena |
| CN110690968A (en) * | 2019-08-19 | 2020-01-14 | 广东工业大学 | Image encryption method based on Montgomery-RSA algorithm |
| CN111222144A (en) * | 2018-11-27 | 2020-06-02 | 上海耕岩智能科技有限公司 | Fingerprint encryption method and device, storage medium and terminal |
| CN111225121A (en) * | 2018-11-27 | 2020-06-02 | 上海耕岩智能科技有限公司 | Fingerprint encryption transmission method, fingerprint decryption method, fingerprint encryption transmission device, fingerprint decryption device, storage medium and terminal |
| US11704418B2 (en) | 2018-11-27 | 2023-07-18 | Shanghai Harvest Intelligence Technology Co., Ltd. | Fingerprint encryption method and device, fingerprint decryption method and device, storage medium and terminal |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20030007643A1 (en) * | 2001-07-09 | 2003-01-09 | Liat Ben-Zur | Apparatus and method for installing a decryption key |
| CN101022331A (en) * | 2006-02-16 | 2007-08-22 | 刘粉林 | Chaos encrypting method based on carrier |
-
2015
- 2015-02-04 CN CN201510059294.XA patent/CN104680474A/en active Pending
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20030007643A1 (en) * | 2001-07-09 | 2003-01-09 | Liat Ben-Zur | Apparatus and method for installing a decryption key |
| CN101022331A (en) * | 2006-02-16 | 2007-08-22 | 刘粉林 | Chaos encrypting method based on carrier |
Non-Patent Citations (2)
| Title |
|---|
| 孙劲光等: "改进的Fibonacci双置乱图像加密算法", 《计算机科学》 * |
| 李传目等: "基于混沌序列的图像分块加密方法", 《计算机技术与发展》 * |
Cited By (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106921488A (en) * | 2015-12-25 | 2017-07-04 | 航天信息股份有限公司 | A kind of label data encryption method and label data decryption method |
| CN105847629A (en) * | 2016-03-18 | 2016-08-10 | 大连大学 | Reversible information hiding method for encrypted image |
| CN105847629B (en) * | 2016-03-18 | 2018-09-07 | 大连大学 | A kind of reversible information hidden method of encrypted image |
| CN106408499A (en) * | 2016-09-13 | 2017-02-15 | Tcl集团股份有限公司 | Method and device for getting reverse mapping table for image processing |
| CN106408499B (en) * | 2016-09-13 | 2020-06-05 | 深圳市Tcl高新技术开发有限公司 | Method and device for acquiring reverse mapping table for image processing |
| CN108171188A (en) * | 2018-01-04 | 2018-06-15 | 天津大学 | For the MCM methods of Rapid matching identification finger vena |
| CN108171188B (en) * | 2018-01-04 | 2021-11-23 | 天津大学 | MCM method for quickly matching and identifying finger veins |
| CN111222144A (en) * | 2018-11-27 | 2020-06-02 | 上海耕岩智能科技有限公司 | Fingerprint encryption method and device, storage medium and terminal |
| CN111225121A (en) * | 2018-11-27 | 2020-06-02 | 上海耕岩智能科技有限公司 | Fingerprint encryption transmission method, fingerprint decryption method, fingerprint encryption transmission device, fingerprint decryption device, storage medium and terminal |
| US11704418B2 (en) | 2018-11-27 | 2023-07-18 | Shanghai Harvest Intelligence Technology Co., Ltd. | Fingerprint encryption method and device, fingerprint decryption method and device, storage medium and terminal |
| CN110690968A (en) * | 2019-08-19 | 2020-01-14 | 广东工业大学 | Image encryption method based on Montgomery-RSA algorithm |
| CN110690968B (en) * | 2019-08-19 | 2022-07-01 | 广东工业大学 | Image encryption method based on Montgomery-RSA algorithm |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104680474A (en) | Digital image encryption and decryption method | |
| Wang et al. | A novel chaotic algorithm for image encryption utilizing one-time pad based on pixel level and DNA level | |
| Zhang et al. | Image encryption based on three-dimensional bit matrix permutation | |
| Feng et al. | Cryptanalysis and improvement of the hyper-chaotic image encryption scheme based on DNA encoding and scrambling | |
| Murillo-Escobar et al. | A RGB image encryption algorithm based on total plain image characteristics and chaos | |
| Wang et al. | Novel image encryption algorithm based on cycle shift and chaotic system | |
| Enayatifar et al. | A novel chaotic based image encryption using a hybrid model of deoxyribonucleic acid and cellular automata | |
| Chen et al. | Reusing the permutation matrix dynamically for efficient image cryptographic algorithm | |
| Lima et al. | Image encryption based on the finite field cosine transform | |
| CN108513135A (en) | Image encryption and decryption | |
| CN110505054B (en) | Data processing method, device and equipment based on dynamic white box | |
| CN104854814A (en) | Key sharing network device and configuration thereof | |
| CN105404817A (en) | (k,n) threshold based user-friendly visual secret sharing method | |
| CN108667598B (en) | Device and method for realizing secure key exchange and secure key exchange method | |
| Singh et al. | Image encryption scheme based on Knight's tour problem | |
| Wang et al. | A privacy encryption algorithm based on an improved chaotic system | |
| Wang et al. | Design of a chaos-based digitlal image encryption algorithm in time domain | |
| CN108174053B (en) | Decryption area limited image encryption method based on oriented area and playing card mapping | |
| CN104680475A (en) | Image hybrid encrypting method based on hyperchaotic system | |
| CN113098676A (en) | Vector map two-position random scrambling encryption method based on four-dimensional chaos | |
| CN105117653A (en) | Near infrared spectrum data encryption method | |
| Vahidi et al. | A new approach for gray scale image encryption by random grids | |
| CN109902498A (en) | Data ciphering method, data decryption method and corresponding device and equipment | |
| CN106683030B (en) | Quantum multi-image encryption algorithm based on quantum multi-image model and three-dimensional transformation | |
| Hussain et al. | An image encryption technique based on coupled map lattice and one-time S-boxes based on complex chaotic system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20150603 |