CN100589380C - Encryption method based on double-circular queue shift and transposition rule - Google Patents

Encryption method based on double-circular queue shift and transposition rule Download PDF

Info

Publication number
CN100589380C
CN100589380C CN200810017494A CN200810017494A CN100589380C CN 100589380 C CN100589380 C CN 100589380C CN 200810017494 A CN200810017494 A CN 200810017494A CN 200810017494 A CN200810017494 A CN 200810017494A CN 100589380 C CN100589380 C CN 100589380C
Authority
CN
China
Prior art keywords
computing
transformation matrix
key
matrix
row
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.)
Expired - Fee Related
Application number
CN200810017494A
Other languages
Chinese (zh)
Other versions
CN101237322A (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.)
Northwest A&F University
Original Assignee
Northwest A&F University
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 Northwest A&F University filed Critical Northwest A&F University
Priority to CN200810017494A priority Critical patent/CN100589380C/en
Publication of CN101237322A publication Critical patent/CN101237322A/en
Application granted granted Critical
Publication of CN100589380C publication Critical patent/CN100589380C/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Landscapes

  • Storage Device Security (AREA)

Abstract

The invention relates to an encryption method for a double-circular queue shift and transposition rule, which comprises the following steps: taking a plaintext information matrix; creating a random integer sequence; inputting matrix transformation times by a user; randomly taking a random number in the random integer sequence and rounding; performing circular queue shift on one row or one column of the transformation matrix according to a set remainder rule and transposing; obtaining a ciphertext matrix after multiple times of transformation; and recording each transformation operation process as the sub-keys which are sequentially arranged to obtain the key. The invention belongs to classical replacement encryption, adopts the most basic shift operation, realizes a quick encryption and decryption process by using less resources, solves the problems of small encryption strength, low speed, poor operability and the like of the existing shift encryption method, has the advantages of high encryption and decryption speed, simple encryption method realization, high encryption strength of the encryption method, good safety and wide application range, and is suitable for software and hardware realization.

Description

Encryption method based on dual cycle queue shift and rule of conversion
Technical field
The present invention relates to a kind of conventional cryptography method, relate in particular to a kind of conventional cryptography method based on dual cycle queue shift rule and rule of conversion.
Background technology
The conventional cryptography method mainly realizes hiding of information by replacement and displacement dual mode.Typical displacement encryption method comprises fence displacement, rotor machine etc.Wherein substitute mode is not hidden the character of former plaintext, and employing will be formed character expressly and resequence to reach the purpose of Information hiding.
But the Cipher Strength of existing displacement displacement encryption method is little, low to information scramble degree, and some encryption method such as rotor machine etc. only are applicable to the hardware realization.
Summary of the invention
The present invention seeks to propose a kind of encryption method based on dual cycle queue shift and rule of conversion, it has solved little, the problems such as speed is low, operability difference of existing displacement encryption method Cipher Strength, is applicable to soft, hardware realization.
Technical solution of the present invention is:
A kind of encryption method based on dual cycle queue shift and rule of conversion, concrete steps are as follows:
Step 1] the cleartext information matrix A of getting m * n;
Step 2] establishment random integers sequence X=r ∈ N, r≤max (m, n) };
Step 3] user is according to the Cipher Strength requirement, imports an integer w as the matrixing number of times;
Step 4] in the random integers sequence X, appoint and get random number k, computing k=k mod 5;
When k=0, from the random integers sequence X, get 4 random number L 1, L 2, L 3, L 4, require L 1＜L 3≤ m, L 2＜L 4≤ n; Then with L 1Row is as initial row, with L 3Row is as end line, with L 2Row are as initial row, with L 4Row make up transformation matrix A ' as end column, and the recording operation process is #fL 1/ L 2/ L 3/ L 4, form a sub-key;
When k=1, from the random integers sequence X, appoint and get random number x, y, z, require x ≠ y, computing x=1+ (xmod (1+L 3-L 1)), computing y=1+ (y mod (1+L 3-L 1)), computing z=z mod 2, capable and the capable ring shift left position of carrying out of y to the x among the transformation matrix A ', when z=0, do not replace, when z=1, put into transformation matrix A ' again after then shifting out two information exchange positions of transformation matrix A ', the recording operation process is #ax/y/z, forms a sub-key;
When k=2, from the random integers sequence X, appoint and get random number x, y, z, require x ≠ y, computing x=1+ (xmod (1+L 4-L 2)), computing y=1+ (y mod (1+L 4-L 2)), computing z=z mod 2, x among the transformation matrix A ' row and y are listed as the displacement that circulates down, when z=0, do not replace, when z=1, put into transformation matrix A ' again after then shifting out two information exchange positions of transformation matrix A ', recording operation process #bx/y/z forms a sub-key;
When k=3, from the random integers sequence X, appoint and get random number x, y, z, require x ≠ y, computing x=1+ (xmod (1+L 3-L 1), computing y=1+ (y mod (1+L 3-L 1)), computing z=z mod 2, capable and the capable ring shift right position of carrying out of y to the x among the transformation matrix A ', when z=0, do not replace, when z=1, put into transformation matrix A ' again after then shifting out two information exchange positions of transformation matrix A ', recording operation process #cx/y/z forms a sub-key;
When k=4, from the random integers sequence X, appoint and get random number x, y, z, require x ≠ y, computing x=1+ (xmod (1+L 4-L 2)), computing y=1+ (y mod (1+L 4-L 2)), computing z=z mod 2, x among the transformation matrix A ' row and y are listed as the superior displacement that circulates, when z=0, do not replace, when z=1, put into transformation matrix A ' again after then shifting out two information exchange positions of transformation matrix A ', recording operation process #dx/y/z forms a sub-key;
If k ≠ 0 that obtains during the 1st computing k makes up transformation matrix A '=A, i.e. L 1=1, L 2=1, L 3=m, L 4=n, the recording operation process is #fL 1/ L 2/ L 3/ L 4, form first sub-key;
Step 5] repeating step 4] be total to w time, obtain the ciphertext matrix Z of m * n;
Step 6] each sub-key is arranged in order obtains key.
When cleartext information is not matrix form, above-mentioned steps 1] specifically may further comprise the steps: the user imports integer m, n, and the cleartext information that needs are encrypted is inserted m * n matrix from left to right, from top to bottom successively, forms the cleartext information matrix A; Above-mentioned steps 5] specifically may further comprise the steps: repeating step 4] be total to w time, obtain the ciphertext matrix Z of m * n; According to from left to right, from top to bottom mode reads ciphertext matrix Z, obtains cipher-text information; Above-mentioned steps 6] specifically may further comprise the steps: m, n and each sub-key are arranged in order obtain key.
Above-mentioned cleartext information can be text message, graphical information, image information or stream media information.
Advantage of the present invention comprises:
1, encryption/decryption speed is fast: this encryption method belongs to classic displacement encrypts, and the encryption method conversion is simple, adopts the most basic displacement and ex-situ operations, and not additional special conversion process can utilize less resource to realize encryption and decryption process fast;
2, encryption method realizes that simply widely applicable: the encryption method principle is simple relatively, can utilize hardware also can realize based on software;
3, encryption method Cipher Strength height, fail safe is good: the matrix for n * n carries out w conversion, and encryption method intensity can reach n w
4, encryption method is widely applicable: encryption method promptly can be used for text encryption, also encrypts applicable to multimedia messagess such as figure, image, Streaming Medias.
Description of drawings
Fig. 1 is the ciphering process schematic diagram of encryption method of the present invention.
Embodiment
A kind of encryption method based on dual cycle queue shift and rule of conversion is as follows:
Step 1] input integer m, n, the cleartext information that needs are encrypted is inserted m * n matrix from left to right, from top to bottom successively, form the cleartext information matrix A;
Step 2] establishment random integers sequence X=r ∈ N, r≤max (m, n) };
Step 3] user is according to the Cipher Strength requirement, imports an integer w as the matrixing number of times;
Step 4] in the random integers sequence X, appoint and get random number k, computing k=k mod 5;
When k=0, from the random integers sequence X, get 4 random number L 1, L 2, L 3, L 4, require L 1＜L 3≤ m, L 2＜L 4≤ n; Then with L 1Row is as initial row, with L 3Row is as end line, with L 2Row are as initial row, with L 4Row make up transformation matrix A ' as end column, and the recording operation process is #fL 1/ L 2/ L 3/ L 4, form a sub-key;
When k=1, from the random integers sequence X, appoint and get random number x, y, z, require x ≠ y, computing x=1+ (xmod (1+L 3-L 1)), computing y=1+ (y mod (1+L 3-L 1)), computing z=z mod 2, capable and the capable ring shift left position of carrying out of y to the x among the transformation matrix A ', when z=1, put into transformation matrix A ' again after then shifting out two information exchange positions of transformation matrix A ', when z=0, do not replace, the recording operation process is #ax/y/z, forms a sub-key;
When k=2, from the random integers sequence X, appoint and get random number x, y, z, require x ≠ y, computing x=1+ (xmod (1+L 4-L 2)), computing y=1+ (y mod (1+L 4-L 2)), computing z=z mod 2, x among the transformation matrix A ' row and y are listed as the displacement that circulates down, when z=1, put into transformation matrix A ' again after then shifting out two information exchange positions of transformation matrix A ', when z=0, do not replace, the recording operation process is #bx/y/z, forms a sub-key;
When k=3, from the random integers sequence X, appoint and get random number x, y, z, require x ≠ y, computing x=1+ (xmod (1+L 3-L 1)), computing y=1+ (y mod (1+L 3-L 1)), computing z=z mod 2, capable and the capable ring shift right position of carrying out of y to the x among the transformation matrix A ', when z=1, put into transformation matrix A ' again after then shifting out two information exchange positions of transformation matrix A ', when z=0, do not replace, then transposition, recording operation process #cx/y/z forms a sub-key;
When k=4, from the random integers sequence X, appoint and get random number x, y, z, require x ≠ y, computing x=1+ (xmod (1+L 4-L 2)), computing y=1+ (y mod (1+L 4-L 2)), computing z=z mod 2, x among the transformation matrix A ' row and y are listed as the superior displacement that circulates, when z=1, put into transformation matrix A ' again after then shifting out two information exchange positions of transformation matrix A ', when z=0, do not replace, recording operation process #dx/y/z forms a sub-key;
If k ≠ 0 that obtains during the 1st computing k makes up transformation matrix A '=A, i.e. L 1=1, L 2=1, L 3=m, L 4=n, the recording operation process is #fL 1/ L 2/ L 3/ L 4, form first sub-key;
Step 5] repeating step 4] be total to w time, obtain the ciphertext matrix Z of m * 4; According to from left to right, from top to bottom mode reads ciphertext matrix Z, obtains cipher-text information;
Step 6] m, n and each sub-key arranged according to order of operation obtain key, and form safe storage with file, the form of key file be m n#fl 1/ l 2/ l 3/ l 4#ax/y/z#bx/y/z ...
At above-mentioned ciphering process, as follows based on the decrypting process of dual cycle queue shift and rule of conversion:
Step 1] from key file, get preceding two data m and n, obtain line number m and the columns n of ciphertext matrix Z;
Step 2] with cipher-text information according to from left to right, from top to bottom mode inserts m * n matrix successively, forms ciphertext matrix Z;
Step 3] in key, be the segmentation marker of sub-key section with #f, get last sub-key section;
Step 4] as follows to the decryption oprerations process of ciphertext matrix with the sub-key section:
With L 1Row is as initial row, with L 3Row is as end line, with L 2Row are as initial row, with L 4Row are determined the transformation matrix Z ' of ciphertext matrix Z as end column;
According to from after forward order, with each sub-key in the sub-key section transformation matrix Z ' is decrypted operation:
When sub-key is #ax/y/z, the capable and capable ring shift right position of carrying out of y to the x among the transformation matrix Z '; When z=1, put into transformation matrix A ' again after then shifting out two information exchange positions of transformation matrix A ', when z=0, do not replace;
When sub-key is #bx/y/z, row of the x among the transformation matrix Z ' and y are listed as the superior displacement that circulates; When z=1, put into transformation matrix A ' again after then shifting out two information exchange positions of transformation matrix A ', when z=0, do not replace;
When sub-key is #cx/y/z, the capable and capable ring shift left position of carrying out of y to the x among the transformation matrix Z '; When z=1, put into transformation matrix A ' again after then shifting out two information exchange positions of transformation matrix A ', when z=0, do not replace;
When sub-key is #dx/y/z, row of the x among the transformation matrix Z ' and y are listed as the displacement that circulates down; When z=1, put into transformation matrix A ' again after then shifting out two information exchange positions of transformation matrix A ', when z=0, do not replace;
Step 5] delete this sub-key section;
Step 6] repeating step 3] to step 5], till key is sky, finish the decryption oprerations process, obtain expressly matrix A;
Step 7] according to reading expressly matrix A from left to right, from top to bottom, obtain cleartext information.
With Fig. 1 is example, adopts the inventive method to information 1,2,3 ... 20 encrypt, and process is as follows:
1, the user imports m=4, n=5, and structure is matrix A expressly, as Figure 1A;
2, the user imports Cipher Strength w=6;
3, create the random integers sequence X=3,4,5,1,4,5,3,2 ...;
4, operating process for the first time: appoint in the random integers sequence X and get k=5, computing k=k mod 5=0 then gets L in the random integers sequence X 1=2, L 2=3, L 3=4, L4=5 chooses the 2nd of plaintext matrix A and walks to the 4th row, the 3rd row to the 5th structure transformation matrix A ' that is listed as, and shown in black surround part among Figure 1B, recording operation is #f2/3/4/5, as a sub-key;
5, operating process for the second time: appoint in the random integers sequence X and get k=4, computing k=k mod 5=4 then appoints in the random integers sequence X and gets x=4, y=5, z=1, computing x=1+ (x mod (1+L 4-L 2))=2, computing y=1+ (y mod (1+L 4-L 2))=3, computing z=z mod 2=1 carries out upwards cyclic shift to the 2nd row of transformation matrix A ' and the 3rd row, and transposition, and formation is as the result of Fig. 1 C, and the recording operation process is #d2/3/1, as a sub-key;
6, operating process for the third time: appoint in the random integers sequence X and get k=3, computing k=k mod 5=3 then appoints in the random integers sequence X and gets x=5, y=3, z=2, computing x=1+ (x mod (1+L 4-L 2))=3, computing y=1+ (y mod (1+L 4-L 2))=1, computing z=z mod 2=0, the 1st capable and the 3rd capable cyclic shift of carrying out to the right to transformation matrix A ' forms the result as Fig. 1 D, and the recording operation process is #c3/1/0, as a sub-key;
7, the 4th operating process: appoint in the random integers sequence X and get k=0, computing k=k mod 5=0 gets L again in the random integers sequence X 1=1, L 2=1, L 3=3, L4=4 chooses the 1st and walks to the 3rd row, the 1st row to the 4th transformation matrix A that is listed as ", shown in black surround part among Fig. 1 E, the recording operation process is #f1/1/3/4, as a sub-key;
8, the 5th operating process: appoint in the random integers sequence X and get k=1, computing k=k mod 5=1 appoints in the random integers sequence X and gets x=3, y=5, z=1, computing x=1+ (x mod (1+L 3-L 1))=1, computing y=1+ (y mod (1+L 3-L 1))=3, computing z=z mod 2=1 is to transformation matrix A " the 1st row and the 3rd row carry out left cyclic shift, and transposition, formation is as the result of Fig. 1 F, the recording operation process is #a1/3/1, as a sub-key;
9, the 6th operating process: appoint in the random integers sequence X and get k=2, computing k=k mod 5=2 appoints in the random integers sequence X and gets x=3, y=1, z=1, computing x=1+ (x mod (1+L 4-L 2))=4, computing y=1+ (y mod (1+L 4-L 2))=2, computing z=z mod 2=0 is to transformation matrix A " the 4th row and the 2nd row carry out downward cyclic shift, formation is as the result of Fig. 1 G, the recording operation process is #b4/2/0, as a sub-key;
10, obtain key: 4 5#f2/3/4/5#d2/3/1#c3/1/0#f1/1/3/4#a1/3/1#b4/2/0; Ciphertext is: 2,13,4,1,5,6,3,15,11,14,12,7,19,8,20,16,17,9,18,10.
To ciphertext be: 2,13,4 ... 16,17,9,18,10 processes that are decrypted are as follows:
1, from key, gets preceding two numerals 4 and 5, obtain ciphertext matrix Z and be 4 row and 5 and be listed as, ciphertext 2,13,4,1,5,6,3,15,11,14,12,7,19,8,20,16,17,9,18,10 is inserted among 4 * 5 the ciphertext matrix Z;
2, in key, be the segmentation marker of sub-key section, get last sub-key section #f1/1/3/4#a1/3/1#b4/2/0 with #f;
3, with the 1st the row as initial row, with the 3rd the row as end line, with the 1st row as initial row, with the 4th row as end column, determine the transformation matrix Z of ciphertext matrix Z ", see Fig. 1 G black surround part;
4, get last sub-key #b4/2/0, to transformation matrix Z " in the 4th row and the 2nd row superior displacement that circulates, must Fig. 1 F;
5, get penult sub-key #a1/3/1 again, to transformation matrix Z " in the 1st row and the 3rd row carry out the ring shift right position, and transposition, Fig. 1 E;
6, delete last sub-key section #f1/1/3/4#a1/3/1#b4/2/0;
7, get last sub-key section #f2/3/4/5#d2/3/1#c3/1/0 in the key;
8, with the 2nd the row as initial row, with the 4th the row as end line, with the 3rd row as initial row, with the 5th row as end column, determine the transformation matrix Z ' of ciphertext matrix Z, see Fig. 1 D black surround part;
9, get last sub-key #c3/1/0, row of the 3rd among the transformation matrix Z ' and the 1st row are carried out the ring shift left position, get Fig. 1 C;
10, get penult sub-key #d2/3/1 again, the row of the 2nd among the transformation matrix Z ' and the 3rd are listed as the displacement that circulates down, and transposition, Figure 1B got;
12, delete last sub-key section #f2/3/4/5#d2/3/1#c3/1/0; Finish the decryption oprerations process, obtain expressly matrix A;
13, according to reading expressly matrix A from left to right, from top to bottom, obtain cleartext information 1,2,3,4,5,6 ... 19,20.
Technical foundation of the present invention:
1, round-robin queue is a kind of basic data structure.For an ordered data sequence X={ x 1, x 2..., x N-1, x n, n＞2} has defined move operation R=(r Just, r Instead), to the r of X JustBe operating as X '={ x n, x 1, x 2..., x N-1, n＞2} is that forward circulation moves, to the r of X InsteadBe operating as X '={ x 2..., x N-1, x n, x 1, n＞2} is that recycled back moves;
2, for a m*n matrix A (or its arbitrary submatrix A '), can regard its row or column as round-robin queue respectively, so just have capable move to left and move to right or be listed as move down and on move 4 kinds of modes of operation;
3, dual cycle queue: regard two row or two row of matrix A (or its arbitrary submatrix A ') as formation, carry out move operation simultaneously;
4, transposition: when dual cycle queue moves, shift out two data of matrix A (or its arbitrary submatrix A '), switch is put into matrix.

Claims (3)

1, a kind of encryption method based on dual cycle queue shift and rule of conversion is characterized in that:
The step of described encryption method is as follows:
Step 1] the cleartext information matrix A of getting m * n;
Step 2] establishment random integers sequence X=r ∈ N, r≤max (m, n) };
Step 3] user is according to the Cipher Strength requirement, imports an integer w as the matrixing number of times;
Step 4] in the random integers sequence X, appoint and get random number k, computing k=k mod 5;
When k=0, from the random integers sequence X, get 4 random number L 1, L 2, L 3, L 4, require L 1＜L 3≤ m, L 2＜L 4≤ n; Then with L 1Row is as initial row, with L 3Row is as end line, with L 2Row are as initial row, with L 4Row make up transformation matrix A ' as end column, and the recording operation process is #fL 1/ L 2/ L 3/ L 4, form a sub-key;
When k=1, from the random integers sequence X, appoint and get random number x, y, z, require x ≠ y, computing x=1+ (xmod (1+L 3-L 1)), computing y=1+ (y mod (1+L 3-L 1)), computing z=z mod 2, capable and the capable ring shift left position of carrying out of y to the x among the transformation matrix A ', when z=0, do not replace, when z=1, put into transformation matrix A ' again after then shifting out two information exchange positions of transformation matrix A ', the recording operation process is #ax/y/z, forms a sub-key;
When k=2, from the random integers sequence X, appoint and get random number x, y, z, require x ≠ y, computing x=1+ (xmod (1+L 4-L 2)), computing y=1+ (y mod (1+L 4-L 2)), computing z=z mod 2, x among the transformation matrix A ' row and y are listed as the displacement that circulates down, when z=0, do not replace, when z=1, put into transformation matrix A ' again after then shifting out two information exchange positions of transformation matrix A ', the recording operation process is #bx/y/z, forms a sub-key;
When k=3, from the random integers sequence X, appoint and get random number x, y, z, require x ≠ y, computing x=1+ (xmod (1+L 3-L 1)), computing y=1+ (y mod (1+L 3-L 1)), computing z=z mod 2, capable and the capable ring shift right position of carrying out of y to the x among the transformation matrix A ', when z=0, do not replace, when z=1, put into transformation matrix A ' again after then shifting out two information exchange positions of transformation matrix A ', recording operation process #cx/y/z forms a sub-key;
When k=4, from the random integers sequence X, appoint and get random number x, y, z, require x ≠ y, computing x=1+ (xmod (1+L 4-L 2)), computing y=1+ (y mod (1+L 4-L 2)), computing z=z mod 2, x among the transformation matrix A ' row and y are listed as the superior displacement that circulates, when z=0, do not replace, when z=1, put into transformation matrix A ' again after then shifting out two information exchange positions of transformation matrix A ', recording operation process #dx/y/z forms a sub-key;
If k ≠ 0 that obtains during the 1st computing k makes up transformation matrix A '=A, i.e. L 1=1, L 2=1, L 3=m, L 4=n, the recording operation process is #fL 1/ L 2/ L 3/ L 4, form first sub-key;
Step 5] repeating step 4] be total to w time, obtain the ciphertext matrix Z of m * n;
Step 6] each sub-key is arranged in order obtains key.
2, the encryption method based on dual cycle queue shift and rule of conversion according to claim 1 is characterized in that:
Described step 1] specifically may further comprise the steps: the user imports integer m, n, and the cleartext information that needs are encrypted is inserted m * n matrix from left to right, from top to bottom successively, forms the cleartext information matrix A;
Described step 5] specifically may further comprise the steps: repeating step 4] be total to w time, obtain the ciphertext matrix Z of m * n; According to from left to right, from top to bottom mode reads ciphertext matrix Z, obtains cipher-text information;
Described step 6] specifically may further comprise the steps: m, n and each sub-key are arranged in order obtain key.
3, the encryption method based on cycle queue shift rule according to claim 1 and 2 is characterized in that:
Described cleartext information comprises text message, graphical information, image information or stream media information.
CN200810017494A 2008-02-03 2008-02-03 Encryption method based on double-circular queue shift and transposition rule Expired - Fee Related CN100589380C (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN200810017494A CN100589380C (en) 2008-02-03 2008-02-03 Encryption method based on double-circular queue shift and transposition rule

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN200810017494A CN100589380C (en) 2008-02-03 2008-02-03 Encryption method based on double-circular queue shift and transposition rule

Publications (2)

Publication Number Publication Date
CN101237322A CN101237322A (en) 2008-08-06
CN100589380C true CN100589380C (en) 2010-02-10

Family

ID=39920698

Family Applications (1)

Application Number Title Priority Date Filing Date
CN200810017494A Expired - Fee Related CN100589380C (en) 2008-02-03 2008-02-03 Encryption method based on double-circular queue shift and transposition rule

Country Status (1)

Country Link
CN (1) CN100589380C (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107968705A (en) * 2017-11-28 2018-04-27 深圳大学 A kind of method for encryption/decryption, enciphering/deciphering end and double random phase encrypting and deciphering system

Families Citing this family (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101425170A (en) * 2008-11-25 2009-05-06 李东声 Dynamic password implementing method, system and device
CN101938350B (en) * 2010-07-16 2012-06-06 黑龙江大学 File encryption and decryption method based on combinatorial coding
CN101895389B (en) * 2010-07-16 2012-06-06 黑龙江大学 Methods for encrypting and decrypting combined coding based file by adopting proportion calculation
CN102271036B (en) * 2011-08-29 2014-10-15 田耕 Method for encrypting digital signal by utilizing matrixes
CN113744436B (en) * 2021-09-02 2023-05-23 中广核永寿新能源有限公司 Internet of things fan cabin door safety error-prevention control method based on electric power two-ticket management

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0278740A2 (en) * 1987-02-10 1988-08-17 Veritec, Inc. A method for encrypting a code and an encryption device
CN1425987A (en) * 2001-12-10 2003-06-25 中国科学院软件研究所 Encrypting method for reinforcing disordered block cipher
CN1773906A (en) * 2004-11-10 2006-05-17 谢道裕 Magic square signature method for true or false identification

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0278740A2 (en) * 1987-02-10 1988-08-17 Veritec, Inc. A method for encrypting a code and an encryption device
CN1425987A (en) * 2001-12-10 2003-06-25 中国科学院软件研究所 Encrypting method for reinforcing disordered block cipher
CN1773906A (en) * 2004-11-10 2006-05-17 谢道裕 Magic square signature method for true or false identification

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
AES算法的高速实现. 蔡宇东，沈海斌，严晓浪.微电子学与计算机，第21卷第1期. 2004 *
数据加密标准算法的DSP实现. 关宗安，仲丛久.数据采集与处理，第21卷增刊卷. 2006 *

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107968705A (en) * 2017-11-28 2018-04-27 深圳大学 A kind of method for encryption/decryption, enciphering/deciphering end and double random phase encrypting and deciphering system

Also Published As

Publication number Publication date
CN101237322A (en) 2008-08-06

Similar Documents

Publication Publication Date Title
CN101237321B (en) Encryption method based on cycle queue shift rule
CN100589380C (en) Encryption method based on double-circular queue shift and transposition rule
CN107707343B (en) SP network structure lightweight block cipher realization method with consistent encryption and decryption
CN101206815B (en) Encryption process and encryption method
EP2016524B1 (en) Robust cipher design
WO2005099167A1 (en) Information processing method, decryption method, information processing device, and computer program
CN106327414A (en) Plaintext feature-based double-chaos image encryption method
CN101461173A (en) Method of symmetric key data encryption
CN106598882A (en) Secure memory data protection method and device
US10225074B2 (en) Encryption system and method based on biometric technology
CN103345609A (en) Method and device for text encryption and decryption
CN1241352C (en) Encryption method for information in binary code
CN105916141B (en) A kind of realization system and method for self synchronous Zu Chongzhi's enciphering and deciphering algorithm
CN110149200A (en) A kind of color image encrypting method based on dynamic DNA and 4D chaos
CN1523810A (en) Method of designing optimum encryption function and optimized encryption apparatus in a mobile communication system
Meghrajani et al. Universal share for multisecret image sharing scheme based on Boolean operation
CN1190034C (en) Swing type block code enciphering method
Kaur et al. 3D—Playfair cipher using LFSR based unique random number generator
CN101938352B (en) Block cipher software encrypting method
CN109194845A (en) A kind of image encryption method based on inverse time chaos system
CN1168058C (en) Data enciphering method for dynamic cipher coding
CN115484019A (en) AES key expansion improved algorithm with weak correlation
Verma et al. Modified caesar cipher using rectangular method for enhanced security
CN117114959B (en) Image encryption method based on key feedback mechanism of multi-parameter one-dimensional chaotic system
RU2007123714A (en) METHOD FOR CRITOGRAPHIC TRANSFORMATION OF DIGITAL DATA BLOCKS

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
C17 Cessation of patent right
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20100210

Termination date: 20110203