CN101013938B - Encryption method of block cipher - Google Patents
Encryption method of block cipher Download PDFInfo
- Publication number
- CN101013938B CN101013938B CN2007100262945A CN200710026294A CN101013938B CN 101013938 B CN101013938 B CN 101013938B CN 2007100262945 A CN2007100262945 A CN 2007100262945A CN 200710026294 A CN200710026294 A CN 200710026294A CN 101013938 B CN101013938 B CN 101013938B
- Authority
- CN
- China
- Prior art keywords
- bits
- register
- bit
- content
- result
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Abstract
The invention relates to one method for group coding on message data, which comprises the following steps: dividing groups and setting key; setting recycle displacement constant L and displacement parameter R for mode 2 and recycle displacement operation; setting and processing nonlinear conversion; setting and processing multi-dimensional conversion diffusion; setting codes formula wheel function; processing middle data as codes data set. The invention provides one group coding formula based on complete math theory.
Description
Technical field
The present invention relates to information security encryption technology field, especially relate to a kind of electronic computer and coding techniques of utilizing, form the method for Crypted password in order to protection information.
Background technology
Along with the high speed development and the extensive use of computer and data communication technology, society is increasing to the dependence of safe storage, safe handling and the safe transmission of information, and the safeguard protection problem of information just seems more important.Encryption method can make some responsive confidential information not have storage or transmission safely on the medium of safeguard procedures reliably.
The block cipher method is one of modern cryptographic technique that solves the information safety protection problem, and its birth and development have important theory to be worth and broad application background.The prelude of block cipher research has been opened in the promulgation of middle nineteen seventies Data Encryption Standard DES, compare with other cryptographic techniques, the outstanding feature of block encryption algorithm is that clear-text message is divided into groups by fixing length, under the effect of key, encrypt by group, be transformed into the ciphertext block of regular length, each group is corresponding one group of ciphertext expressly.Therefore, the grouping substantive characteristics that adds code calculation is exactly a kind of alternative method.Decrypting process then is with the plaintext group of ciphertext group instead of original equal length.At present, the grouping size of using in the world is 128 and 64 bits.
The basic design principle of block cipher is exactly chaotic principle and the diffusion principle that Shannon proposes, be that raw information becomes very complicated afterwards through encryption, wanting to go out raw information by the interpretation of result after handling is that prior art and practical application are infeasible.
The early stage research of block cipher is to carry out around DES basically, but after entering the nineties, development along with the block cipher analytical technology, particularly differential cryptanalysis and linear cryptanalytic proposition, force people to have to study new cryptographic algorithm, begun to occur some novel block ciphers.After in April, 1997, NIST initiated collection AES (Advanced Encryption Standard Advanced Encryption Standard), there are 15 algorithms to become the AES candidate algorithm, and selected MARS, RC6, Rijndael, Serpent and 5 algorithms of Twofish are as the algorithm that takes one's finals, and final NIST selects the Rijndael algorithm as Advanced Encryption Standard AES; In January, 2000, NESSIE plan in Europe began to collect European standard, there are 17 algorithms to obtain qualifications for being elected, seven algorithms such as selected IDEA, Khazad, MISTY1, Camellia, SHACAL, RC6, SAFER++ are that second of block cipher is taken turns the finals algorithm, and wherein MISTY1, Camellia, three algorithms of SHACAL are together with the block cipher canonical algorithm of aes algorithm Rijndael as the Europe new century.At present, countries such as Korea S, Japan and Russia have also all formulated encryption standard separately, and China also proposes to formulate the block cipher standard of oneself in recent years.
In AES and the collection of European encryption standard, collected more than 30 block cipher scheme altogether, these algorithms have reflected the design level and the direction of current group password.
The research of block cipher comprises block cipher design and two aspects of block cipher analysis.The design of block cipher and analysis are two and had not only opposed mutually but also the research direction of interdependence, promoted the develop rapidly of block cipher just because of this opposition.Thereby an outstanding block cipher method should be wanted to resist various cryptanalytic attacks, can not break even reach in theory, also should in fact can not break.
The basic function of block cipher is that information is carried out safeguard protection, and improves security performance on this basis.Existing block cipher causes encryption/decryption speed slower in order to reach high fail safe, and perhaps logical construction is complicated, difficult realization fast on software and hardware.
On the other hand, development along with datacycle displacement in the block cipher and multidimensional n-point transformation diffuser technology, datacycle displacement and multidimensional n-point transformation diffuser technology have obtained extensive use, particularly in the classical block cipher that some are widely known by the people, also used above technology, the method that makes full use of datacycle displacement as RC5, MARS scheduling algorithm realizes the complex process to data, and the SAFER serial algorithm is just by adopting three-dimensional 2-point, four-dimensional 2-point, two 4-point transformation diffusers to make information data obtain the diffusion of optimum.But, along with going deep into of cryptography technology and cryptanalysis technology in recent years, only use datacycle displacement or multidimensional n-point transformation diffuser technology to come enciphered message chaotic having become with the purpose that spreads of information to be become increasingly complex separately to reach, make some block encryption algorithms exist some encryption/decryption speeds slower, the algorithm logic structure is complicated, and software and hardware is realized the problem of difficulty.Therefore, design the block cipher of highly effective and safe, and it is used in practice, will help the information safety protection of some key areas.
Existing block cipher is attempted in fail safe, logical construction, and aspects such as speed and software and hardware realization complexity find a balance.Many algorithms guarantee the safety of algorithm by complicated logical construction, but algorithm speed is just slack-off like this, and are difficult to program and realize or be difficult to realize on the microcircuit chip; Other has the structure of some algorithms simpler, also be easy to software and hardware and realize, but its fail safe does not just reach the requirement of application.Therefore, being partial to some performances of block cipher, is a main cause that causes these defectives and do not find rational balance.
Therefore, need a kind of new block cipher cryptographic algorithm of invention to address the above problem.
Summary of the invention
The purpose of this invention is to provide a kind of efficient and safe block cipher cryptographic algorithm, that technology such as binding data cyclic shift and optimum multidimensional n-point transformation diffuser realize is bright, the conversion process of ciphertext, has reliable fail safe, encryption/decryption speed is fast, algorithm logic is simple for structure and is easy to characteristics such as software and hardware realization.
The present invention adopts following technological means in order to realize above-mentioned technical purpose:
A kind of encryption method of block cipher, the computer that is used to include register carries out encryption to clear data, and described method comprises that following treatment step: A. is divided into the clear data group with clear data by every group of M byte; B., key K is set, and key K is divided into the key data group according to every N byte; C., the number of bits of cyclic shift is set, and cyclic shift constant L and displacement constant R; The data of clear data group and key data group are carried out mould 2 add and circulative shift operation, obtain first intermediate data; D., the non-linear permutation model of password grouping is set, first intermediate data is carried out non-linear permutation, obtain second intermediate data; E., multidimensional X-point transformation diffuser is set, second intermediate data is carried out the diffusion of multidimensional X-point transformation, obtain the 3rd intermediate data; F., the round function of cryptographic algorithm is provided, and the wheel number of this cryptographic algorithm round function is set, handle the 3rd intermediate data, obtain the 4th intermediate data by described round function; G. the part key with described the 4th intermediate data and described key K pursues the bit XOR, and the result after the operation is the resulting encrypt data group of this clear data group encryption.
Described step B further comprise following treatment step: b1. will be at random every continuous 64 bits of initial key of N byte be divided into one group, common property is given birth to the initial key group of n 64 bits, is labeled as the 1st to n 64 bit group, wherein n=8*N/64; B2. be front and back 32 bits with initial i 64 bit components, back 32 bits add that the value of (i+1) is as new preceding 32 bits, with preceding 32 bits and back 32 bit XORs that newly obtain, the move to left bit of new preceding 32 bit value sizes of recirculation, at last with result after the cyclic shift and n XOR, as i new back 32 bits of 64 bits, and these new back 32 bits are added the number of bits of the new back of ring shift left as a result 32 bit values of preceding 32 bits that newly obtain before this, with this result as i new preceding 32 bits of 64 bits; Wherein, the span of described i is 1≤i≤n; B3. be front and back 32 bits with initial i 64 bit components, preceding 32 bits deduct the value of (i+1) as new preceding 32 bits, after afterwards 32 bits deduct preceding 32 bits that newly obtain, the move to left bit of new preceding 32 bit value sizes of recirculation, at last with the result after the cyclic shift and n XOR as i new back 32 bits of 64 bits, and with the number of bits of the new back of ring shift left as a result 32 bit values of preceding 32 bits that newly obtain before this on these new back 32 bit XORs, with this result as i new preceding 32 bits of 64 bits; B4. with behind the n ring shift left i position, add 1 result new value, and be labeled as n ' as n; B5. the result of 64 bit XORs of 64 bits that step b2 conversion is obtained and step b3 conversion acquisition is as the expanded keys of new n+i 64 bits; B6. repeated execution of steps b2, b 3, b4, b5, the value of i since 1 until n.
Non-linear permutation among the described step D is meant and comprises that following treatment step: d1. is placed on every continuous 4 bytes on the register, obtains 4 registers, is labeled as: the 1st to the 4th register; D2. with the content of the content of the 2nd register and the 4th register by turn after the negate and the content of the 3rd register by the result of bit logical AND again by the bit XOR, the result puts back to the 2nd register; D3. the content of the content of the content of the 1st register and the 2nd register and the 3rd register asks the result of logic OR to pursue the bit XOR again by bit, and the result puts back to the content of the 1st register; D4. exchange the content in the 2nd register and the 4th register; D5. the content in 4 registers is put into the 3rd register by behind the bit XOR, with the content of content in the 2nd register and the 3rd register by bit ask logical AND again with the 1st register in content by the bit XOR, the result puts into the 1st register, the content of the 3rd register by bit after negating value and the content in the 1st register ask logic OR, again with the 2nd register in content by the bit XOR, the result puts into the 2nd register.
Round function in the described step F is meant according to following structure and handles with order: f1. with clear packets successively in order with step B in resulting corresponding secret key grouping XOR mutually; F2. carry out step C, the processing that step D is relevant with step e; F3. XOR mutually divides into groups resulting corresponding secret key among clear packets and the step B successively; F4. f1, f2, f3 are taken turns as one in this grouping cryptographic algorithm.
M value in the described steps A is 16, and pairing grouping size is 128 bits.
Every group key byte number N value of set key K chooses 16,24 or 32, and pairing key grouping size is 128 bits, 192 bits or 256 bits.
Described cyclic shift constant L comprises L1, L2, L3, L4, described L1, L2, L3, L4 successively respectively value be 2,5,8,1.Described constant R is a finite field gf (2
8) on constant, its initial value value is 0X80, and every use R is once, all R is moved to left 1 bit again with constant 0X1B by the bit XOR, with the gained result as new R value.
Multidimensional X-point transformation diffuser in the described step e is three-dimensional 4-point transformation diffuser.
The wheel number of the cryptographic algorithm in the described step F is greater than or equal to 4.
Part key among the described step G is meant last 128 bits of described key K.
Block cipher cryptographic algorithm provided by the invention, its design is based on perfect mathematical theory, combine datacycle displacement and multidimensional X-point transformation diffuser technology, design safety is reasonable, thereby has good opposing differential attack, linear attacks, performance that interpolation is attacked attack such as relevant with key; Simultaneously because block cipher just reaches higher fail safe by corresponding computing, do not use the common computing of tabling look-up of other algorithms, thereby its clear in structure, succinct, rigorous, the quick realization that is easy to software and hardware, and in application, can save memory space greatly.
Description of drawings
Fig. 1 is the block diagram of an embodiment of a kind of encryption method of block cipher of the present invention;
Fig. 2 is the general structural representation of three-dimensional 4-point transformation diffuser among a kind of encryption method of block cipher embodiment of the present invention.
Embodiment
Introduce the present invention in detail below in conjunction with accompanying drawing.
With reference to the accompanying drawings 1, in one embodiment of the invention, realize that the technical scheme of goal of the invention comprises the steps:
Step 1: clear data is pressed every group of fixedly 128bit grouping, and each clear packets is put into 4 registers respectively successively, each register is deposited 4 bytes.Every group key byte number N value that key K is set is 16, and pairing key grouping size is 128 bits.
Step 2: each clear packets is pursued bit XOR, the middle clear packets after obtaining changing with corresponding key grouping by bit.
Step 3:, carry out simple mould 2 respectively and add (XOR) and cycle shift operation to the data in each register.
Step 4: the non-linear permutation model of password grouping is set, middle data are carried out non-linear permutation.
Step 5: the content in 4 registers of middle data is done three-dimensional 4-point diffusion conversion together.
Step 6: repeated execution of steps 2,3,4,5, till reaching default 4 rounds.
Step 7: the result of step 6 and last 128 bit keys of set key are pursued the bit XOR, and the result after the operation is as the ciphertext group that this plaintext group encryption is obtained.
Wherein, step 3 can at length be carried out according to following steps:
The content of the 1st register of step 3a. and the content of the 3rd register be by the bit XOR, the recirculation L1 bit that moves to left, and the result puts back to the 1st register;
The content of the 2nd register of step 3b. and the content of the 4th register be by the bit XOR, the recirculation L2 bit that moves to left, and the result puts back to the 2nd register;
The content of the 3rd register of step 3c. and the content of the 2nd register be by the bit XOR, the recirculation L3 bit that moves to left, and the result puts back to the 3rd register;
The content of the 4th register of step 3d. and the content of the 1st register be by the bit XOR, the recirculation L4 bit that moves to left, and the result puts back to the 4th register;
Step 3e. the 15th byte and constant R are by the bit XOR;
The content of the 2nd register of step 3f. and the content of the 3rd register are pursued the bit XOR by the result of bit XOR and the content of the 4th register, again with the content ring shift left L1 bit of the 1st register after the result by the bit XOR, the number that obtains one 4 byte is put back to the 1st register in regular turn;
The content of the 1st register of step 3g. and the content of the 3rd register are pursued the bit XOR by the result of bit XOR and the content of the 4th register, again with the content ring shift left L2 bit of the 2nd register after the result by the bit XOR, the number that obtains one 4 byte is put back to the 2nd register in regular turn;
The content of the 1st register of step 3h. and the content of the 2nd register are pursued the bit XOR by the result of bit XOR and the content of the 4th register, again with the content ring shift left L3 bit of the 3rd register after the result by the bit XOR, the number that obtains one 4 byte is put back to the 3rd register in regular turn;
The content of the 1st register of step 3i. and the content of the 2nd register are pursued the bit XOR by the result of bit XOR and the content of the 3rd register, again with the content ring shift left L4 bit of the 4th register after the result by the bit XOR, the number that obtains one 4 byte is put back to the 4th register in regular turn;
The content of the 4th register of step 3j. and the content of the 1st register be by the bit XOR, the recirculation L1 bit that moves to left, and the result puts back to the 4th register;
The content of the 3rd register of step 3k. and the content of the 4th register be by the bit XOR, the recirculation L2 bit that moves to left, and the result puts back to the 3rd register;
The content of the 2nd register of step 3l. and the content of the 3rd register be by the bit XOR, the recirculation L3 bit that moves to left, and the result puts back to the 2nd register;
The content of the 1st register of step 3m. and the content of the 2nd register be by the bit XOR, the recirculation L4 bit that moves to left, and the result puts back to the 1st register.
The R that occurs among the step 3e is a finite field gf (2
8) on constant, initial value is 0x80 (hexadecimal representation).Every use R once, all R is moved to left 1 bit again with constant 0x1B (hexadecimal representation) by the bit XOR, the gained result is new R value; Cyclic shift constant L1, L2, L3, L4 value successively are: 2,5,8,1.
Wherein, the described non-linear permutation of step 4 can at length carry out according to following steps:
With the content negate by turn of the 4th register, ask logical AND with the content of the 3rd register by bit, the result who obtains pursues the bit XOR with the content of the 2nd register again, at last operating result is put back to the 2nd register; The content of the 2nd register and the content of the 3rd register are pursued the result that bit is asked logic OR, pursue the bit XOR with the content of the 1st register again, the result puts back to the 1st register; Exchange the content in the 2nd register and the 4th register; Content in the 1st, 2,3,4 register is put into the 3rd register by behind the bit XOR successively, again the content of content in the 2nd register and the 3rd register is asked logical AND by bit, and then and the 1st register in content by the bit XOR, the result puts into the 1st register; The content of the 3rd register is asked logic OR by the value of bit after negating and the content in the 1st register by bit, again with the 2nd register in content pursue the bit XOR, the result puts into the 2nd register.
Three-dimensional 4-point in the step 5 spreads conversion as shown in Figure 2, and the general structure of three-dimensional-4 point transformation devices: making each input all is the n bit, and box " 4-TRA " is
A linear transformation, such linear transformation can with
On reversible 4 * 4 matrix H equivalences get up.
By the 4-TRA that this matrix determined is 4-PHT (pseudo-Hadamard conversion), " transformshuffle " be one from set 1,2 ..., 16} is to it self a displacement.Wherein conversion 4-TRA adopts 4-PHT, and the displacement of " transform shuffle " is [9 63161 14 11 8 52 15 12 13 10 7 4].
In additional embodiments of the present invention, the byte number N value of the key K in the step 1 also can be 24 or 32, and pairing key grouping size is 192 bits or 256 bits.
In additional embodiments of the present invention, the wheel number in the step 6 also can be the integer greater than 4.
Block cipher method of the present invention is easy to software programming realize based on the basic operation of easy realization, and for example realize programming with the C language, encryption/decryption speed has reached 152M bit/s on PIII550.In addition, this block cipher just reaches high fail safe by corresponding computing, does not use the common computing of tabling look-up of other algorithms, so also saved memory space greatly in application.Block cipher of the present invention, by to the avalanche characteristic of encryption and decryption process, bright ciphertext correlation, nonlinearity, difference characteristic and Boolean function expression formula, and the avalanche characteristic of cipher key spreading process, the frequency characteristic, following feature, the analytical test of security performances such as playing card characteristic and autocorrelation, the performance that the result shows that it has good opposing differential attack, linear attacks, interpolation is attacked attack such as relevant with key.Algorithm design of the present invention is based on perfect mathematical theory, and design safety is reasonable, combines datacycle displacement and multidimensional n-point transformation diffuser technology, makes clear in structure, succinct, rigorous, is easy to the quick realization of software and hardware.Block cipher of the present invention, encryption/decryption speed is faster than famous algorithms such as RIJNDAEL, RC5, SAFER++, 3DES, and the logical construction of algorithm is more clear succinct, is easy to the quick realization of program, equally also is adapted at realizing on the hardware chip.
The present invention has passed through experiment, simulation and the dependence test process on electronic computer, and the performance that the result shows that it has good opposing differential attack, linear attacks, interpolation is attacked attack such as relevant with key is the block cipher of a highly effective and safe.
Block cipher cryptographic algorithm provided by the invention, its design is based on perfect mathematical theory, combine datacycle displacement and multidimensional X-point transformation diffuser technology, design safety is reasonable, thereby has good opposing differential attack, linear attacks, performance that interpolation is attacked attack such as relevant with key; Simultaneously because block cipher just reaches higher fail safe by corresponding computing, do not use the common computing of tabling look-up of other algorithms, thereby its clear in structure, succinct, rigorous, the quick realization that is easy to software and hardware, and in application, can save memory space greatly.
Above disclosed only is the preferred embodiments of the present invention, can not limit the present invention's interest field certainly with this, and therefore the equivalent variations of being done according to the present patent application claim still belongs to the scope that the present invention is contained.
Claims (10)
1. encryption method of block cipher, the computer that is used to include register carries out encryption to clear data, it is characterized in that described method comprises following treatment step:
A. clear data is divided into the clear data group by every group of M byte;
B., key K is set, and key K is divided into the key data group according to every N byte;
C., the number of bits of cyclic shift is set, and cyclic shift constant L and displacement constant R; The data of clear data group and key data group are carried out mould 2 add and circulative shift operation, obtain first intermediate data;
D., the non-linear permutation model of password grouping is set, first intermediate data is carried out non-linear permutation, obtain second intermediate data;
E., multidimensional X-point transformation diffuser is set, second intermediate data is carried out the diffusion of multidimensional X-point transformation, obtain the 3rd intermediate data;
F., the round function of cryptographic algorithm is provided, and the wheel number of this cryptographic algorithm round function is set, handle the 3rd intermediate data, obtain the 4th intermediate data by described round function;
G. the part key with described the 4th intermediate data and described key K pursues the bit XOR, and the result after the operation is the resulting encrypt data group of this clear data group encryption.
2. encryption method of block cipher as claimed in claim 1 is characterized in that, described step B further comprises following treatment step:
B1. every continuous 64 bits of the initial key of N byte are divided into one group at random, and common property is given birth to the initial key group of n 64 bits, are labeled as the 1st to n 64 bit group, wherein n=8*N/64;
B2. be front and back 32 bits with initial i 64 bit components, back 32 bits add that the value of (i+1) is as new preceding 32 bits, with preceding 32 bits and back 32 bit XORs that newly obtain, the move to left bit of new preceding 32 bit value sizes of recirculation, at last with result after the cyclic shift and n XOR, as i new back 32 bits of 64 bits, and these new back 32 bits are added the number of bits of the new back of ring shift left as a result 32 bit values of preceding 32 bits that newly obtain before this, with this result as i new preceding 32 bits of 64 bits; Wherein, the span of described i is 1≤i≤n;
B3. be front and back 32 bits with initial i 64 bit components, preceding 32 bits deduct the value of (i+1) as new preceding 32 bits, after afterwards 32 bits deduct preceding 32 bits that newly obtain, the move to left bit of new preceding 32 bit value sizes of recirculation, at last with the result after the cyclic shift and n XOR as i new back 32 bits of 64 bits, and with the number of bits of the new back of ring shift left as a result 32 bit values of preceding 32 bits that newly obtain before this on these new back 32 bit XORs, with this result as i new preceding 32 bits of 64 bits;
B4. with behind the n ring shift left i position, add 1 result new value, and be labeled as n ' as n;
B5. the result of 64 bit XORs of 64 bits that step b2 conversion is obtained and step b3 conversion acquisition is as the expanded keys of new n+i 64 bits;
B6. repeated execution of steps b2, b3, b4, b5, the value of i since 1 until n.
3. encryption method of block cipher as claimed in claim 1 is characterized in that, the non-linear permutation among the described step D is meant and comprises following treatment step:
D1. every continuous 4 bytes are placed on the register, obtain 4 registers, be labeled as: the 1st to the 4th register;
D2. with the content of the content of the 2nd register and the 4th register by turn after the negate and the content of the 3rd register by the result of bit logical AND again by the bit XOR, the result puts back to the 2nd register;
D3. the content of the content of the content of the 1st register and the 2nd register and the 3rd register asks the result of logic OR to pursue the bit XOR again by bit, and the result puts back to the content of the 1st register;
D4. exchange the content in the 2nd register and the 4th register;
D5. the content in 4 registers is put into the 3rd register by behind the bit XOR, with the content of content in the 2nd register and the 3rd register by bit ask logical AND again with the 1st register in content by the bit XOR, the result puts into the 1st register, the content of the 3rd register by bit after negating value and the content in the 1st register ask logic OR, again with the 2nd register in content by the bit XOR, the result puts into the 2nd register.
4. encryption method of block cipher as claimed in claim 1 is characterized in that, the round function in the described step F is meant according to following structure and order and handles:
F1. with clear packets successively in order with step B in resulting corresponding secret key grouping XOR mutually;
F2. carry out step C, the processing that step D is relevant with step e;
F3. XOR mutually divides into groups resulting corresponding secret key among clear packets and the step B successively;
F4. f1, f2, f3 are taken turns as one in this grouping cryptographic algorithm.
5. encryption method of block cipher as claimed in claim 1 is characterized in that: the M value in the described steps A is 16, and pairing grouping size is 128 bits.
6. encryption method of block cipher as claimed in claim 1 or 2 is characterized in that, every group key byte number N value of set key K chooses 16,24 or 32, and pairing key grouping size is 128 bits, 192 bits or 256 bits.
7. encryption method of block cipher as claimed in claim 1 is characterized in that, described cyclic shift constant L comprises L1, L2, L3, L4, described L1, L2, L3, L4 successively respectively value be 2,5,8,1; Described constant R is a finite field gf (2
8) on constant, its initial value value is 0X80, and every use R is once, all R is moved to left 1 bit again with constant 0X1B by the bit XOR, with the gained result as new R value.
8. encryption method of block cipher as claimed in claim 1 is characterized in that, the multidimensional X-point transformation diffuser in the described step e is three-dimensional 4-point transformation diffuser.
9. encryption method of block cipher as claimed in claim 1 is characterized in that, the wheel number of the cryptographic algorithm in the described step F is greater than or equal to 4.
10. encryption method of block cipher as claimed in claim 1 is characterized in that, the part key among the described step G is meant last 128 bits of described key K.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2007100262945A CN101013938B (en) | 2007-01-12 | 2007-01-12 | Encryption method of block cipher |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2007100262945A CN101013938B (en) | 2007-01-12 | 2007-01-12 | Encryption method of block cipher |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101013938A CN101013938A (en) | 2007-08-08 |
| CN101013938B true CN101013938B (en) | 2010-04-07 |
Family
ID=38701246
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2007100262945A Active CN101013938B (en) | 2007-01-12 | 2007-01-12 | Encryption method of block cipher |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101013938B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102542204A (en) * | 2012-01-19 | 2012-07-04 | 天津大学 | Method for protecting local data storage file of environment-protective data acquisition and transmission instrument |
Families Citing this family (24)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN100581101C (en) | 2007-11-19 | 2010-01-13 | 西安西电捷通无线网络通信有限公司 | Packet cipher algorithm based encryption processing arrangement |
| CN101924630B (en) * | 2010-09-06 | 2013-07-10 | 苏州国芯科技有限公司 | Rapid encoding and decoding method for wireless local area network |
| CN103269265B (en) * | 2010-09-06 | 2017-05-03 | 苏州国芯科技有限公司 | high-speed encryption and decryption method for wireless local area network |
| CN103236923B (en) * | 2010-09-06 | 2016-09-28 | 苏州国芯科技有限公司 | Safe encryption method for WLAN |
| CN103269480A (en) * | 2010-09-06 | 2013-08-28 | 苏州国芯科技有限公司 | High-speed encryption and decryption method used for wireless local area network |
| CN101938739B (en) * | 2010-09-06 | 2013-09-25 | 苏州国芯科技有限公司 | Encryption method for wireless local area network |
| CN101984574B (en) * | 2010-11-29 | 2012-09-05 | 北京卓微天成科技咨询有限公司 | Data encryption and decryption method and device |
| CN102064936B (en) * | 2010-11-29 | 2012-08-22 | 北京卓微天成科技咨询有限公司 | Data encryption and decryption methods and devices |
| CN102904711B (en) * | 2011-07-25 | 2016-02-03 | 深圳市金溢科技股份有限公司 | Information ciphering method |
| CN102571331A (en) * | 2012-02-07 | 2012-07-11 | 中国科学院软件研究所 | Cryptographic algorithm realization protecting method used for defending energy analysis attacks |
| CN103701584B (en) * | 2013-12-10 | 2017-01-18 | 中国船舶重工集团公司第七0九研究所 | Method for designing binary linear diffusion structure in symmetric ciphers |
| CN103812658B (en) * | 2014-01-21 | 2018-01-16 | 沈阳工业大学 | A kind of secure communication protocols based on stream cipher |
| CN105337732B (en) * | 2015-10-29 | 2019-10-15 | 全球能源互联网研究院 | A kind of encryption method handling big packet data |
| CN106921486A (en) * | 2015-12-28 | 2017-07-04 | 航天信息股份有限公司 | The method and apparatus of data encryption |
| CN106067878A (en) * | 2016-05-31 | 2016-11-02 | 国网山东省电力公司寿光市供电公司 | A kind of network data encryption transmission method |
| CN109462468B (en) * | 2017-09-06 | 2021-05-28 | 深圳光启智能光子技术有限公司 | Data processing method and device |
| CN107896149A (en) * | 2018-01-02 | 2018-04-10 | 南京航空航天大学 | 128 symmetric encryption methods based on three group operationes |
| CN109286484A (en) * | 2018-09-28 | 2019-01-29 | 哈尔滨百香果科技有限公司 | A kind of quick data processing method improving data encrypting and deciphering speed |
| CN109413051B (en) * | 2018-10-09 | 2021-02-26 | 深圳南方德尔汽车电子有限公司 | Data encryption method and device, computer equipment and storage medium |
| CN109635586B (en) * | 2018-12-13 | 2021-07-06 | 苏州科达科技股份有限公司 | Media file encryption key management method, system, device and storage medium |
| CN110401627B (en) * | 2019-01-31 | 2020-07-10 | 中国科学院软件研究所 | Differential fault attack resistance security evaluation method and system suitable for block cipher algorithm infection protection |
| CN110674510B (en) * | 2019-08-20 | 2023-04-07 | 安徽继远软件有限公司 | Realization method of SM 4-like cryptographic algorithm |
| CN110557253B (en) * | 2019-10-14 | 2023-06-06 | 成都量安区块链科技有限公司 | Relay route acquisition method, device and application system |
| CN111695129B (en) * | 2020-06-17 | 2023-09-08 | 成都鹰翔天际科技有限公司 | Symmetric encryption method capable of resisting linear attack and differential attack |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1426191A (en) * | 2001-12-10 | 2003-06-25 | 中国科学院软件研究所 | Swing type block code enciphering method |
| CN1697369A (en) * | 2005-06-14 | 2005-11-16 | 河北工业大学 | Method for enciphering and deciphering code of packet, and encipherer and decipherer |
-
2007
- 2007-01-12 CN CN2007100262945A patent/CN101013938B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1426191A (en) * | 2001-12-10 | 2003-06-25 | 中国科学院软件研究所 | Swing type block code enciphering method |
| CN1697369A (en) * | 2005-06-14 | 2005-11-16 | 河北工业大学 | Method for enciphering and deciphering code of packet, and encipherer and decipherer |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102542204A (en) * | 2012-01-19 | 2012-07-04 | 天津大学 | Method for protecting local data storage file of environment-protective data acquisition and transmission instrument |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101013938A (en) | 2007-08-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101013938B (en) | Encryption method of block cipher | |
| CN101206816B (en) | Operation processing apparatus, operation processing control method | |
| CN104065474B (en) | Novel low-resource efficient lightweight Surge block cipher implementation method | |
| CN112199696B (en) | Encryption and decryption method based on white-box block cipher | |
| CN109768854A (en) | A kind of implementation method of lightweight block cipher Wheel | |
| Riman et al. | Comparative analysis of block cipher-based encryption algorithms: a survey | |
| CN114389788B (en) | Image encryption algorithm with mixed chaos and block scrambling | |
| CN104052595A (en) | Cryptographic algorithm customizing method | |
| Zakaria et al. | Extended RECTANGLE algorithm using 3D bit rotation to propose a new lightweight block cipher for IoT | |
| CN103501220B (en) | encryption method and device | |
| CN101179375B (en) | Chaos algorithm based network data encryption card | |
| Patel et al. | Hybrid security algorithms for data transmission using AES-DES | |
| CN111314270B (en) | Data encryption and decryption method based on validity period uniform distribution symmetric algorithm | |
| CN104618092A (en) | Information encryption method and system | |
| CN102523085A (en) | Data encryption method, data encrypting device and smart card | |
| CN104579693A (en) | Embedded encryption method based on high-order second-order logistic mapping and embedded encryption device based on high-order second-order logistic mapping | |
| Aboshosha et al. | Evaluation of lightweight block ciphers based on general feistel structure (GFS) | |
| Bai et al. | Differential power attack on SM4 block cipher | |
| CN111314052B (en) | Data encryption and decryption method | |
| CN111314053B (en) | Data encryption and decryption method | |
| CN105553644A (en) | 32-bit-packet length lightweight encryption and decryption method | |
| Illy et al. | An improvement of the AES protocol to optimize energy consumption in IoT | |
| US8817976B2 (en) | Reversible cipher | |
| Al-hazaimeh et al. | Analytical Approach for Data Encryption Standard Algorithm. | |
| Villafuerte et al. | Randomness Evaluation of the Improved 3D-Playfair (i3D) Cipher Algorithm |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| ASS | Succession or assignment of patent right |
Owner name: CHENGYI SCIENCE SOFTWARE DEVELOPMENT CO., LTD., G Free format text: FORMER OWNER: CHENGYI SCIENCE SOFTWARE DEVELOPMENT CO., LTD., GUANGZHOU CITY Effective date: 20081024 |
|
| C41 | Transfer of patent application or patent right or utility model | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20081024 Address after: 368, Guangzhou Avenue, Guangzhou, Guangdong Province, China: 510300 Applicant after: Guangzhou Chengyi science and Technology Software Development Co., Ltd. Co-applicant after: Snrise Corporation Address before: 368, Guangzhou Avenue, Guangzhou, Guangdong Province, China: 510300 Applicant before: Maywide Technology Co., Ltd. |
|
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| ASS | Succession or assignment of patent right |
Free format text: FORMER OWNER: SNRISE CORPORATION Effective date: 20130618 |
|
| C41 | Transfer of patent application or patent right or utility model | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20130618 Address after: 510300, A building, 26 floor, No. 368 Guangzhou Avenue South Road, Zhuhai District, Guangdong, Guangzhou, China Patentee after: Maywide Technology Co., Ltd. Address before: 510300, No. 368, Guangzhou Avenue, Guangzhou, Guangdong Patentee before: Maywide Technology Co., Ltd. Patentee before: Snrise Corporation |