CN101420295B - Ciphering method for bit reassigning and mutual replacing on different positions of the same byte - Google Patents
Ciphering method for bit reassigning and mutual replacing on different positions of the same byte Download PDFInfo
- Publication number
- CN101420295B CN101420295B CN2008102177852A CN200810217785A CN101420295B CN 101420295 B CN101420295 B CN 101420295B CN 2008102177852 A CN2008102177852 A CN 2008102177852A CN 200810217785 A CN200810217785 A CN 200810217785A CN 101420295 B CN101420295 B CN 101420295B
- Authority
- CN
- China
- Prior art keywords
- byte
- bit
- assignment
- value
- call
- 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
- Compression, Expansion, Code Conversion, And Decoders (AREA)
- Storage Device Security (AREA)
Abstract
The present invention provides an encryption method of deassign and interchange of bits at different positions on a byte. The method comprises the steps of bit deassign, deassign parameter generation, interchange parameter generation, correlation parameter combination and the like. Concretely, the method comprises the steps of performing deassign to bits at a certain position on correlation byte coding of file data to generate deassign parameters, after the deassign process, parts of bit values of the original coding changing, while parts of bit values of the original coding not changing, interchanging the positions of a certain of bits in the byte coding, after the interchange parameter generation process is ended, total quantity of the generated interchange parameter is smaller than that of the original file data, therefore, an encryption file being completely formed by combining the deassign parameters for reaching an aim of encryption.
Description
[technical field]
The present invention relates to microcomputer data processing, relate in particular to the technology of computer data enciphering.
[background technology]
Traditional displacement method is exactly with the alphabetical ring shift left certain position in the plaintext alphabet, constitute the ciphertext alphabet, the exchange process of this password is exactly that position subscript with the letter in the plaintext alphabet is transformed to numeral, carry out add operation with secret key, its result is as the position subscript of the letter in the ciphertext alphabet, and the corresponding letter in this position is the ciphertext letter.The des encryption standard adopts block cipher system, the hybrid operation that password repeatedly is shifted and substitutes exactly, and its process mainly is that 64 clear packets are carried out initial permutation, is divided into left and right sides two parts then and carries out cyclic shift and conversion, forms ciphertext at last.
[summary of the invention]
The objective of the invention is the bit encryption method of assignment, mutual alternative again by diverse location on a kind of byte, original file data is through bit steps such as assignment, call by value parameter generation, alternative parameter generation, relevant parameter merging again, conversion generates call by value parameter and alternative parameter, the alternative parameter that generates is less than original file data on total amount, must and the call by value parameter common combination, could form encrypt file, thereby reach the purpose of encryption.
In order to solve the problems of the technologies described above, the technical solution adopted in the present invention is: the bit that diverse location on a kind of byte is provided is assignment again, the encryption method of mutual alternative, this method may further comprise the steps: bit is assignment again, call by value parameter generates, alternative parameter generates, relevant parameter merges, through bit assignment again, call by value parameter generates, alternative parameter generates, steps such as relevant parameter merging, a certain locational bit to associated byte coding in the file data carries out again the assignment processing successively, generate call by value parameter, bit is after assignment is handled again, the bit value of part original coding changes, the bit value of part original coding does not change, the arrangement position of some bits in byte of these codings passes through mutual alternative again, after the alternative parameter generative process finishes, the alternative parameter that generates is less than original file data on total amount, must and the call by value parameter common combination, could form encrypt file, thereby reach the purpose of encryption.
According to a method for optimizing of the present invention, in the process of bit assignment again, require the arrangement position at the selected bit of handling of while place in each byte identical, then, successively each byte code the 1st locational bit value in the file data is carried out assignment analysis and processing, judge whether this locational bit value is 0, if be 0, this locational bit value remains unchanged, if be 1, will carry out assignment to this locational bit value handles, making its numerical value is 0, bit assignment incident again can be represented by generating call by value parameter, call by value parameter is 1 byte, 8 bits on the call by value parameter byte are just in time corresponding one by one to carry out in 8 bytes that assignment handles the 1st locational bit in each byte simultaneously, then, the arrangement position of some bits in byte of the coding that will generate after will handling through bit assignment again rearranges, the tactic mode of normal alignment according to the original position of bit in byte and the adjacent byte, the bit of diverse location between the bit of diverse location in the single byte and the byte that is relative to each other is carried out mutual alternative to be handled, after the process that alternative parameter generates finishes, the alternative parameter that generates is less than the data volume of original document on the byte total amount, at last, the alternative parameter byte of generation and the call by value parameter byte of generation are made up, form encrypt file.
According to a method for optimizing of the present invention, in the process of bit assignment again, require all right difference of arrangement position at the selected bit of handling place in each byte simultaneously, bit value to each byte code in the file data on the identical or diverse location is carried out assignment analysis and processing, the standard of judging this locational bit value can also be 1, and the mode that the arrangement position of some bits in byte of the coding that will generate after will handling through bit assignment again rearranges can also have multiple.
The invention has the beneficial effects as follows: the bit by diverse location on a kind of byte of the present invention is assignment again, the encryption method of mutual alternative, through bit assignment again, call by value parameter generates, alternative parameter generates, steps such as relevant parameter merging, a certain locational bit to associated byte coding in the file data carries out again the assignment processing successively, generate call by value parameter, bit is after assignment is handled again, the bit value of part original coding changes, the bit value of part original coding does not change, the arrangement position of some bits in byte of these codings passes through mutual alternative again, after the alternative parameter generative process finishes, the alternative parameter that generates is less than original file data on total amount, must and the call by value parameter common combination, could form encrypt file, thereby reach the purpose of encryption.
[description of drawings]
Fig. 1 is an operation principle schematic flow sheet of the present invention.
[embodiment]
The invention will be further described below in conjunction with drawings and Examples.
Fig. 1 is an operation principle schematic flow sheet of the present invention, mainly may further comprise the steps: step 11 bit is assignment again, and step 13 call by value parameter generates, and step 15 alternative parameter generates, and step 17 relevant parameter merges.
Technology path of the present invention comprises bit assignment 11 again, call by value parameter generates 13, alternative parameter generates 13, steps such as relevant parameter merging 17, by these steps, the a certain locational bit of associated byte coding in the file data is carried out again the assignment processing, in the process of carrying out the assignment processing, make the position of these associated byte codings and the position of some bit of byte code thereof set up inherent contact each other, this inner link can be finished by multiple Mathematical Modeling, when finishing dealing with, assignment generates call by value parameter, bit is after assignment is handled again, the bit value of part original coding changes, the bit value of part original coding does not change, the arrangement position of some bits in byte of these codings passes through mutual alternative again, after the alternative parameter generative process finishes, the alternative parameter that generates is less than original file data on total amount, must and the call by value parameter common combination, could form encrypt file.
Step 11: bit is assignment again
Requirement according to technical solution of the present invention, said bit is assignment again, be exactly according to certain rules, some locational bit of some associated byte coding in the initial data is carried out again the assignment processing, making its bit value is 0 or 1 by 1 or 0 assignment, for instance, with the bit that is in the 1st position in one group of each byte of initial data assignment again, every bit value is that 1 equal assignment is 0, perhaps every bit value is that 0 equal assignment is 1, after the assignment processing, each byte the 1st locational bit value is 0 or 1, because " each byte the 1st locational bit value is 0 or 1 " this feature has clear regularity, can reappear technically, controlled, this is just for the invention provides technical assurance.
According to the claim of technical solution of the present invention, in the process of bit assignment again, " if quantity be in the some groups of bytes of 8 or 8 multiple on the associated byte bit value of assigned address be 1, can be 0 with its assignment simultaneously." in the process of bit assignment again; be according to the encipherment scheme that pre-establishes; successively a certain locational bit value of each byte code in the file data is carried out assignment analysis and processing, judge whether this locational bit value is 0, if be 0; this locational bit value remains unchanged; if be 1, will carry out assignment to this locational bit value and handle, making its numerical value is 0; otherwise, also can be by that analogy.Bit assignment processing again may cause the original coding of each byte to change.Technical scheme requirement of the present invention, when bit assignment again finished, the byte code that numerical value change takes place and numerical value change do not take place all constituted the foundation of alternative parameter generation.Bit assignment incident again can be represented by generating a call by value parameter, call by value parameter is 1 byte, bit value 1 or 0 on the call by value parameter byte diverse location is used for representing the original coding generation numerical value change of the byte that needs are handled or the different conditions of numerical value change, the foundation that this two states all generates as call by value parameter does not take place.
Why the present invention is divided into file data byte quantity is 8 some groups of bytes, be because according to specification requirement of the present invention, when the step of bit assignment again finishes, need to generate a call by value parameter, can the regulation call by value parameter be a byte, require the coding of parameter to comprise the information whether locational bit value that is relative to each other on 8 bytes of carrying out the assignment processing simultaneously changes.A byte is made up of 8 bits, carries out certain bit on each byte in 8 bytes that assignment handles simultaneously as 8 bits on the call by value parameter byte are just in time corresponding one by one.Why the present invention can also be divided into file data the some groups of bytes that one group of byte quantity is 8 multiple, be because in this state, 8 bits on the call by value parameter byte can satisfy the bit that is relative to each other on the associated byte of 8 multiple according to the corresponding each interval distance of 8 multiple, make theme: be certain bit on each byte in equally just in time corresponding one by one 8 bytes of 8 bits on the call by value parameter byte.Certainly, one group of data of corresponding 8 the byte multiples of 8 bits on the call by value parameter byte relatively with one group of data of corresponding 8 bytes, its computing is complexity more.The present invention understands for simplicity, only is illustrated at corresponding 8 these situations of byte of 8 bits on the call by value parameter byte.
According to the claim of technical solution of the present invention, in the process of bit assignment again, " if quantity be in the some groups of bytes of 8 or 8 multiple on the associated byte bit value of assigned address be 0, can be 1 with its assignment simultaneously ".Therefore; in bit assignment treatment step again; making bit value that need to handle is 0 concrete grammar and the pertinent regulations followed thereof by 1 assignment; go for making the bit value that needs to handle to be replaced by 1 way and supporting with it pertinent regulations thereof equally, equally in protection scope of the present invention by 0 assignment.This specification is not just described one by one.
Claim according to technical solution of the present invention, in the process of bit assignment again, " carry out bit simultaneously again on the associated byte in one group of byte handling of assignment, the arrangement position at the selected bit of handling place in each byte is identical " or " the arrangement position difference at the selected bit of handling place in each byte." data handled with needs are that 8 bytes describe:
It is as follows to set up one group of byte code formula:
A?(A1A2A3A4A5A6A7A8)?B?(B1B2B3B4B5B6B7B8)?C?(C1C2C3C4C5C6C7C8)
D?(D1D2D3D4D5D6D7D8)?E?(E1E2E3E4E5E6E7E8)?F?(F1F2F3F4F5F6F7F8)
G?(G1G2G3G4G5G6G7G8)?H?(H1H2H3H4H5H6H7H8)
Wherein:
A, B, C, D, E, F, G, H represent byte, A1-A8, B1-B8, C1-C8, D1-D8, E1-E8, F1-F8, G1-G8, H1-H8 represent tactic bit among byte A, B, C, D, E, F, G, the H respectively, and 1-8 represents the position of bit in byte; Byte A is made up of bit A 1-A8, be that A1 is the 1st locational bit of byte A, and the like, A8 is the 8th locational bit of byte A, and the like, byte H is made up of bit H1-H8, and promptly H1 is the 1st locational bit of byte H, and the like, H8 is the 8th locational bit of byte H.
Above-mentioned byte code is simplified, is then formed one group of byte code of simplifying:
A1A2A3A4A5A6A7A8?B1B2B3B4B5B6B7B8?C1C2C3C4C5C6C7C8?D1D2D3D4D5D6D7D8
E1E2E3E4E5E6E7E8?F1F2F3F4F5F6F7F8?G1G2G3G4G5G6G7G8?H1H2H3H4H5H6H7H8
Carrying out assignment now handles, be defined in the assignment processing, the arrangement position at the selected bit of handling place in each byte is identical, therefore, can require the numerical value assignment of first bit of each byte, after the processing of bit assignment again, the numerical value of the bit A 1 of the 1st position, B1, C1, D1, E1, F1, G1, H1 is 0 on above-mentioned one group of each byte of byte code of simplifying, then forms the byte code of the simplification of one group of assignment processing:
01A2A3A4A5A6A7A8?01B2B3B4B5B6B7B8?01C2C3C4C5C6C7C8?01D2D3D4D5D6D7D8
01E2E3E4E5E6E7E8?01F2F3F4F5F6F7F8?01G2G3G4G5G6G7G8?01H2H3H4H5H6H7H8
If be defined in the assignment processing, the arrangement position difference at the selected bit of handling place in each byte, so, can require on the 1st position on the A byte, the B byte on the 2nd position, the C byte on the 3rd position, the D byte on the 4th position, the E byte on the 5th position, the F byte on the 6th position, the G byte on the 7th position, the H byte bit of the 8th position assignment again, after the processing of bit assignment again, above-mentioned one group of byte code of simplifying then forms the byte code of the simplification of other one group of assignment processing:
01A2A3A4A5A6A7A8?B102B3B4B5B6B7B8?C1C203C4C5C6C7C8?D1D2D304D5D6D7D8
E1E2E3E405E6E7E8?F1F2F3F4F506F7F8?G1G2G3G4G5G607G8?H1H2H3H4H5H6H708
It is pointed out that the arrangement position difference at the selected bit of handling place in each byte, its ciphering process is complicated more, cracks difficulty and also strengthens thereupon.This specification is not just described one by one.
The bit detailed process of assignment again is as follows:
The binary coding of the file data byte of picked at random is as follows:
01010010 01100001 01110010 00100001 00011010 00000111 00000000
11001111
10010000 01110011 00000000 00000000 00001101 00000000 00000000
00000000
00000000 00000000 00000000 00000000 11011101 00101011 01110100
11000000
10000010 00110011 00000000 00001110 11011100 01000010 00000000
00111000
Requirement in above-mentioned data being carried out the bit process that assignment is handled again, identical and the 1st position on each byte of the arrangement position at the selected bit of handling place in each byte.
Above-mentioned file data 4 row 8 row, total byte adds up to 32, wherein, coding the 1st locational bit value is 1 byte the 8th byte that comprises the 1st row, the 1st byte of the 2nd row, the 5th, 8 bytes of the 3rd row, the 1st, 5 bytes of the 4th row in the byte, and coding the 1st locational bit value is 0 in all the other bytes.
Now, coding to above-mentioned byte carries out the assignment processing, the 1st row the 8th byte be encoded to 11001111, its the 1st locational bit value is 1, bit assignment processing again is 0 with this locational bit value assignment exactly, after assignment is handled, the original coding of the 1st row the 8th byte changes, its numerical value is adjusted into 01001111, the 1st row 1-7 byte code is respectively 01010010,01100001,01110010,00100001,00011010,00000111,00000000, its byte the 1st locational bit value is 0, need not to carry out assignment and handles, and the original coding of its byte remains unchanged.
And the like, after the processing of bit assignment again, the binary coding of the file data byte of above-mentioned picked at random changes as follows:
01010010 01100001 01110010 00100001 00011010 00000111 00000000
01001111
00010000 01110011 00000000 00000000 00001101 00000000 00000000
00000000
00000000 00000000 00000000 00000000 01011101 00101011 01110100
01000000
00000010 00110011 00000000 00001110 01011100 01000010 00000000
00111000
After the processing through bit assignment again, above-mentioned file data still is 4 row, 8 row, total byte adds up to still 32, but, the binary-coded the 1st locational bit value of all files data byte after changing is 0, and this realization that just generates step in the future alternative parameter provides the foundation of technical feasibility.
If require in above-mentioned data being carried out the bit process that assignment is handled again, the arrangement position difference at the selected bit of handling place in each byte, require on each row the 1st byte on the 1st position, the 2nd byte on the 2nd position, the 3rd byte on the 3rd position, the 4th byte on the 4th position, the 5th byte on the 5th position, the 6th byte on the 6th position, the 7th byte on the 7th position, the 8th byte bit of the 8th position assignment again, after the processing of bit assignment again, the binary coding of the file data byte of above-mentioned picked at random changes as follows:
01010010 00100001 01010010 00100001 00010010 00000011 00000000
11001110
00010000 00110011 00000000 00000000 00000101 00000000 00000000
00000000
00000000 00000000 00000000 00000000 11010101 00101011 01110100
11000000
00000010 00110011 00000000 00001110 11010100 01000010 00000000
00111000
As can be seen, the arrangement position at the selected bit of handling place in each byte is identical and different, and the bit result of the code change handled of assignment again is different fully.
Step 13: call by value parameter generates
Requirement according to technical solution of the present invention, said call by value parameter generates, just be meant in the process of bit assignment again, will according to certain locational bit of byte code whether again this incident of assignment produce corresponding with it some instructions, these instructions are called call by value parameter, call by value parameter can be a byte, 8 bits of this byte are the bit on the some ad-hoc locations in each byte in 8 bytes in the respective file data one by one, and whether the bit on the some ad-hoc locations in each byte in 8 bytes in the bit value on the call by value parameter byte diverse location (0 or 1) expression and its corresponding file data assignment incident again takes place in the process of bit assignment again.Therefore, bit whether again this incident of assignment be the foundation that call by value parameter generates.If the bit on some ad-hoc locations of a certain byte in 8 bytes in the file data is assignment again, bit assignment in the call by value parameter byte on the corresponding with it ad-hoc location is 1 or 0, if the bit on some ad-hoc locations of a certain byte in 8 bytes in the file data is 0 originally, the bit assignment in the call by value parameter byte on the corresponding with it ad-hoc location is 0 or 1.
Claim according to technical solution of the present invention, in the call by value parameter generative process, " 1 bit of assigned address on per 1 byte in 8 bytes in the corresponding one by one one group of byte of 8 bits on the call by value parameter byte of generation, on per 1 byte in pairing 8 bytes on appointed bit and other 7 bytes appointed bit be relative to each other.", " in 8 bytes in the pairing one group of byte of any 1 bit in the call by value parameter byte on per 1 byte bit arrangement position at place in byte of the bit of assigned address appointment on the arrangement position at place in the byte and other byte identical " or " difference ".
The present invention's byte quantity that file data is divided into is 8 some groups of bytes, be because when the step of bit assignment again finishes, need to generate a call by value parameter, should comprise following information on this parameter: the arrangement position of bit on byte, again whether bit assignment.The call by value parameter that generates is a byte, carries out certain bit on each byte in 8 bytes that assignment handles simultaneously as 8 bits on the call by value parameter byte are just in time corresponding one by one.Meanwhile, require also on per 1 byte in pairing 8 bytes that appointed bit is relative to each other on the appointed bit and other 7 bytes, the relevance that these are relative to each other must can be expressed by multiple Mathematical Modeling technically.1 bit of assigned address on per 1 byte in 8 bytes in the corresponding one by one one group of byte of 8 bits on the call by value parameter byte that generates, its mode can have multiple: can be by on per 1 byte in corresponding one by one 8 bytes of 8 bits on the call by value parameter byte the 1st, 2,3,4,5,6, the 7 or the 8th locational bit, in this state, in 8 bytes in the pairing one group of byte of any 1 bit in the call by value parameter byte on per 1 byte bit arrangement position at place in byte of the bit of assigned address appointment on the arrangement position at place in the byte and other byte be identical; Also can be by the bit of the 1st position on the 1st byte in 8 bytes of bit correspondence of the 1st position on the call by value parameter byte, bit by the 2nd position on the 1st byte in corresponding 8 bytes of bit of the 2nd position on the call by value parameter byte, and the like, bit by the 8th position on the 1st byte in corresponding 8 bytes of bit of the 8th position on the call by value parameter byte, or the like, in this state, in 8 bytes in the pairing one group of byte of any 1 bit in the call by value parameter byte on per 1 byte bit arrangement position at place in byte of the bit of assigned address appointment on the arrangement position at place in the byte and other byte be different.
Claim according to technical solution of the present invention, in the call by value parameter generative process, " bit in the file data on the some ad-hoc locations of a certain byte is assignment again; bit assignment corresponding with it in the call by value parameter byte is 1 ", perhaps " bit in the file data on the some ad-hoc locations of a certain byte is assignment again, and bit assignment corresponding with it in the call by value parameter byte is 0 ".In the call by value parameter generative process, whether again the bit that allows call by value parameter has increased the difficulty that cracks of enciphered data with 0 or 1 two kind of different numerical expression bit this incident of assignment, therefore, belongs to protection scope of the present invention equally.This specification is not just described one by one.
The detailed process that call by value parameter generates is as follows:
Continuation is the example explanation with the binary coding of the file data byte of above-mentioned picked at random, and this coding is as follows:
01010010 01100001 0111001 000100001 00011010 00000111 00000000
11001111
10010000 01110011 00000000 00000000 00001101 00000000 00000000
00000000
00000000 00000000 00000000 00000000 11011101 00101011 01110100
11000000
10000010 00110011 00000000 00001110 11011100 01000010 00000000
00111000
Now, coding to above-mentioned byte carries out the processing that call by value parameter generates, require " bit is assignment again; bit assignment corresponding with it in the call by value parameter byte is 1 " simultaneously, in assignment procedure, the 1st byte code of the 1st row is 01010010, because its 1st locational bit value is 0, need not to carry out assignment handles, the original coding of its byte remains unchanged, the 1st locational bit is 0 in the corresponding with it call by value parameter byte that needs to generate, represent that the 1st locational bit value is not carried out the assignment processing in the 1st the 1st byte of going, the 2-7 byte code of the 1st row is respectively 01100001,01110010,00100001,00011010,00000111,00000000, because its 1st locational bit value is respectively 0 equally, also need not to carry out assignment handles, the original coding of its byte remains unchanged, the locational bit of 2-7 is similarly 0 in the corresponding with it call by value parameter byte that needs to generate, represent that the 1st locational bit value is not all carried out the assignment processing in the 1st 2-7 byte of going, the 8th byte code of the 1st row is 11001111, because its 1st locational bit value is 1, need carry out assignment handles, the original coding of its byte changes thereupon, the 8th locational bit is 1 in the corresponding with it call by value parameter byte that needs to generate, represent that the 1st locational bit value is carried out the assignment processing in the 1st the 8th byte of going, so far, at the bit of the 1-8 byte of the 1st row when the assignment processing finishes again, 1 call by value parameter byte of corresponding with it generation, this call by value parameter byte be encoded to 00000001.
And the like, the binary coding of the file data byte of corresponding above-mentioned 32 picked at random generates 4 call by value parameter bytes, and the coding of 4 call by value parameter bytes is as follows:
00000001 10000000 10001001 10001000
If the coding to above-mentioned byte carries out the processing that call by value parameter generates, require " bit is assignment again, and bit assignment corresponding with it in the call by value parameter byte is 0 " simultaneously, the coding of 4 call by value parameter bytes of generation is as follows:
10000000 0111111 01110110 01110111
Again in the assignment procedure, bit assignment corresponding with it in the call by value parameter byte is 0 or 1 to bit, and the call by value parameter of generation is different fully.
Step 15: alternative parameter generates
Requirement according to technical solution of the present invention, said alternative parameter generates, the arrangement position of some bits in byte of the coding that will generate after will handling through bit assignment again exactly rearranges, in the process that alternative parameter generates, can replace the bit value on the other ad-hoc location in this byte and other byte code with the bit value on some ad-hoc location in certain byte code, replace the coding that generates after arrangement is finished and be called alternative parameter, bit mutual alternative and the mutual alternative of the bit of the diverse location byte that be relative to each other between of above-mentioned arrangement by diverse location in the single byte realizes that the mode of realization has multiple.Special needs to be pointed out is no matter adopt which kind of mode, all will reach following target: after the process that alternative parameter generates finished, the alternative parameter of generation was less than original file data on the byte total amount.This is a technical characterictic of the present invention.Because after handling through bit assignment again, the bit value of last the 1st position of total data byte coding is 0, this mobile mutually replacement that clocklike is arranged as byte itself or byte and other byte bit value provides technical condition.Why treated byte code can rearrange combination in the step that alternative parameter generates in bit assignment step again, appearance based on following condition: the regularity that is arranged with the inherence of the position of some bit in the positional alignment of associated byte coding or the byte code in the file data, this regularity can repeat by the calculating of Mathematical Modeling to realize and the result that repeats to realize just the same, therefore, this rule can be controlled and operate fully.Bit assignment step has again realized that the bit value of the 1st position on the coding in treated whole byte is 0 specification requirement, call by value parameter generate step make bit again finishing of assignment step have regularity and operability, therefore, the alternative parameter generation step that is based upon on the above-mentioned technical conditions has just possessed technique guarantee.Further describe below.
Continuation is the example explanation with above-mentioned one group of byte code of simplifying:
A1A2A3A4A5A6A7A8?B1B2B3B4B5B6B7B8?C1C2C3C4C5C6C7C8?D1D2D3D4D5D6D7D8
E1E2E3E4E5E6E7E8?F1F2F3F4F5F6F7F8?G1G2G3G4G5G6G7G8?H1H2H3H4H5H6H7H8
Set up a set of coded bits positional alignment sequence number:
01?02?03?04?05?06?07?08?09?10?11?12?13?14?15?16?17?18?19?20?21?22?23?24
25?26?27?28?29?30?31?32?33?34?35?36?37?38?39?40?41?42?43?44?45?46?47?48
49?50?51?52?53?54?55?56?57?58?59?60?61?62?63?64
The one group of byte code simplified and a set of coded bits positional alignment sequence number are merged, set up one group of byte code bit position of simplifying table that puts in order:
A1
01A2
02A3
03A4
04A5
05A6
06A7
07A8
08 B1
09B2
10B3
11B4
12B5
13B6
14B7
15B8
16
C1
17C2
18C3
19C4
20C5
21C6
22C7
23C8
24 D1
25D2
26D3
27D4
28D5
29D6
30D7
31D8
32
E1
33E2
34E3
35E4
36E5
37E6
38E7
39E8
40 F1
41F2
42F3
43F4
44F5
45F6
46F7
47F8
48
G1
49G2
50G3
51G4
52G5
53G6
54G7
55G8
56 H1
57H2
58H3
59H4
60H5
61H6
62H7
63H8
64
In putting in order table, one group of byte code bit position of simplifying to see 01-64 the sequence number of representing by subscript, wherein, the sequence number of subscript 01 expression bit A 1 arrangement position, the sequence number of subscript 02 expression bit A 2 arrangement positions, and the like, the sequence number of the arrangement position of subscript 64 expression bit H8.
After the processing through bit of the present invention assignment again, the bit value of the 1st locational bit is 0 in each byte of byte code of one group of simplification, forms the byte code of the simplification of one group of assignment processing:
01A2A3A4A5A6A7A8?01B2B3B4B5B6B7B8?01C2C3C4C5C6C7C8?01D2D3D4D5D6D7D8
01E2E3E4E5E6E7E8?01F2F3F4F5F6F7F8?01G2G3G4G5G6G7G8?01H2H3H4H5H6H7H8
The byte code bit position that rebulids the simplification that one group of assignment the handles table that puts in order:
01
01A2
02A3
03A4
04A5
05A6
06A7
07A8
08 01
09B2
10B3
11B4
12B5
13B6
14B7
15B8
16
01
17C2
18C3
19C4
20C5
21C6
22C7
23C8
24 01
25D2
26D3
27D4
28D5
29D6
30D7
31D8
32
01
33E2
34E3
35E4
36E5
37E6
38E7
39E8
40 01
41F2
42F3
43F4
44F5
45F6
46F7
47F8
48
01
49G2
50G3
51G4
52G5
53G6
54G7
55G8
56 01
57H2
58H3
59H4
60H5
61H6
62H7
63H8
64
The bit value of the 1st position of each byte is 0 in the table because the byte code bit position of the simplification of one group of assignment processing puts in order, therefore, the byte code of the simplification that one group of assignment is handled carries out processing that suitable alternative parameter generates and just becomes and have controlled regularity and operability, can express by setting up relevant Mathematical Modeling, just the bit value on the other ad-hoc location provides technical conditions in this byte and other byte code in order to replace with the bit value on some ad-hoc location in certain byte code for this.
Carry out the processing that alternative parameter generates now.
According to the claim of technical solution of the present invention, in the process that alternative parameter generates, the mode of " mutual alternative of the bit of the diverse location in the single byte between the bit mutual alternative of diverse location and the byte that is relative to each other " has multiple:
1,, the bit of diverse location between the bit of diverse location in the single byte and the byte that is relative to each other is carried out mutual alternative handles according to the tactic mode of normal alignment of the original position of bit in byte and the adjacent byte:
This mode requires in the process that alternative parameter generates the bit position to arrange sequence number to remain unchanged according to former orderliness, and promptly a set of coded bits positional alignment sequence number is arranged as follows after the process that alternative parameter generates finishes:
01?02?03?04?05?06?07?08?09?10?11?12?13?14?15?16?17?18?19?20?21?22?23?24
25?26?27?28?29?30?31?32?33?34?35?36?37?38?39?40?41?42?43?44?45?46?47?48
49?50?51?52?53?54?55?56?57?58?59?60?61?62?63?64
Now, can be with the bit A in the A byte 2, A3, A4, A5, A6, A7, bit B2 in A8 and the B byte forms a new A byte, sequence arrangement successively, with the bit B3 in the B byte, B4, B5, B6, B7, bit C2 in B8 and the C byte, C3 forms a new B byte, with the bit C4 in the C byte, C5, C6, C7, D2 in C8 and the D byte, D3, D4 forms a new C byte, with the D5 in the D byte, D6, D7, the E2 of D8 and E byte, E3, E4, E5 forms a new D byte, with the E6 in the E byte, E7, the F2 of E8 and F byte, F3, F4, F5, F6 forms a new E byte, with the F7 in the F byte, G2 in F8 and the G byte, G3, G4, G5, G6, G7 forms a new F byte, with the H2 in G8 in the G byte and the H byte, H3, H4, H5, H6, H7, H8 forms a new G byte, because the bit 2-8 in the former H byte has all participated in the replacement of the bit value of new G byte, whole bit value in the newly-generated H byte are 0, at last, generate the coding of forming by alternative parameter:
A2A3A4A5A6A7A8A2?B3B4B5B6B7B8C2C3?C4C5C6C7C8D2D3D4?D5D6D7D8E2E3E4E5
E6E7E8F2F3F4F5F6?F7F8G2G3G4G5G6G7?G8H2H3H4H5H6H7H8?0?0?0?0?0?0?0?0
The corresponding therewith coded-bit positional alignment sequence list of being made up of alternative parameter is as follows:
A2
01A3
02A4
03A5
04A6
05A7
06A8
07A2
08 B3
09B4
10B5
11B6
12B7
13B8
14C2
15C3
16
C4
17C5
18C6
19C7
20C8
21D2
22D3
23D4
24 D5
25D6
26D7
27D8
28E2
29E3
30E4
31E5
32
E6
33E7
34E8
35F2
36F3
37F4
38F5
39F6
40 F7
41F8
42G2
43G3
44G4
45G5
46G6
47G7
48
G8
49H2
50H3
51H4
52H5
53H6
54H7
55H8
56 0
570
580
590
600
610
620
630
64
2, the mode of alternately arranging according to the normal alignment of the original position of bit in byte and the adjacent byte, the bit of diverse location between the bit of diverse location in the single byte and the byte that is relative to each other is carried out mutual alternative handle:
This mode requires in the process that alternative parameter generates the bit position to arrange sequence number alternately to arrange according to former orderliness, and promptly a set of coded bits positional alignment sequence number is arranged as follows after the process that alternative parameter generates finishes:
01?03?02?04?05?07?06?08?09?11?10?12?13?15?14?16?17?19?18?20?21?23?22?24
25?27?26?28?29?31?30?32?33?35?34?36?37?39?38?40?41?43?42?44?45?47?46?48
49?51?50?52?53?55?54?56?57?58?59?60?61?62?63?64
Wherein 57-64 sequence number remains unchanged.
The corresponding therewith coded-bit positional alignment sequence list of being made up of alternative parameter is as follows:
A2
01A4
03A3
02A5
04A6
05A8
07A7
06A2
08 B3
09B5
11B4
10B6
12B7
13C2
15B8
14C3
16
C4
17C6
19C5
18C7
20C8
21D3
23D2
22D4
24 D5
25D7
27D6
26D8
28E2
29E4
31E3
30E5
32
E6
33E8
35E7
34F2
36F3
37F5
39F4
38F6
40 F7
41G2
43F8
42G3
44G4
45G6
47G5
46G7
48
G8
49H3
51H2
50H4
52H5
53H7
55H6
54H8
56 0
570
580
590
600
610
620
630
64
3, the mode that puts in order and arrange according to the odd even of the original position of bit in byte and the adjacent byte, the bit of diverse location between the bit of diverse location in the single byte and the byte that is relative to each other is carried out mutual alternative handle:
This mode requires in the process that alternative parameter generates the bit position to arrange sequence number to arrange according to the odd number even number sequence of former orderliness, and promptly a set of coded bits positional alignment sequence number is arranged as follows after the process that alternative parameter generates finishes:
01?03?05?07?09?11?13?15?17?19?21?23?25?27?29?31?33?35?37?39?41?43?45?47
49?51?53?55?02?04?06?08?10?12?14?16?18?20?22?24?26?28?30?32?34?36?38?40
42?44?46?48?50?52?54?56?57?58?59?60?61?62?63?64
Wherein 57-64 sequence number remains unchanged.
The corresponding therewith coded-bit positional alignment sequence list of being made up of alternative parameter is as follows:
A2
01A4
03A6
05A8
07B3
09B5
11B7
13C2
15 C4
17C6
19C8
21D3
23D5
25D7
27E2
29E4
31
E6
33E8
35F3
37F5
39F7
41G2
43G4
45G6
47 G8
49H3
51H5
53H7
55A3
02A5
04A7
06A2
08
B4
10B6
12B8
14C3
16C5
18C7
20D2
22D4
24 D6
26D8
28E3
30E5
32E7
34F2
36F4
38F6
40
F8
42G3
44G5
46G7
48H2
50H4
52H6
54H8
56 0
570
580
590
600
610
620
630
64
4, arrange the mode of alternately arranging according to the odd even of the original position of bit in byte and the adjacent byte, the bit of diverse location between the bit of diverse location in the single byte and the byte that is relative to each other carried out mutual alternative handle:
This mode requires in the process that alternative parameter generates the bit position to arrange sequence number alternately to arrange according to the odd number even number order of former orderliness, and promptly a set of coded bits positional alignment sequence number is arranged as follows after the process that alternative parameter generates finishes:
01?03?05?07?02?04?06?08?09?11?13?15?10?12?14?16?17?19?21?23?18?20?22?24
25?27?29?31?26?28?30?32?33?35?37?39?34?36?38?40?41?43?45?47?42?44?46?48
49?51?53?55?50?52?54?56?57?58?59?60?61?62?63?64
Wherein 57-64 sequence number remains unchanged.
The corresponding therewith coded-bit positional alignment sequence list of being made up of alternative parameter is as follows:
A2
01A4
03A6
05A8
07A3
02A5
04A7
06A2
08 B3
09B5
11B7
13C2
15B4
10B6
12B8
14C3
16
C4
17C6
19C8
21D3
23C5
18C7
20D2
22D4
24 D5
25D7
27E2
29E4
31D6
26D8
28E3
30E5
32
E6
33E8
35F3
37F5
39E7
34F2
36F4
38F6
40 F7
41G2
43G4
45G6
47F8
42G3
44G5
46G7
48
G8
49H3
51H5
53H7
55H2
50H4
52H6
54H8
56 0
570
580
590
600
610
620
630
64
5, the mode that puts in order and arrange according to the equal difference of the original position of bit in byte and the adjacent byte, the bit of diverse location between the bit of diverse location in the single byte and the byte that is relative to each other is carried out mutual alternative handle:
This mode requires in the process that alternative parameter generates the bit position to arrange the equal difference ordering sequence arrangement of sequence number according to former orderliness, and promptly a set of coded bits positional alignment sequence number is arranged as follows after the process that alternative parameter generates finishes:
01?04?07?10?13?16?19?22?25?28?31?34?37?40?43?46?49?52?55?02?05?08?11?14
17?20?23?26?29?32?35?38?41?44?47?50?53?56?03?06?09?12?15?18?21?24?27?30
33?36?39?42?45?48?51?54?57?58?59?60?61?62?63?64
Wherein 57-64 sequence number remains unchanged.
The corresponding therewith coded-bit positional alignment sequence list of being made up of alternative parameter is as follows:
A2
01A5
04A8
07B4
10B7
13C3
16C6
19D2
22 D5
25D8
28E4
31E7
34F3
37F6
40G2
43G5
46
G8
49H4
52H7
55A3
02A6
05A2
08B5
11B8
14 C4
17C7
20D3
23D6
26E2
29E5
32E8
35F4
38
F7
41G3
44G6
47H2
50H5
53H8
56A4
03A7
06 B3
09B6
12C2
15C5
18C8
21D4
24D7
27E3
30
E6
33F2
36F5
39F8
42G4
45G7
48H3
51H6
54 0
570
580
590
600
610
620
630
64
6, arrange the mode of alternately arranging according to the equal difference of the original position of bit in byte and the adjacent byte, the bit of diverse location between the bit of diverse location in the single byte and the byte that is relative to each other carried out mutual alternative handle:
This mode requires in the process that alternative parameter generates the bit position to arrange sequence number alternately to arrange according to the equal difference ordering of former orderliness, and promptly a set of coded bits positional alignment sequence number is arranged as follows after the process that alternative parameter generates finishes:
01?04?07?02?05?08?03?06?09?10?13?16?11?14?17?12?15?18?19?22?25?20?23?26
21?24?27?28?31?34?29?32?35?30?33?36?37?40?43?38?41?44?39?42?45?46?49?52
47?50?53?48?51?54?55?56?57?58?59?60?61?62?63?64
Wherein 57-64 sequence number remains unchanged.
The corresponding therewith coded-bit positional alignment sequence list of being made up of alternative parameter is as follows:
A2
01A5
04A8
07A3
02A6
05A2
08A4
03A7
06 B3
09B4
10B7
13C3
16B5
11B8
14C4
17B6
12
C2
15C5
18C6
19D2
22D5
25C7
20D3
23D6
26 C8
21D4
24D7
27D8
28E4
31E7
34E2
29E5
32
E8
35E3
30E6
33F2
36F3
37F6
40G2
43F4
38 F7
41G3
44F5
39F8
42G4
45G5
46G8
49H4
52
G6
47H2
50H5
53G7
48H3
51H6
54H7
55H8
56 0
570
580
590
600
610
620
630
64
After the processing that generates through alternative parameter, above-mentioned coding generates one group of alternative parameter of being made up of 8 bytes, still, wherein last 1 byte be encoded to 0.Specification requirement of the present invention is, if in the total data, respectively there is the coding of a byte identical each other each other in the one group of byte that constitutes by several bytes, the put in order certain rules of this byte in one group of byte, this regularity can be expressed with Mathematical Modeling, and then this byte can be ignored.In illustrating, some groups of bytes are arranged, the quantity of each group byte is 8, after the processing through bit of the present invention assignment again and alternative parameter generation, must have the coding and the arrangement position thereof of 1 byte identical in each group byte in each group byte, this regularity necessarily can be expressed by Mathematical Modeling.Therefore, one group of alternative parameter of being made up of 8 bytes of above-mentioned coding generation can use the alternative parameter of one group of equivalence being made up of 7 bytes to express:
A2
01A5
04A8
07A3
02A6
05A2
08A4
03A7
06 B3
09B4
10B7
13C3
16B5
11B8
14C4
17B6
12
C2
15C5
18C6
19D2
22D5
25C7
20D3
23D6
26 C8
21D4
24D7
27D8
28E4
31E7
34E2
29E5
32
E8
35E3
30E6
33F2
36F3
37F6
40G2
43F4
38 F7
41G3
44F5
39F8
42G4
45G5
46G8
49H4
52
G6
47H2
50H5
53G7
48H3
51H6
54H7
55H8
56
For this reason, after processing through bit of the present invention assignment again and alternative parameter generation, one group of code conversion of being made up of 8 bytes becomes one group of coding of being made up of 7 bytes, realized that the alternative parameter of generation is less than the target of original file data on the byte total amount after the process that alternative parameter generates finishes.
The detailed process that alternative parameter generates is as follows:
Specifically illustrate as follows:
The binary coding of the file data byte of picked at random:
01010010 01100001 01110010 00100001 00011010 00000111 00000000
11001111
10010000 01110011 00000000 00000000 00001101 00000000 00000000
00000000
00000000 00000000 00000000 00000000 11011101 00101011 01110100
11000000
10000010 00110011 00000000 00001110 11011100 01000010 00000000
00111000
Above-mentioned file data 4 row 8 row, total byte adds up to 32.
Binary coding after the binary coding of the file data byte of picked at random is handled through bit assignment again changes as follows:
01010010 01100001 01110010 00100001 00011010 00000111 00000000
01001111
00010000 01110011 00000000 00000000 00001101 00000000 00000000
00000000
00000000 00000000 00000000 00000000 01011101 00101011 01110100
01000000
00000010 00110011 00000000 00001110 01011100 01000010 00000000
00111000
Above-mentioned file data 4 row 8 row, total byte adds up to still 32, and binary-coded the 1st bit value of all files data byte is 0.
Here, according to the tactic mode of normal alignment of the original position of bit in byte and the adjacent byte, the bit of diverse location between the bit of diverse location in the single byte and the byte that is relative to each other is carried out mutual alternative handles:
Analyze the 1st row binary coding earlier:
1, the tactic mode of normal alignment according to the original position of bit in byte and the adjacent byte, the bit of diverse location between the bit of diverse location in the single byte and the byte that is relative to each other is carried out mutual alternative to be handled, its mode is stipulated: A1-A8 byte order is arranged, if A1 byte the 1st locational bit value is 0, then A1 byte the 2nd locational bit value is replaced A1 byte the 1st locational bit value, A1 byte the 3rd locational bit value is replaced A1 byte the 2nd locational bit value, and the like, after the replacement of finishing A1 byte bit value, begin the bit value of A2 byte is replaced.In replacing processing, if when not had unnecessary bit value to be used to replace on the A1 byte, then choose in the A2 byte adjacent bit value on the relevant position and proceed to replace, replace up to each locational bit value of A1 byte and finish with the A1 byte.Yet, because in bit assignment processing procedure again, the 1st locational bit value is 0 in A1-A8 byte, according to specification requirement of the present invention, it can be omitted and consider, for this reason, need choose the A2 byte 2nd locational bit value adjacent now and go to replace A1 byte the 8th locational bit value, thereby the numerical value of finishing 8 bits of A1 byte is replaced with the A1 byte.It is to be noted, because the bit value of A2 byte the 1st position is 0, the bit value of the 2nd position has been used to replace A1 byte the 8th locational bit value before this, therefore, the replacement of the bit value of A2 byte is actually since the 3rd locational bit value, A2 byte the 3rd locational bit value is replaced A2 byte the 1st locational bit value, A2 byte the 4th locational bit value is replaced A2 byte the 2nd locational bit value, and the like, when on the A2 byte, not had unnecessary bit value to be used to replace, then choosing in the A3 byte adjacent with the A2 byte bit value on the relevant position proceeds to replace, A3 byte the 2nd locational bit value is replaced A2 byte the 7th locational bit value, A3 byte the 3rd locational bit value is replaced A2 byte the 8th locational bit value, thereby the numerical value of finishing 8 bits of A2 byte is replaced.Continue and the like, finish the bit value of A3, A4, A5, A6, A7 byte and replace.Special needs to be pointed out is that according to specification requirement of the present invention, after the process that alternative parameter generates finished, the alternative parameter of generation was less than original file data on the byte total amount.In fact this process has just begun from the adjustment of byte A1, because the bit value of A1-A8 byte the 1st position is 0 and (also can be 1, also can partly be that 0 part is 1, its condition is that the distribution of these bit positions has regularity on the byte), the mutual alternative each time of bit value all be with arrangement position on the byte relatively after bit value replace arrangement position bit value relatively the preceding, perhaps with arrangement position relatively after byte on some bit value replace arrangement position some bit value on the byte relatively the preceding.Continue to illustrate as follows, A7 byte the 8th locational bit value is replaced A7 byte the 1st locational bit value, A8 byte the 2-7 locational bit value order is successively replaced A7 byte the 82-8 locational bit value, thereby the numerical value of finishing 8 bits of A7 byte is replaced.So far, after the replacement of A7 byte is finished, the coding of A8 byte becomes 00000000, this coding can be ignored, its reason just is, the bit value of every group of 8 bytes is replaced and this identical result all can be occurred, and promptly the coding numerical value of the 8th byte is 0 after replacing through bit value.
Concrete analysis, 8 bytes of the 1st row, the bit value of the 1st position is 0 in each byte, 0 arrangement has specific rule, this rule can be obtained on the information by the call by value parameter that generates, can replace the bit value on the other ad-hoc location in this byte and other byte code with the bit value on some ad-hoc location in certain byte code, specifically, exactly numerical value on the 2-8 position in the 1st row the 1st byte is respectively 1,0,1,0,0,1, in 07 bits and the 2nd byte on the 2nd position numerical value be that 1 bit of 1 is formed a new byte, sequence arrangement successively, numerical value on the 3-8 position in the 1st row the 2nd byte is respectively 1,0,0,0,0, in 16 bits and the 3rd byte on the 2-3 position numerical value be respectively 1,2 bits of 1 are formed a new byte, numerical value on the 4-8 position in the 1st row the 3rd byte is respectively 1,0,0,1, in 05 bits and the 4th byte on the 2-4 position numerical value be respectively 0,1,3 bits of 0 are formed a new byte, numerical value on the 5-8 position in the 1st row the 4th byte is respectively 0,0,0, in 14 bits and the 5th byte on the 2-5 position numerical value be respectively 0,0,1,4 bits of 1 are formed a new byte, numerical value on the 6-8 position in the 1st row the 5th byte is respectively 0,1, in 03 bits and the 6th byte on the 2-6 position numerical value be respectively 0,0,0,0,5 bits of 1 are formed a new byte, numerical value on the 7-8 position in the 1st row the 6th byte is respectively 1, in 12 bits and the 7th byte on the 2-7 position numerical value be respectively 0,0,0,0,0,6 bits of 0 are formed a new byte, with numerical value on the 8th position in the 1st row the 7th byte be in 01 bit and the 8th byte on the 2-8 position numerical value be respectively 1,0,0,1,1,1,7 bits of 1 are formed a new byte, and the alternative parameter of generation is encoded to:
10100101 10000111 10010010 00010011 01000001 11000000 01001111
And the like, through the processing that the binary coding after the processing of bit assignment again generates through alternative parameter again, the alternative parameter of generation is as follows:
10100101 10000111 10010010 00010011 01000001 11000000 01001111
00100001 11001100 00000000 00000001 10100000 00000000 00000000
00000000 00000000 00000000 00001011 10101010 11111010 01000000
00000100 11001100 00000000 11101011 10010000 10000000 00111000
Now, after the processing through the alternative parameter generation, the alternative parameter total byte of generation adds up to 28, has reached after the process that alternative parameter generates finishes, and the alternative parameter of generation is less than the target of original file data on the byte total amount.
The mode that can also put in order according to the odd even of the original position of bit in byte and the adjacent byte and arrange, the bit of diverse location between the bit of diverse location in the single byte and the byte that is relative to each other is carried out mutual alternative handle, the replacement result of 8 bytes of the 1st row is as follows:
11001001 11000001 01000011 00001011 00110010 11000110 01000011
The mode that can also put in order according to the equal difference of the original position of bit in byte and the adjacent byte and arrange, the bit of diverse location between the bit of diverse location in the single byte and the byte that is relative to each other is carried out mutual alternative handle, the replacement result of 8 bytes of the 1st row is as follows:
10000100 01110100 00100101 11100100 10011111 10100000 00010001
It is as follows that above-mentioned several method is replaced the result who handles, as can be seen, the concrete mode difference of processing, the cipher round results that obtains is also different.
The method that alternative parameter generates can also have multiple compound mode, need not illustrate one by one here.
Step 17: relevant parameter merges
Up to the present,, reach the encryption purpose although the binary coding of the alternative parameter byte that generates is different with initial data, because the minimizing of byte causes when the reduction initial data to lack requisite reduction foundation, can't realize purpose of the present invention.Therefore, as long as the alternative parameter byte of generation and the call by value parameter byte of generation are made up, just can realize purpose of the present invention.
The combination of the alternative parameter byte that generates and the call by value parameter byte of generation can have multiple mode, also need not illustrate one by one here.
The bit of the diverse location encryption method of assignment, mutual alternative again on the above-mentioned byte; wherein bit makes the bit value that needs to handle by 1 pertinent regulations that convert 0 concrete grammar to and follow in the assignment treatment step again; go for equally making needing the bit value handled to convert 1 way and supporting with it pertinent regulations thereof to be replaced, equally in protection scope of the present invention by 0.This specification is not just described one by one.
Above-mentioned detailed description only is exemplary description, and those skilled in the art can design various execution modes according to different actual needs under the situation of the scope and spirit that do not break away from the present invention and protected.
Claims (7)
1. the bit of the diverse location encryption method of assignment, mutual alternative again on the byte said method comprising the steps of:
A. bit assignment again is characterized in that: the a1. bit is again in the assignment procedure, if quantity be in the some groups of bytes of 8 or 8 multiple on the associated byte bit value of assigned address be 1, can be 0 with its assignment simultaneously; A2. bit is again in the assignment procedure, if quantity be in the some groups of bytes of 8 or 8 multiple on the associated byte bit value of assigned address be 0, can be 1 with its assignment simultaneously;
B. call by value parameter generates, it is characterized in that: in the call by value parameter generative process, 1 bit of assigned address on per 1 byte in 8 bytes in the corresponding one by one one group of byte of 8 bits on the call by value parameter byte that generates, on per 1 byte in pairing 8 bytes on appointed bit and other 7 bytes appointed bit be relative to each other;
C. alternative parameter generates, and it is characterized in that: in the alternative parameter generative process, the mutual alternative of the bit of the diverse location in the single byte between the bit mutual alternative of diverse location and the byte that is relative to each other is taked one of following manner:
C1. according to the normal alignment sequence arrangement of the original position of bit in byte and the adjacent byte;
C2. according to the arrangement that puts in order of the odd even of the original position of bit in byte and the adjacent byte;
C3. according to the arrangement that puts in order of the equal difference of the original position of bit in byte and the adjacent byte;
D. relevant parameter merges.
2. the bit of the diverse location encryption method of assignment, mutual alternative again on the byte according to claim 1 is characterized in that:
The bit of step a is again in the assignment procedure, carries out bit simultaneously again on the associated byte in one group of byte handling of assignment, and the arrangement position at the selected bit of handling place in each byte is identical;
Perhaps:
The bit of step a is again in the assignment procedure, carries out bit simultaneously again on the associated byte in one group of byte handling of assignment, the arrangement position difference at the selected bit of handling place in each byte.
3. the bit of the diverse location encryption method of assignment, mutual alternative again on the byte according to claim 1 is characterized in that:
B1. in 8 bytes in the pairing one group of byte of any 1 bit in the call by value parameter byte of Sheng Chenging on per 1 byte bit arrangement position at place in byte of the bit of assigned address appointment on the arrangement position at place in the byte and other byte identical;
Perhaps:
B2. in 8 bytes in the pairing one group of byte of any 1 bit in the call by value parameter byte of Sheng Chenging on per 1 byte bit arrangement position at place in byte of the bit of assigned address appointment on the arrangement position at place in the byte and other byte different.
4. according to the bit of diverse location on claim 1 or the 3 described bytes encryption method of assignment, mutual alternative again, it is characterized in that: in the call by value parameter generative process of step b, bit in the file data on the some ad-hoc locations of a certain byte is assignment again, and bit assignment corresponding with it in the call by value parameter byte is 1.
5. according to the bit of diverse location on claim 1 or the 3 described bytes encryption method of assignment, mutual alternative again, it is characterized in that: in the call by value parameter generative process of step b, bit in the file data on the some ad-hoc locations of a certain byte is assignment again, and bit assignment corresponding with it in the call by value parameter byte is 0.
6. the bit of the diverse location encryption method of assignment, mutual alternative again on the byte according to claim 4, it is characterized in that: in the call by value parameter generative process of step b, bit value in the file data on the some ad-hoc locations of a certain byte is 1 by 0 assignment, and bit value assignment corresponding with it in the call by value parameter byte is 1.
7. the bit of the diverse location encryption method of assignment, mutual alternative again on the byte according to claim 5, it is characterized in that: in the call by value parameter generative process of step b, bit value in the file data on the some ad-hoc locations of a certain byte is 1 by 0 assignment, and bit value assignment corresponding with it in the call by value parameter byte is 0.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2008102177852A CN101420295B (en) | 2008-12-01 | 2008-12-01 | Ciphering method for bit reassigning and mutual replacing on different positions of the same byte |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2008102177852A CN101420295B (en) | 2008-12-01 | 2008-12-01 | Ciphering method for bit reassigning and mutual replacing on different positions of the same byte |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101420295A CN101420295A (en) | 2009-04-29 |
| CN101420295B true CN101420295B (en) | 2011-11-16 |
Family
ID=40630921
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2008102177852A Expired - Fee Related CN101420295B (en) | 2008-12-01 | 2008-12-01 | Ciphering method for bit reassigning and mutual replacing on different positions of the same byte |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101420295B (en) |
Families Citing this family (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103605730A (en) * | 2013-11-19 | 2014-02-26 | 山西三恒自动化设备有限公司 | XML (extensible markup language) compressing method and device based on flexible-length identification codes |
| CN111953690A (en) * | 2019-07-08 | 2020-11-17 | 喻汝成 | Block chain safety big data processing system |
| CN112558885B (en) * | 2020-12-24 | 2022-11-22 | 展讯半导体(成都)有限公司 | Memory using method of functional mobile phone and related product |
| CN115225935B (en) * | 2022-09-20 | 2023-01-06 | 广州万协通信息技术有限公司 | Method and device for cross-encrypting bytes of video stream and audio stream |
| CN117827805B (en) * | 2024-03-06 | 2024-05-24 | 四川中城智建系统集成科技有限公司 | Data processing operation and maintenance system of digital twin platform |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1426191A (en) * | 2001-12-10 | 2003-06-25 | 中国科学院软件研究所 | Swing type block code enciphering method |
| CN1878057A (en) * | 2005-06-07 | 2006-12-13 | 王向东 | Composition of encrypted two dimensional bar codes and application method therefor |
-
2008
- 2008-12-01 CN CN2008102177852A patent/CN101420295B/en not_active Expired - Fee Related
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 |
| CN1878057A (en) * | 2005-06-07 | 2006-12-13 | 王向东 | Composition of encrypted two dimensional bar codes and application method therefor |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101420295A (en) | 2009-04-29 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105681025B (en) | A kind of safe whitepack implementation method and device of country password standard algorithm SM4 | |
| CN101420295B (en) | Ciphering method for bit reassigning and mutual replacing on different positions of the same byte | |
| CN103684761B (en) | Coding and decoding method | |
| CN1528068A (en) | Method and system for integrated protection of data distributed processing in computer networks | |
| CN1898896A (en) | Programmable data encryption engine for advanced encryption standard algorithm | |
| CN1168041A (en) | Encryption/decryption method and encryption/decryption apparatus | |
| CN101375323A (en) | Encryption/decryption device, encryption/decryption device manufacturing device, and method, and computer program | |
| CN1527531A (en) | Method of realizing data enciphering standard or double data enciphering standard | |
| CN105790930A (en) | Information encryption method and information encryption device used for mobile terminal and mobile terminal | |
| CN110011798A (en) | The initial method and device and communication means of a kind of ZUC-256 stream cipher arithmetic | |
| CN102904711A (en) | Information encrypting method | |
| CN1241352C (en) | Encryption method for information in binary code | |
| CN1281023C (en) | Method for block-encryption of discrete data | |
| CN101841415A (en) | Word-oriented key stream generating method and encrypting method | |
| CN103731822A (en) | System and method for achieving ZUC | |
| CN105916141A (en) | Self-synchronizing realization system and self-synchronizing realization method for Zu Chongzhi encryption and decryption algorithm | |
| CN102403037A (en) | Chip burning base and method | |
| CN1190034C (en) | Swing type block code enciphering method | |
| CN110601817B (en) | Data processing method and device | |
| CN101479774B (en) | Cipher processing apparatus, data converting method, data converting program, recording medium and integrated circuit | |
| KR100411684B1 (en) | Method for the cryptographic conversion of binary data blocks | |
| CN106850206A (en) | Dynamic password protection system and method based on PLC | |
| CN107493164B (en) | DES encryption method and system based on chaotic system | |
| CN107231229B (en) | Low-entropy mask leakage protection method for protecting SM4 password chip and implementation system thereof | |
| CN107294705A (en) | A kind of method, equipment and the system of key generation and checking |
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: 20111116 Termination date: 20121201 |