CN1190034C - Swing type block code enciphering method - Google Patents
Swing type block code enciphering method Download PDFInfo
- Publication number
- CN1190034C CN1190034C CNB011404752A CN01140475A CN1190034C CN 1190034 C CN1190034 C CN 1190034C CN B011404752 A CNB011404752 A CN B011404752A CN 01140475 A CN01140475 A CN 01140475A CN 1190034 C CN1190034 C CN 1190034C
- Authority
- CN
- China
- Prior art keywords
- level
- former
- byte
- grade
- content
- 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
Links
Images
Landscapes
- Storage Device Security (AREA)
Abstract
The present invention relates to a swing type block code enciphering method which comprises the steps: plaintext data is divided into data of different plaintext blocks according to a certain fixed length; cipher keys are set and the cipher keys form an S-box (substitution table) which is composed of 256 elements; the data of plaintext blocks is taken as the initial state of a shift register; a certain number of beats are shifted rightward according to the first nonlinear logic, a certain number of beats are shifted leftward according to the second nonlinear logic, and right shifts and left shifts are carried out repetitively like swing till the predetermined number of turns is set; the obtained state of the shift register is output and the state serves as cryptogram blocks corresponding to the plaintext blocks. The nonlinear logical relationship between the plaintext blocks and the cryptogram blocks is formed by that a feedback variable passes through the S-box for many times. The state change of the shift register mixes and diffuses the plaintext skillfully. The method has a good function of resistance to relative attacks to the cipher keys, linear attacks and differential attacks, and has the characteristics of safety, rapidity, easy realization, and concise and precise logical structure.
Description
Technical field
The present invention relates to the information encryption field, relate to a kind of electronic computer technology and coding techniques of utilizing or rather, form the method for dynamic electronic cipher.
Background technology
Information is encrypted, and to prevent the confidential information in the unauthorized person acquired information system, is an extremely important technological means that ensures information security.Encipherment scheme can make some sensitive informations even confidential information relievedly transmit on the common signal channel or to be stored on the medium that does not have safeguard procedures audaciously reliably.
Grouping encryption method is one of important technology scheme that realizes with hyundai electronics password form information privacy, and block cipher starts from the DES that (according to open source information) middle nineteen seventies occurs.Compare with stream cipher, the key that an outstanding advantage of block cipher is the user can be reused.The realization technology of block encryption algorithm is earlier clear data to be divided into the plaintext group that several length are the n bit, again the plaintext group of each the n bit symbol with other n bit replaced, thus the ciphertext (being the ciphertext group) of formation n bit.Therefore the essential characteristic of grouping encryption method is a kind of replacement operation.Decrypting process then is with the contrary plaintext group on behalf of original n bit of the ciphertext group of n bit.At present, the grouping size n that generally acknowledges in the world is 128 and 64.
Along with the development of block cipher technology, the activity of the collection password encryption standard of particularly carrying out in recent years discloses some block ciphers successively.After in April, 1997, NIST initiated collection AE8 (AdvancedEncryption Standard), there are 15 block cipher schemes to obtain qualifications for being elected; In January, 2000, Europe began to collect European standard, had 17 block cipher scheme participations in the election.At present, countries such as Korea S, Japan and Russia have all formulated encryption standard separately, and the encryption standard of China's formulation oneself thing must gone.
Obviously, if can design a kind of good encipherment scheme, and it is served society widely, to help promoting the information infrastructure building of each key areas of national economy, naturally be the act of benefiting the nation and the people, therefore, invention function admirable and the encipherment scheme that has a technical characteristic become our wish.
In AES and the collection of European encryption standard, collected more than 30 block cipher scheme altogether, as RIJNDAEL, RC6, MARS, TWOFISH, IDEA, SAFER++ or the like.These schemes have been represented level, characteristics, style and the basic orientation of current international block cipher substantially.Certainly, except above-mentioned more than 30 schemes, also has some other scheme.
The basic premise of block cipher design is to guarantee and improve security performance.Take a broad view of existing block cipher scheme, the problem of existence is that encryption/decryption speed is slower, and the logical construction of many algorithms is complicated, is difficult for program and realizes or be difficult to realize on the microcircuit chip.Thereby, the potentiality of necessary excavation this respect.
On the other hand, along with the maturation gradually of shift register theory since half a century, shift register is widely used in and generates on the pseudo random sequence, has the long period series of good statistical property especially for generation.The shift-register sequence password is that shift register is applied among the design of modern sequence electronic cipher, with it as the basis that generates the pseudo random key stream sequence.Deepening continuously along with cryptography and analytical technology in recent years, in numerous block cipher schemes, there is the bright ciphertext conversion process of segmentation scheme to can be regarded as and finishes, but more or less all exist the slow and logical construction realization of encryption/decryption speed than complicated problems by shift register.
Summary of the invention
The objective of the invention is to design a kind of encryption method of block cipher, all utilize shift register to realize the conversion process of bright ciphertext, have that fail safe is reliable, encryption/decryption speed is fast, algorithm logic is easy to characteristics such as realization.
The technical scheme that realizes the object of the invention is such: a kind of encryption method of block cipher is characterized in that comprising following treatment step:
A. clear data is divided into expressly group by every group of M byte (M * 8 bits), M is an even number;
B., key K is set, and forms 256 yuan substitution table (S box) by key K;
C., a Z/ (2 is set
8) M level shift register on the ring, the M byte is expressly organized the data correspondence insert in the M level shift register;
D. feedback moves to right, at different levels with M level shift register by the 0th grade of left-to-right number consecutively, the 1st grade, ..., the M-1 level, the half of displacement mode in a left side is with 1 grade of former the 0th grade content feed to the, 2 grades of former the 1st grade content feed to the, ..., the content feed of former M/2-2 level is to the M/2-1 level, 0 grade of the content feed to the of former M/2-1 level, right half of displacement mode is that content feed with former M/2 level is to the M/2+1 level, the content feed of former M/2+1 level is to the M/2+2 level, ..., the content feed of former M-2 level is to the M-1 level, the replacement value of gained and the content of former M-1 level behind the content process S box of former M/2 level, content three's addition of former M/2-1 level, again to digital-to-analogue 256 after feed back to the M/2 level, by the displacement amplitude j that is provided with, the M level that moves to right shift register j is altogether clapped;
E. feedback moves to left, at different levels with M level shift register by the 0th grade of left-to-right number consecutively, the 1st grade, ..., the M-1 level, right half of displacement mode is that content feed with former M/2+1 level is to the M/2 level, the content feed of former M/2+2 level is to the M/2+1 level, ..., the content feed of former M-1 level is to the M-2 level, the content feed of former M/2 level is to the M-1 level, the half of displacement mode in a left side is that content feed with former M/2-1 level is to the M/2-2 level, the content feed of former M/2-2 level is to the M/2-3 level, ..., 0 grade of former the 1st grade content feed to the, the content of former M/2-1 level through the S box after replacement value and former the 0th grade content and content three's addition of former M/2 level of gained, again to digital-to-analogue 256 after feed back to the M/2-1 level, by the displacement amplitude j that is provided with, the M level that moves to left shift register j is altogether clapped;
F. repeated execution of steps D, E stop when number is taken turns in default moving to right and move to left until reaching;
G. the M level shift register content conduct after will stopping to be shifted is to the resulting ciphertext group of this plaintext group encryption.
Described M value is 8,12,16 or 20, and pairing grouping size is respectively 64 bits, 96 bits, 128 bits and 160 bits.
Described step B further comprises following treatment step:
B1. in the length of set key K during less than 32 bytes, earlier its circulation being derived from is 32 bytes, is labeled as the 0th to the 31st byte;
B2. the 0th to the 31st byte key symbol self left side circulation string is moved 1, the higher bit that is about to each character moves on to lowest order, constitute the 32nd byte to the 63 byte keys, again the 32nd byte to the 63 byte keys symbol self left side circulation string is moved 1, constitute the 64th byte to the 95 byte keys, carry out this step continuously until the key that forms 256 byte lengths;
B3. set up and be numbered 0 to 255 key array location, the key of 256 byte lengths is put a byte by every array location, order is put into array location successively;
B4. set up and be numbered 0 to 255 conversion array location, and its numerical value is changed to 0 to 255 respectively;
B5. set up a mnemon m and a counting unit i, and the initial value of agreement m is 0, with the content in the i counting unit is that number in the current key array location and the number in the current conversion array location are found in the address, the value three of they and mnemon m added and, and to this and digital-to-analogue 256 backs new values as mnemon m;
B6. by the new value of the m that is numbered i among the step b5 and acquisition, be that numerical value in the unit of m and address are the exchange of values in the 255-i unit with address in the conversion array location, with address in the conversion array location be numerical value in the i unit and address be 255-m the unit in exchange of values;
B7. the new value left side circulation string of the mnemon m that step b5 is obtained moves one;
B8. repeated execution of steps b5, b6, b7 expire 255 until the value that makes counting unit i by 0, constitute 256 yuan substitution table (S box) by the conversion array location at last.
Among described step D, the E through the S box, be according to the conversion array location of S box input value inquiry with this value number, and with the numerical value in this conversion array location as output valve.
Among described step D, the E, described respectively move to right and the conversion that moves to left in, displacement amplitude j is the natural number that is no less than M/2 that presets arbitrarily.
In the described step F, the described wheel number that moves to right and move to left is not less than 2.
Method of the present invention adopts that the feedback that moves to right earlier is fixing claps, moves to left that feedback is fixing claps, another fixing another fixing bat of feedback of clapping, move to left again of the feedback that moves to right again ..., as playing on a swing, so be called the encryption method of block cipher of " playing on a swing " formula.
Resemble the inventive method like this, shift register is applied in the block cipher scheme, and the conversion process of bright ciphertext all being finished by the differentiation of shift register state, is original and different a kind of technical scheme.
Method of the present invention, be based on the grouping encryption method that the shift register state variation is implemented, the all processes of its bright ciphertext conversion is by the shift register logic realization, and its key link comprises the feedback logic of shift register, the setting of S box, the displacement amplitude (umber of beats) of shift register state and the wheel numerical control system that moves to right and move to left.Group expressly as the initial condition of shift register, through after the repeatedly feedback recurrent of non-linear logic, is exported the state of the shift register of gained again as the ciphertext group.Non-linear logical relation between wherein bright ciphertext is because feedback variable repeatedly constitutes through the S box.If regard bright ciphertext conversion as a big displacement, the encryption method of block cipher of " playing on a swing " formula has provided then that repeatedly nonlinear feedback by shift register realizes can resist the optimum big displacement of linearly attacking, again can resisting differential attacking.Wherein the S box is an important component part in the nonlinear feedback logic, and it is determined by key.Know the user of key, forward or the reverse state of making shift register push away row freely, and the process of the reverse row of pushing away shift register state is exactly the process of deciphering.The assailant then is difficult to isolate the nonlinear feedback logic from high complexity repeatedly non-linear compound, perhaps the key factor.
Method of the present invention, its safety can't be carried out the row of pushing away and differentiation of shift register state according to being not occupy under the situation of S box as the assailant.
Algorithm flow of the present invention utilizes software programming to realize easily, and is adapted at realizing on the microcircuit chip.
Method of the present invention is to have safe, quick, as to be easy to characteristics such as realizing encryption method of block cipher, and its main feature is: finished the mixing and the diffusion of bright ciphertext by the nonlinear shift register state transformation; Employing move to right feedback, the feedback that moves to left, move to right feedback, the move to left displacement mode of this formula of playing on a swing of feedback more again.In concrete the enforcement, the grouping size of clear data can also have multiple choices such as 64,96,160 except 128 bits.
Description of drawings
Fig. 1 is the feedback arrangement schematic diagram that moves to right when selecting 16 grades of shift registers;
Fig. 2 is the feedback arrangement schematic diagram that moves to left when selecting 16 grades of shift registers;
Fig. 3 is the feedback arrangement schematic diagram that moves to right when selecting 8 grades of shift registers;
Fig. 4 is the feedback arrangement schematic diagram that moves to left when selecting 8 grades of shift registers.
Embodiment
With 128 bit groupings is example, referring to Fig. 1, Fig. 2, makes Q encircle Z/ (2
8) on 16 grades of shift registers.Generate cryptographic processes and comprise move to right feedback logic and the two kinds of feedback systems of feedback logic that move to left shown in Figure 2 shown in Fig. 1 structure.
11,12 is mould 256 additions among the figure,
Be the S box, the S box is a substitution table that is made of 256 elements that is preset by key.
Its encryption flow is: 16 byte clear datas are put into successively shifting memory Q the 0th to 15 grade.Application person can be according to wish regulation wheel number and the every feedback umber of beats (promptly reverberating amplitude) of taking turns of oneself, as set the wheel number be 3, every feedback umber of beats of taking turns is followed successively by 10,9,8, then Q is moved to right and feed back 10 bats by Fig. 1 logic, by Fig. 2 logic Q is moved to left again and feed back 10 bats, pressing Fig. 1 logic shift right feedback 9 again claps, pressing Fig. 2 logical shift left feedback 9 again claps, pressing Fig. 1 logic shift right feedback 8 again claps, press Fig. 2 logical shift left feedback 8 again and clap, 16 byte status of 16 grades of shift registers that will obtain are then exported as the ciphertext group.
Move to right when feedback, the half of displacement mode in a left side be with 1 grade of former the 0th grade content feed to the, former the 1st grade 2 grades of content feed to the ..., 7 grades of former the 6th grade content feed to the, 0 grade of former the 7th grade content feed to the.Right half of displacement mode be with 9 grades of former the 8th grade content feed to the, former the 9th grade 10 grades of content feed to the ..., 15 grades of former the 14th grade content feed to the.Former the 8th grade content through the S box after replacement value and former the 15th grade content of gained and former the 7th grade content three add and also feed back to the 8th grade behind the mould 256.
Move to left when feedback, right half of displacement mode be former the 9th grade 8 grades of content feed to the, former the 10th grade 9 grades of content feed to the ..., 14 grades of former the 15th grade content feed to the, 15 grades of former the 8th grade content feed to the.The half of displacement mode in a left side be former the 7th grade 6 grades of content feed to the, former the 6th grade 5 grades of content feed to the ..., 0 grade of former the 1st grade content feed to the, former the 7th grade content through the S box after replacement value and former the 0th grade content of gained and former the 8th grade content three add and also feed back to the 7th grade behind the mould 256.
The user can oneself set wheel number and displacement feedback umber of beats during enforcement.The wheel number is big more or umber of beats is big more, and then fail safe is high more, arithmetic speed is slow more.
And for example when being grouped into 64 bits (8 bytes), referring to Fig. 3, Fig. 4,21,22 is mould 256 additions among the figure, and Q ' is ring Z/ (2
8) on 8 grades of shift registers.From left to right at different levelsly be numbered the 0th to the 7th grade.Ciphering process comprises move to right feedback and the two kinds of feedback systems of feedback that move to left shown in Fig. 4 structure shown in Fig. 3 structure.
Application person can be according to wish regulation wheel number and the every feedback umber of beats (promptly reverberating amplitude) of taking turns of oneself, such as regulation wheel number be 4 and every feedback umber of beats of taking turns be followed successively by 7,5,6,5.Its encryption flow is: 8 byte clear datas are put into successively shifting memory Q ' the 0th to 7 grade, by Fig. 3 logic the Q ' feedback 7 that moves to right is earlier clapped, by Fig. 4 logic Q ' is moved to left again and feed back 7 bats, by Fig. 3 logic Q ' is moved to right again and feed back 5 bats, by Fig. 4 logic Q ' is moved to left again and feed back 5 bats, clap, move to left and feed back 6 bats by Fig. 3, Fig. 4 logic shift right feedback 6 respectively again, clap by Fig. 3, Fig. 4 logic shift right feedback 5 feedback 5 of clapping, move to left respectively again, then 8 byte status of the shift register Q ' that obtains are exported as ciphertext.
The block encryption situation of " playing on a swing " formula in the time of in like manner, also can designing grouping block and be 96 bits or 160 bits.
In the inventive method, presetting of S box is extremely important part, and because of its operation is undertaken by a byte, promptly 8 bits advance 8 than outstanding, so the S box is the 256 yuan of permutation tables (28=256) that preset by key.It is as follows that it presets step:
1) if. key length is less than 32 bytes, earlier it is filled through circulation that to derive from is 32 bytes, and is the 0th to 31 with this 32 byte number;
2). the 0th to 31 byte key symbol self left side circulation string is moved 1 constitute the 32nd to the 63rd byte key, the the 32nd to 63 byte key symbol self left side circulation string is moved 1 constitute the 64th to the 95th byte key, ..., the rest may be inferred, until deriving the 224th to 255 byte key, and this 256 byte key correspondence put into key array location Key[0]-Key[255], any key array location of establishing wherein is Key[i];
3). conversion array S[0 is set]-S[255], and they initially are predisposed to numerical value 0-255 respectively, any conversion array of establishing wherein is S[i], make that m is a mnemon, and initially preset m=0, then, i=0 to 255 is done following operation:
Be worth to the m tax is new: m ← (m+Key[i]+s[i]) mod 256;
Exchange S[m] and S[255-i];
Exchange S[i] and S[255-m];
Circulation string in a m left side moves one;
}
Through the resulting S[0 of aforesaid operations]-S[255] be the set S box of this key device, obvious S[0]-S[255] be a reversible substitution table.
Be that 16 system symbols " 61 62 63 64 65 66 67 68 69 6a " are example with key below, be that keyboard is imported the eight ascii character a b c d e f g h i j of unit, provide by encrypting one group of basic process and intermediate object program expressly under the 128 bit groupings situations.
At first generate the S box.
It is 32 bytes that 10 byte key rotation are derived from, i.e. " 61 62 63 64 65 66 67 68 69 6a61,62 63 64 65 66 67 68 69 6a, 61 62 63 64 65 66 67 68 69 6a 61 62 ";
Then the S box is done 2 * 256=512 time transposition, every transposition 64 times moves one with 32 byte keys left side circulation string, and promptly the highest order feedback shift of each byte is to the lowest order of this byte, the S[0 of Sheng Chenging at last]-S[255] be:
e5?a7?eb?a0?63?7e?c2?e4?d0?4e?f5?e1?41?0e?73?1c
c1?a6?99?c7?fe?03?4f?5a?da?ce?64?71?45?d6?00?6a
ee?f7?e9?c6?52?d4?7b?bc?48?2d?56?6d?a8?a4?93?20
6f?36?85?46?9d?67?96?c5?22?1d?19?ef?c8?27?b5?97
9f?82?ae?75?3f?bf?b2?d7?87?ac?76?42?0f?2e?e7?79
50?3c?7f?0d?b6?fd?21?13?e8?8b?a3?b4?f6?dc?fa?b3
91?06?26?8f?30?5e?f3?54?2c?3b?61?65?cc?15?2a?35
83?5d?6b?8d?aa?f4?bb?ed?77?cb?f8?47?32?04?e0?24
db?1f?fb?cd?b8?07?34?88?12?44?0b?55?72?94?a2?7c
ca?d5?ea?33?9a?9e?c4?d3?ab?0c?a1?cf?70?d9?f9?6e
4c?05?23?09?4b?5c?74?17?ec?de?02?49?f2?80?c3?af
86?18?d1?f0?bd?89?53?78?28?4d?40?c0?8a?51?7d?60
68?4a?d8?37?10?e6?e2?dd?3a?69?98?62?b9?7a?c9?90
df?6c?5b?57?92?a9?d2?b7?43?84?2b?ad?39?16?08?11
95?ff?29?ba?8e?9b?31?25?a5?b0?fc?01?38?66?59?3e
e3?8c?f1?be?1e?0a?b1?2f?1b?3d?81?9c?5f?14?58?1a。
Represent expressly, to represent ciphertext with P with C with the intermediate object program that T and U represent shift register.When the plaintext of representing with 16 systems when " 61 62 63 64 65 66 67 68 69 6a 6b 6c 6d 6e 6f 70 ", by change procedure expressly be to ciphertext:
Plaintext P=(61 62 63 64 65 66 67 68 69 6a 6b 6c 6d 6e 6f 70);
Clap by Fig. 1 structure feedback 10 that moves to right
P’＝(67?68?61?62?63?64?65?66?5f?d2?d3?a3?47?4f?52?ad)；
Clap by Fig. 2 structure feedback 10 that moves to left
T＝(bc?8f?26?2e?4a?89?5c?4f?d3?a3?47?4f?52?ad?5f?d2)；
Clap by Fig. 1 structure feedback 9 that moves to right
T’＝(4f?bc?8f?26?2e?4a?89?5c?eb?7f?b3?fa?73?5c?bb?32)；
Clap by Fig. 2 structure feedback 9 that moves to left
U＝(aa?44?5f?54?5c?3a?a7?32?7f?b3?fa?73?5c?bb?32?eb)；
Clap by Fig. 1 structure feedback 8 that moves to right
C’＝(aa?44?5f?54?5c?3a?a7?32?69?ba?ae?8b?96?a9?5b?41)；
Clap by Fig. 2 structure feedback 8 that moves to left, ciphertext
C＝(98?a9?eb?e0?87?6b?67?c7?69?ba?ae?8b?96?a9?5b?41)。
The block encryption generative process of " playing on a swing " of the present invention formula, be easy to realize with software programming, when for example using the C Programming with Pascal Language, when setting the wheel number is 3, the umber of beats that moves to right and move to left of each wheel is respectively under 10,9,8 the situation, encryption/decryption speed can reach 230Mb/s on the PIII500 microcomputer, required memory cell quantity not sufficient 300 bytes, be that the S box takies 256 bytes, actual 32 bytes that take of key symbol, and these 32 byte spaces also can be used for shift register state and intermediate object program storage after generating the S box.
The inventive method, by fundamental analysis to key avalanche effect and plaintext avalanche effect, the performance that it has good opposing key correlation attack, linear attack and differential attack is described, except have safety, fast, be easy to the characteristics such as realization, its the most outstanding characteristics are that algorithm logic is simple for structure, rigorous, can implement mixing and diffusion expressly effectively.
The encryption method of block cipher of " playing on a swing " of the present invention formula, faster than famous algorithms such as RIJNDAEL, MARS, TWOFISH, the logical construction of algorithm is more succinct than them aspect encryption/decryption speed, and is easy to the program realization, also is well suited for realizing on microchip.
Claims (6)
1. encryption method of block cipher is characterized in that comprising following treatment step:
A. clear data is divided into expressly group by every group of M byte, M is an even number;
B., key K is set, and forms 256 yuan substitution table S box by key K;
C., a Z/ (2 is set
8) M level shift register on the ring, the M byte is expressly organized the data correspondence insert in the M level shift register;
D. feedback moves to right, at different levels with M level shift register by the 0th grade of left-to-right number consecutively, the 1st grade, ..., the M-1 level, the half of displacement mode in a left side is with 1 grade of former the 0th grade content feed to the, 2 grades of former the 1st grade content feed to the, ..., the content feed of former M/2-2 level is to the M/2-1 level, 0 grade of the content feed to the of former M/2-1 level, right half of displacement mode is that content feed with former M/2 level is to the M/2+1 level, the content feed of former M/2+1 level is to the M/2+2 level, ..., the content feed of former M-2 level is to the M-1 level, the replacement value of gained and the content of former M-1 level behind the content process S box of former M/2 level, content three's addition of former M/2-1 level, again to digital-to-analogue 256 after feed back to the M/2 level, by the displacement amplitude j that is provided with, the M level that moves to right shift register j is altogether clapped;
E. feedback moves to left, at different levels with M level shift register by the 0th grade of left-to-right number consecutively, the 1st grade, ..., the M-1 level, right half of displacement mode is that content feed with former M/2+1 level is to the M/2 level, the content feed of former M/2+2 level is to the M/2+1 level, ..., the content feed of former M-1 level is to the M-2 level, the content feed of former M/2 level is to the M-1 level, the half of displacement mode in a left side is that content feed with former M/2-1 level is to the M/2-2 level, the content feed of former M/2-2 level is to the M/2-3 level, ..., 0 grade of former the 1st grade content feed to the, the content of former M/2-1 level through the S box after replacement value and former the 0th grade content and content three's addition of former M/2 level of gained, again to digital-to-analogue 256 after feed back to the M/2-1 level, by the displacement amplitude j that is provided with, the M level that moves to left shift register j is altogether clapped;
F. repeated execution of steps D, E stop when number is taken turns in default moving to right and move to left until reaching;
G. the M level shift register content conduct after will stopping to be shifted is to the resulting ciphertext group of this plaintext group encryption.
2. method according to claim 1 is characterized in that: described M value is 8,12,16 or 20, and pairing grouping size is respectively 64 bits, 96 bits, 128 bits and 160 bits.
3. method according to claim 1 is characterized in that: described step B further comprises following treatment step:
B1. in the length of set key K during less than 32 bytes, earlier its circulation being derived from is 32 bytes, is labeled as the 0th to the 31st byte;
B2. the 0th to the 31st byte key symbol self left side circulation string is moved 1, the higher bit that is about to each character moves on to lowest order, constitute the 32nd byte to the 63 byte keys, again the 32nd byte to the 63 byte keys symbol self left side circulation string is moved 1, constitute the 64th byte to the 95 byte keys, carry out this step continuously until the key that forms 256 byte lengths;
B3. set up and be numbered 0 to 255 key array location, the key of 256 byte lengths is put a byte by every array location, order is put into array location successively;
B4. set up and be numbered 0 to 255 conversion array location, and its numerical value is changed to 0 to 255 respectively;
B5. set up a mnemon m and a counting unit i, and the initial value of agreement m is 0, with the content in the i counting unit is that number in the current key array location and the number in the current conversion array location are found in the address, the value three of they and mnemon m added and, and to this and digital-to-analogue 256 backs new values as mnemon m;
B6. by the new value of the m that is numbered i among the step b5 and acquisition, be that numerical value in the unit of m and address are the exchange of values in the 255-i unit with address in the conversion array location, with address in the conversion array location be numerical value in the i unit and address be 255-m the unit in exchange of values;
B7. the new value left side circulation string of the mnemon m that step b5 is obtained moves one;
B8. repeated execution of steps b5, b6, b7 expire 255 until the value that makes counting unit i by 0, constitute 256 yuan substitution table S box by the conversion array location at last.
4. method according to claim 1 is characterized in that: among described step D, the E through the S box, be according to the conversion array location of S box input value inquiry with this value number, and with the numerical value in this conversion array location as output valve.
5. method according to claim 1 is characterized in that: among described step D, the E, described respectively move to right and the conversion that moves to left in, displacement amplitude j is the natural number that is no less than M/2 that presets arbitrarily.
6. method according to claim 1 is characterized in that: in the described step F, the described wheel number that moves to right and move to left is not less than 2.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB011404752A CN1190034C (en) | 2001-12-10 | 2001-12-10 | Swing type block code enciphering method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB011404752A CN1190034C (en) | 2001-12-10 | 2001-12-10 | Swing type block code enciphering method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1426191A CN1426191A (en) | 2003-06-25 |
| CN1190034C true CN1190034C (en) | 2005-02-16 |
Family
ID=4675894
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB011404752A Expired - Fee Related CN1190034C (en) | 2001-12-10 | 2001-12-10 | Swing type block code enciphering method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN1190034C (en) |
Families Citing this family (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7130427B2 (en) * | 2003-07-17 | 2006-10-31 | Motorola, Inc. | Method for providing point-to-point encryption in a communication system |
| CN100534030C (en) * | 2005-10-17 | 2009-08-26 | 浙江大学 | Output-cryptograph mixed feedback chaos stream cipher encrypting and decrypting method |
| CN101013938B (en) * | 2007-01-12 | 2010-04-07 | 广州市诚毅科技软件开发有限公司 | Encryption method of block cipher |
| CN101257383B (en) * | 2008-03-28 | 2010-06-09 | 中国科学院软件研究所 | Method for detecting fast S kit transparent steps |
| CN101420295B (en) * | 2008-12-01 | 2011-11-16 | 刘江海 | Ciphering method for bit reassigning and mutual replacing on different positions of the same byte |
| CN101923802B (en) * | 2009-06-12 | 2012-05-23 | 中国科学院数据与通信保护研究教育中心 | Sequential cipher realization method and device |
| US8400676B2 (en) * | 2009-09-30 | 2013-03-19 | Konica Minolta Laboratory U.S.A., Inc. | In place line splitting process and method for multiple beam printers |
| CN101719823B (en) * | 2009-10-30 | 2012-07-11 | 中国科学院软件研究所 | Method for realizing linear transformation of S-box |
| CN103825723B (en) * | 2014-01-24 | 2019-05-03 | 深圳市太和物联信息技术有限公司 | A kind of encryption method and device |
| CN106100826B (en) * | 2016-06-08 | 2019-06-07 | 大唐微电子技术有限公司 | A kind of data conversion method and device |
-
2001
- 2001-12-10 CN CNB011404752A patent/CN1190034C/en not_active Expired - Fee Related
Also Published As
| Publication number | Publication date |
|---|---|
| CN1426191A (en) | 2003-06-25 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US7190791B2 (en) | Method of encryption using multi-key process to create a variable-length key | |
| CN101237321B (en) | Encryption method based on cycle queue shift rule | |
| CN1914590A (en) | Pseudo random number generation device and pseudo random number generation program | |
| CN1801693A (en) | Short block processing method in block encryption algorithm | |
| CN1190034C (en) | Swing type block code enciphering method | |
| CN1527531A (en) | Method of realizing data enciphering standard or double data enciphering standard | |
| CN1636343A (en) | Cryptographic communication process and apparatus | |
| CN1168041A (en) | Encryption/decryption method and encryption/decryption apparatus | |
| CN1241352C (en) | Encryption method for information in binary code | |
| CN112199696B (en) | Encryption and decryption method based on white-box block cipher | |
| CN1423451A (en) | Enciphered key based on time | |
| CN1523810A (en) | Method of designing optimum encryption function and optimized encryption apparatus in a mobile communication system | |
| CN1536810A (en) | Pseudo-random arragnement method for producing word formed from N digit figures | |
| CN1281023C (en) | Method for block-encryption of discrete data | |
| CN100589380C (en) | Encryption method based on double-circular queue shift and transposition rule | |
| CN1677921A (en) | Method for enciphering data through programmable device | |
| CN1560823A (en) | Data encipher and decipher system based on dynamic variable-length code | |
| CN1180351C (en) | Encrypting method for reinforcing disordered block cipher | |
| CN1759563A (en) | Device, method, and program for random number generation, encryption, and decryption, and recording medium | |
| CN1826753A (en) | Secret-key-controlled reversible circuit and corresponding method of data processing | |
| CN111314270B (en) | Data encryption and decryption method based on validity period uniform distribution symmetric algorithm | |
| CN107493164B (en) | DES encryption method and system based on chaotic system | |
| CN114244489B (en) | Image encryption method based on radial diffusion | |
| CN1286855A (en) | Cryptographic conversion of binary data blocks | |
| CN1694397A (en) | Method and device for constructing sequential cipher |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| 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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20050216 Termination date: 20161210 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |