CN101616000B - Encryption method based on virtual optics and device therefor - Google Patents
Encryption method based on virtual optics and device therefor Download PDFInfo
- Publication number
- CN101616000B CN101616000B CN2009101052854A CN200910105285A CN101616000B CN 101616000 B CN101616000 B CN 101616000B CN 2009101052854 A CN2009101052854 A CN 2009101052854A CN 200910105285 A CN200910105285 A CN 200910105285A CN 101616000 B CN101616000 B CN 101616000B
- Authority
- CN
- China
- Prior art keywords
- matrix
- 128bit
- phase place
- amplitude
- fft
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 64
- 230000003287 optical effect Effects 0.000 claims abstract description 18
- 238000004422 calculation algorithm Methods 0.000 claims abstract description 14
- 230000002427 irreversible effect Effects 0.000 claims abstract description 7
- 239000011159 matrix material Substances 0.000 claims description 77
- 238000012545 processing Methods 0.000 claims description 23
- 125000004122 cyclic group Chemical group 0.000 claims description 3
- 238000004088 simulation Methods 0.000 claims description 3
- 238000012634 optical imaging Methods 0.000 abstract description 2
- 230000006870 function Effects 0.000 description 53
- 238000004891 communication Methods 0.000 description 9
- 238000010276 construction Methods 0.000 description 9
- 230000000694 effects Effects 0.000 description 6
- 238000010586 diagram Methods 0.000 description 5
- 238000005516 engineering process Methods 0.000 description 4
- 238000007726 management method Methods 0.000 description 4
- 238000005070 sampling Methods 0.000 description 4
- 230000001360 synchronised effect Effects 0.000 description 4
- 238000013144 data compression Methods 0.000 description 3
- 238000013461 design Methods 0.000 description 3
- 238000004364 calculation method Methods 0.000 description 2
- 238000006243 chemical reaction Methods 0.000 description 2
- 238000006073 displacement reaction Methods 0.000 description 2
- 238000003384 imaging method Methods 0.000 description 2
- 239000000203 mixture Substances 0.000 description 2
- 230000004224 protection Effects 0.000 description 2
- 230000003068 static effect Effects 0.000 description 2
- 230000008485 antagonism Effects 0.000 description 1
- 238000003491 array Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 244000309464 bull Species 0.000 description 1
- 238000007906 compression Methods 0.000 description 1
- 230000002708 enhancing effect Effects 0.000 description 1
- 238000005242 forging Methods 0.000 description 1
- 230000010365 information processing Effects 0.000 description 1
- 238000009434 installation Methods 0.000 description 1
- 238000013507 mapping Methods 0.000 description 1
- 238000010998 test method Methods 0.000 description 1
- 238000012360 testing method Methods 0.000 description 1
- 230000000007 visual effect Effects 0.000 description 1
Images
Landscapes
- Mobile Radio Communication Systems (AREA)
- Storage Device Security (AREA)
Abstract
The invention provides an encryption method. An optical imaging process is simulated in a digital region by using an algorithm and an electronic device; a series of irreversible operations of phase replacement are added on an object plane and an image plane; and various digital information (including images, voice, texts, and the like) is calculated so as to obtain Hash values. The invention also provides a device for realizing the method. The method and the device realize the asymmetrical encryption in the field of optical information safety for the first time, not only provide an authentication function for data completeness, but also provide a theoretical support for the entrance of an optical data encryption method into a public key infrastructure (PKI). The method and the device have strong adaptability, flexibility and expandability. A system of the invention utilizes an electronic processor to construct an optical Hash function in the digital region so that physical restrictions caused by optical elements can be completely eliminated and operability enhancement and easy realization can be achieved. The method and the device have good universality. An embedded system can be formed to finish the authentication of the data completeness on time and in real time.
Description
[technical field]
The present invention relates to information security technology, relate in particular to a kind of encryption method and device based on virtual optics.
[background technology]
Under the background that current digitalized network is popularized, the safety issue of information shows that day by day the overall thing of getting up to have two aspects of concluding needs to consider: on the one hand, use the transferred information of various AES protections, make it can resist passive attack; On the other hand, want exactly to prevent that the adversary from carrying out active attack to system,, distort information etc. as forging.Authentication (Authentication) is the main means of antagonism active attack, and it plays an important role for the fail safe of the various information systems in the open network.And the structure of Hash function realize just current various certificate scheme indispensable or step, also be whether the decision certificate scheme has the key factor of exploitativeness and reliability.The structure of Hash function also is the technological core of most widely used in the world at present common key cryptosystem (PKI) simultaneously.
The Hash function also is hash function, hash function---and it is a kind of one-way cipher system, and promptly it is an irreversible mapping from plaintext to ciphertext, has only ciphering process, can not decipher.Simultaneously, the Hash function can obtain the input of random length later on through conversion the output of regular length.The fixing characteristic of this one-way characteristic of Hash function and the length of dateout makes " digital finger-print " that it can generate message or other data blocks (also claim eap-message digest; Or hashed value), therefore be widely used in fields such as data integrity authentication, digital signature.
The Hash function is a class function that requires below satisfying: 1. basic demand
(1) algorithm is open, does not need key.
(2) data compression function is arranged, can the input of random length be converted to the output of a regular length.
(3) easy for calculation.Promptly provide m, it is easy calculating h (m).
2. security requirement
(1) the hashed value h of given message (m) to obtain m be calculate to go up infeasible.Promptly to a given hashed value, can not finding out a piece of news, to make its hashed value just in time be given, one-way that Here it is;
(2) given message m and its hashed value h (m) will find another message m different with m ', making their hashed value identical is impossible (promptly anti-weak collision property);
(3) for any two different message m and m ', their hashed value is not the same (promptly anti-strong collision property), if in fact any two message difference slightly, their hashed value also has very big difference.A bit in revising expressly is avalanche effect, requires hash function to have strong intersymbol dependence, if will make that only about half of bit changes in the output Bit String.The hashed value that obtains like this, at last will be closely related with each bit expressly.
Since nineteen ninety, Rivest constructed MD4, international cryptography educational circles had successively constructed Hash functions such as MD5, SHA-0, SHA-1, PIPEMD-160, SHA-256, SHA-384, SHA-512, and its security performance obtains raising progressively.MD5 and two kinds of typical algorithm of SHA-1 are still used very extensive at present.And nearly all close closely the linking to each other with various mathematical operations of these algorithms, like XOR, ask operations such as mould, displacement.
Based on the data encryption technology of optical information processing is to begin a kind of new " non-mathematics " data ciphering method of starting to walk to develop in recent years in the world.Its unique advantage is: have real-time data processing speed and multiple key space.But because the invertibity of light path causes all kinds of optics cryptographic algorithms all to be confined in the symmetric cryptography scope, can't be applied among the present widely used PKI, can't realize the integrated authentication of data, also can't effectively prevent the forgery of data and distort.
The implication of " virtual optics " (Virtual Optics) is to use the process of the method simulate optical data processing of numeral in the electronic processors space, like diffraction of light, propagation, and the Fourier transform of lens, holographic recording and reconstruction or the like.
[summary of the invention]
A technical problem to be solved by this invention provides a kind of encryption method based on virtual optics; Described method not only provides the authentication function to the data integrality, also for the optical data encryption method gets into common key cryptosystem (PKI) theoretical support is provided.
For solving the problems of the technologies described above, the present invention provides a kind of the present invention to realize through following technical proposals.Utilize the correlation theories knowledge of virtual optics imaging; Through algorithm and electronic installation in numeric field simulate optical imaging process; And add the irreversible operation of a series of " replacement phase places " at object plane and imaging surface; Various digital informations (comprising image, voice, text etc.) are carried out computing, obtain hash value (being hashed value), specific practice is:
May further comprise the steps:
1) with pending digital information with the whole branch of 128bit, the data block of last not enough 128bit all fills 1, constructs information plane Info;
2) in the three dimensions of simulation virtual optical imagery process, information plane Info is carried out piecemeal, the discrete Fraunhofer diffraction through " progressively cascade " is a Fourier transform then, realizes the function of encrypting and compressing; When carrying out the discrete Fraunhofer diffraction of " progressively cascade ", utilize algorithm to add the operation of " replacement phase place " in an orderly manner, make that whole process is irreversible, thereby realize having unidirectional encryption function;
3) utilize step 2) the complex wave field of the data matrix that obtains structure, carry out Fourier transform and get amplitude, obtain the Hash1 value of 128bit;
4) each " word " among the information plane Info done the operation of 4 of ring shift lefts; Construct a supplementary plane; Then it is repeated 2), 3) operation; Obtain the Hash2 value of 128bit, the Hash1 value that itself and step 3) are obtained combines and obtains the hash value of final 256bit.
On this basis, further:
In the step 1); The method that constructs information plane Info is: with pending digital information; With the whole branch of 128bit; The data block of last not enough 128bit all fills 1, constructs the even number data block, and perhaps constructing and replenishing one after the odd number data block is that 1 128bit data block constitutes the even number data block entirely; Then said even number data block is divided into the numerical matrix that two rows finally construct two rows, 4 * 4 * N; Wherein the value of N depends on the length of digital information, and each data block is 128bit, be that minimum unit constitutes one 4 * 4 numerical matrix matrix with " the no symbol word " of 8bit.
Step 2) in, " progressively cascade " and " replacement phase place " detailed process is: in the information plane Info that step 1) obtains, the numerical matrix of each row 4 * 4 * N is all done following processing: do amplitude with first numerical matrix earlier; Second numerical matrix is modulated into phase place, constructs first complex wave field, and it is done Fourier transform one time; Obtain second complex wave field; Then second complex wave field got amplitude, the 3rd numerical matrix is modulated into phase place, construct the 3rd complex wave field, then the 3rd complex wave field got amplitude, the 4th numerical matrix is modulated into phase place; Construct the 4th complex wave field; ..., until N-1 complex wave field of structure, then N-1 complex wave field got amplitude, N numerical matrix is modulated into phase place; Construct N complex wave field, so just accomplished " progressively cascade " and " replacement phase place " operation of the numerical matrix of each row 4 * 4 * N.
Adopt the inventive method to can be following by the ciphering process of the whole pending digital information that is divided into 8 data matrix matrix1, matrix3, matrix5, matrix7 and matrix2, matrix4, matrix6, matrix8 of 128bit:
A) with pending digital information with the whole branch of 128bit; The data block of last not enough 128bit all fills 1; Obtain 8 data matrix matrix1, matrix3, matrix5, matrix7 and matrix2, matrix4, matrix6, matrix8, construct information plane Info;
B) respectively matrix1, matrix3, matrix5, matrix7 and matrix2, matrix4, matrix6, matrix8 are done the operation of " progressively cascade " and " replacement phase place ", obtain Info1 and Info2 respectively:
Info1＝PHK[matrix1，matrix3，matrix5，matrix7；4]
Info2＝PHK[matrix2，matrix4，matrix6，matrix8；4]，
Wherein, the PHK operator to embody formula following:
PHK[A，B，C(……)；N]＝abs{FFT[abs{FFT[A.*exp(j*π*B/258)]}.*exp(j*π*C/258)]}
FFT representes DFT in this expression formula, and abs representes that the logarithm value matrix asks mould promptly to get amplitude, and Exp representes the power of e;
Info1 and Info2 are divided into 42 * 2 real number matrix matrix1 ', matrix2 ', matrix3 ', matrix4 ' and matrix5 ', matrix6 ', matrix7 ', matrix8 ' respectively;
Get matrix1 ' and matrix2 ' does amplitude, get matrix3 ' and matrix4 ' and do phase place, construct i.e. two complex matrixs in two complex wave fields, it is done Fourier transform one time, obtain Info11 and Info12:
Info11＝FFT[matrix1′.*exp(j*π*matrix3′/258)]
Info12＝FFT[matrix2′.*exp(j*π*matrix4′/258)]；
Get matrix5 and matrix6 does amplitude, get matrix7 and matrix8 and do phase place, construct i.e. two complex matrixs in two complex wave fields, it is done Fourier transform one time, obtain Info21 and Info22:
Info21＝FFT[matrix5′.*exp(j*π*matrix7′/258)]
Info22＝FFT[matrix6′.*exp(j*π*matrix8′/258)]；
Utilize the amplitude addition of Info11 and Info12, a new complex matrix is constructed in the phase place addition, and it is done Fourier transform one time, obtains Info111; Utilize the amplitude addition of Info21 and Info22, another new complex matrix is constructed in the phase place addition, and it is done Fourier transform one time, obtains Info222:
Info111＝FFT[(abs(Info11)+abs(Info12)).*(angle(Info11)+angle(Info12))]
Info222＝FFT[(abs(Info21)+abs(Info22)).*(angle(Info21)+angle(Info22))]
Wherein phase place is got in angle () expression;
Utilize the amplitude addition of complex matrix Info111 and Info222, a new complex matrix is constructed in the phase place addition, it is done Fourier transform one time, and get amplitude, obtains one 2 * 2 real number matrix, and this real number matrix is double type data, i.e. Hash1 value:
Hash1=abs{FFT [(abs (Info111)+abs (Info222)) .* (angle (Info111)+angle (Info222))] }; Data multiply by 10^7; The uint32 type data that its each real number become contain 7-10 significant digits, 128bit promptly gets Hash1 value finally altogether;
C) each " word " of information plane Info done the operation of a cyclic shift, made 4 of its ring shift lefts, construct a supplementary plane; Step a), b are carried out in this supplementary plane), obtain the Hash2 value of 128bit;
D) constitute one 2 * 4 data matrix by the Hash1 of 128bit and the Hash2 of 128bit, wherein each numerical value all is the integer of a uint32 type, and this matrix is to utilize type hash value of the 256bit that optics Hash functional operation finally obtains.
Another technical problem to be solved by this invention provides a kind of encryption device based on virtual optics.
For solving this technical problem; The present invention provides a kind of encryption device of realizing encryption method of the present invention; Said device is the master-slave system that is made up of general purpose PC and digital signal processor, programmable asic, or the embedded system of the disengaging PC isolated operation that is made up of digital signal processor or programmable asic; And device is linked in sequence according to following: the input of device is connected with the output of communication system; The output of device directly is connected with communication line; When original communication system information transmitted is an analog signal; Also to add patrix/number conversion interface, add the D/A switch interface in the rear end of optics Hash construction of function device at the front end of optics Hash construction of function device.
The communication terminal that said device can be made up of central processing unit, radio transmitting and receiving chip, transducer is solidified with the algorithm of structure optics Hash function, i.e. node among the wireless sensor network WSN among the EEPROM of said communication terminal.
Said digital signal processor is single parallel digital signal processor or the array that is made up of at least two digital signal processors.
Said programmable asic is the programmable logic device of single complicacy or the array of being made up of at least two CPLDs; Or single field programmable gate array or the array formed by at least two field programmable gate arrays, or the array of forming by the programmable logic device and the field programmable gate array of complicacy.
Communication terminal among the WSN is by the sensor acquisition data; And convert digital information to by A/D converter; By built-in central processing unit the information plane that is made up of digital information is done quasi real time again and handled, generate hash value, send through wireless channel by transmitting chip then.Preferably; Said device adopts the master-slave mode hardware configuration; Comprise general purpose personal computer that serves as main frame and the digital signal processing sub system of serving as slave; Said digital signal processing sub system comprises digital signal processing chip and field programmable gate array chip, and said digital signal processing chip is used for watermark and embeds and detect core processing, and said field programmable gate array chip is used for system's control and management.Preferably, said device adopts Embedded System Structure, comprises the array that individual digit signal processor or a plurality of bank of digital signal processors become, and is solidified with the construction algorithm of optics Hash function in the EEPROM in the said digital signal processor.Preferably, said device comprises the array that single CPLD or a plurality of CPLD are formed.
Preferably, said device comprises the array that single field programmable gate array chip or a plurality of field programmable gate array chip are formed.
Preferably, said device comprises the array of single CPLD or a plurality of CPLD composition and the array of single field programmable gate array chip or a plurality of field programmable gate array chip composition.
Preferably, said device comprises data sampling sensor, radio transmitting and receiving chip, central processing unit, is solidified with the construction algorithm of optics Hash function in the EEPROM in the said digital signal processor.Said device has the high and adaptable characteristics of the flexibility of use
Beneficial effect of the present invention is: the asymmetric cryptosystem of optical information security fields has been realized for the first time in (1), and the authentication function to the data integrality not only is provided, and also for the optical data encryption method gets into common key cryptosystem (PKI) theoretical support is provided; (2) physical background is clear, has very strong adaptability, flexibility and expansibility; (3) system utilizes electronic processors, realizes the structure of optics Hash function at numeric field, can eliminate the physical restriction of optics so fully, and enhancing operability can realize the thought based on the asymmetric cryptosystem of virtual optics at an easy rate; (4) can be used for various digital informations like image, video, voice, text etc., universality is fine; (6) can constitute embedded system, quasi real time accomplish authentication the data integrality.
[description of drawings]
Through embodiment and combine accompanying drawing, the present invention is done further detailed description below:
Fig. 1 is based on the principle schematic of building method of the class Hash function of virtual optics;
Fig. 2 is the pending digital information of arranging by particular requirement, i.e. information plane;
Fig. 3 is the datum plane sketch map that produces in the structure optics Hash functional procedure;
Fig. 4 is based on the simple and clear main-process stream sketch map of building method of the class Hash function of virtual optics;
The master-slave mode optics Hash construction of function apparatus structure block diagram that Fig. 5 adopts general purpose PC, digital signal processor and programmable asic to constitute for a kind of embodiment of encryption device of the present invention;
The optics Hash construction of function apparatus structure block diagram that Fig. 6 adopts array of digital signal processors to constitute for a kind of embodiment of encryption device of the present invention;
The optics Hash construction of function apparatus structure block diagram that Fig. 7 adopts complicated programmable logic device array to constitute for a kind of embodiment of encryption device of the present invention;
The optics Hash construction of function apparatus structure block diagram that Fig. 8 adopts the field programmable gate array chip array to constitute for a kind of embodiment of encryption device of the present invention;
The optics Hash construction of function apparatus structure block diagram that Fig. 9 adopts complicated programmable logic device array and field programmable gate array chip array to constitute for a kind of embodiment of encryption device of the present invention;
Figure 10 is common ATMEL series central processing unit for a kind of embodiment of encryption device of the present invention adopts; Data sampling sensor; Radio transmitting and receiving chip constitutes the communication terminal (being node) of wireless sensor network (WSN), constitutes the structured flowchart of optics Hash function implement device.
Label declaration is following in the accompanying drawing:
The 201st, general purpose PC, the 202nd, pci bus controller, the 203, the 501st, digital signal processor (DSP); 204, the 701, the 802nd, field programmable gate array chip; The 205th, power management chip, the 206th, Flash memory, the 207th, synchronous dynamic ram; The 208th, synchronous triggering static RAM (SRAM), the programmable logic device of 601,801 complicacies.The 1001st, data sampling sensor, the 1002nd, radio transmitting and receiving chip, the 1003rd, central processing unit.
[embodiment]
Do explanation at length below in conjunction with 1 to 4 pair of execution mode of the present invention of accompanying drawing.
Fig. 1 shows the flow process principle of the inventive method.Step is following:
1) as shown in Figure 2; Structure digital information planar I nfo: with pending digital information; With the whole branch of 128bit; The data block of last not enough 128bit all fills 1, constructs the even number data block, and perhaps constructing and replenishing one after the odd number data block is that 1 128bit data block constitutes the even number data block entirely; Then said even number data block is divided into the numerical matrix that two rows finally construct two rows, 4 * 4 * N; Wherein the value of N depends on the length of digital information, and each data block is 128bit, be that minimum unit constitutes one 4 * 4 numerical matrix matrix with " the no symbol word " of 8bit.
To handle 1024bit data (wherein last 104bit all fills 1) is example, and with the whole branch of 128bit, the data block of last not enough 128bit all fills 1, is minimum unit (8bit) with " no symbol word "; Every 128bit data constitute one 4 * 4 numerical matrix (matrix), thereby construct one 8 * 4 * 8 numerical matrix, promptly are divided into 8 numerical matrixs altogether; By numbering 1,2,3; 4,5,6; 7,8 arrange, and each numerical matrix is called matrix1, matrix2, matrix3, matrix4, matrix5, matrix6, matrix7, matrix8 respectively.Comprise 16 " words " in each numerical matrix; Therefore each numerical matrix contains the data of 16 * 8=128bit; This whole datum plane is the digitlization " information plane " that constructs; Because wherein each " word " all is one 8 binary number, so information plane also can be regarded one " gray level images on 8 rank " as.
2) in the three dimensions of simulation virtual optical imagery process, the information plane Info that step 1) is constructed carries out piecemeal, through the discrete Fraunhofer diffraction (being Fourier transform) of " progressively cascade ", realizes the function of encrypting and compressing then; When carrying out the discrete Fraunhofer diffraction of " progressively cascade ", utilize algorithm to add the operation of " replacement phase place " in an orderly manner, make that whole process is irreversible, thereby realize having unidirectional encryption function;
3) utilize step 2) the complex wave field of the data matrix that obtains structure, carry out Fourier transform and get amplitude, obtain the Hash1 value of 128bit;
4) each " word " among the information plane Info done the operation of 4 of ring shift lefts; Construct a supplementary plane; Then it is repeated 2), 3) operation; Obtain the Hash2 value of 128bit, the Hash1 value that itself and step 3) are obtained combines and obtains the hash value of final 256bit.
Step 2) principle of " progressively cascade " and " replacement phase place " operation is in: in the information plane Info that step 1) obtains, the numerical matrix of each row 4 * 4 * N is all done following processing: do amplitude with first numerical matrix earlier, second numerical matrix is modulated into phase place; Construct first complex wave field; It is done Fourier transform one time, obtain second complex wave field, then second complex wave field got amplitude, the 3rd numerical matrix is modulated into phase place; Construct the 3rd complex wave field; Then the 3rd complex wave field got amplitude, the 4th numerical matrix is modulated into phase place, construct the 4th complex wave field ...; Until N-1 complex wave field of structure; Then N-1 complex wave field got amplitude, N numerical matrix is modulated into phase place, construct N complex wave field, so just accomplished " progressively cascade " and " replacement phase place " operation of the numerical matrix of each row 4 * 4 * N.
The detailed process of " progressively cascade " and " replacement phase place " operation is:
At first introduce operator PHK [A, B, C (...); N] be described in digital space, based on " the progressively cascade " of Fourier transform and the process of " replacement phase place ".A wherein, B, the numerical matrix that computing is participated in expression such as C, their sizes are identical, and N representes the size of these numerical matrixs, and for example N=4 contains 4 * 4 words in the expression numerical matrix.The PHK operator to embody formula following:
PHK[A，B，C(……)；N]＝abs{FFT[abs{FFT[A.*exp(j*π*B/258)]}.*exp(j*π*C/258)]}
Wherein FFT representes DFT, and abs representes that the logarithm value matrix asks mould (promptly getting amplitude), and Exp representes the power of e.
Begin process information planar I nfo below, the first round handles:
At first need respectively matrix1, matrix3, matrix5, matrix7 and matrix2, matrix4, matrix6, matrix8 to be done the operation of " progressively cascade " and " replacement phase place "; Obtain Info1 and Info2 respectively, concrete implementation is following:
Info1＝PHK[matrix1，matrix3，matrix5，matrix7；4]
Info2＝PHK[matrix2，matrix4，matrix6，matrix8；4]
Fig. 3 is datum plane Info1 and Info2; They all are 4 * 4 real number matrix, again Info1 and Info2 are divided into 42 * 2 real number matrix (matrix1, matrix2, matrix3, matrix4 and matrix5, matrix6, matrix7, matrix8) respectively below, below handle Info 1 earlier; Get matrix1 and matrix2 does amplitude; Get matrix3 and matrix4 does phase place, construct two complex wave fields (i.e. two complex matrixs), it is done Fourier transform one time; Obtain Info11 and Info12, concrete implementation method is following:
Info11＝FFT[matrix1′.*exp(j*π*matrix3′/258)]
Info12＝FFT[matrix2′.*exp(j*π*matrix4′/258)]
In like manner, handle Info2, can obtain Info21 and Info22, concrete implementation method is following:
Info21＝FFT[matrix5′.*exp(j*π*matrix7′/258)]
Info22＝FFT[matrix6′.*exp(j*π*matrix8′/258)]
Next handle 42 * 2 complex matrix Info11, Info12, Info21 and the Info22 that has just obtained, utilize the amplitude addition of Info11 and Info12, a new complex matrix is constructed in the phase place addition; It is done Fourier transform one time, obtain Info111, in like manner; Utilize the amplitude addition of Info21 and Info22, a new complex matrix is constructed in the phase place addition; It is done Fourier transform one time, obtain Info222, concrete implementation method is following:
Info111＝FFT[(abs(Info11)+abs(Info12)).*(angle(Info11)+angle(Info12))]
Info222＝FFT[(abs(Info21)+abs(Info22)).*(angle(Info21)+angle(Info22))]
Wherein phase place is got in angle () expression;
So just accomplished the operation of " progressively cascade " and " replacement phase place ".
Utilize the amplitude addition of complex matrix Info111 and Info222 at last, a new complex matrix is constructed in the phase place addition, it is done last Fourier transform, and get amplitude, obtains one 2 * 2 real number matrix (double type data), i.e. the Hash1 value.Concrete implementation method is following:
Hash1＝abs{FFT[(abs(Info111)+abs(Info222)).*(angle(Info111)+angle(Info222))]}
In order to reduce internal memory, data multiply by 10^7, the uint32 type data that its each real number become contain 7-10 significant digits, 128bit altogether, promptly final Hash1 value.
In order to better meet avalanche effect, promptly initial information changes a bit, and output valve has at least bit position over half to change.To further process below raw information planar I nfo.
Second takes turns processing:
Displacement, squeeze operation that entering second is now taken turns based on Fourier transform.Its process is the same with first round operation with principle, just before the process information plane, earlier each " word " of information plane is done the operation of a cyclic shift, constructs a supplementary plane.Concrete implementation method is following: as shown in Figure 2, information plane contains 128 " words " altogether, and each word is carried out shifting function; Make 4 of its ring shift lefts, for example: first word 123 of above-mentioned information plane, its binary form is shown 01111011; Obtain 10110111 behind four of the ring shift lefts, promptly 183.
Above-mentioned supplementary plane is carried out and the same processing of process that obtains the Hash1 value; Can obtain the data of other 4 * 32=128bit; It is the Hash2 value; Constitute one 2 * 4 data matrix by Hash1 and Hash2, wherein each numerical value all is the integer of a uint32 type, and the significance bit of each numerical value is basically all between the 7-10 position.This matrix is to utilize type hash value that optics Hash functional operation finally obtains (256bit altogether).
Fig. 4 is based on the simple and clear main-process stream sketch map of building method of the class Hash function of virtual optics; Can be clearly seen that whole optics encryption method is divided into two bull wheels; The every wheel can be accomplished a unidirectional encryption function and data compression function; And owing to use particular processing, making the hash value that obtains after the two-wheeled computing have good avalanche effect, whole encryption function has well satisfied the characteristic requirements of Hash function.
In the present embodiment, in order to improve precision, can be in step 2) before the process information plane, be the double type with information plane uint8 type data transaction, simultaneously each data is added 3, promptly information plane is done " zero-suppressing " and handle;
In the present embodiment, for fear of collision occurring, in the compression process to numerical matrix among Fig. 41,3,5,7 and numerical matrix 2,4,6,8, all do zero-suppressing processing before doing Fourier transform, method adds 3 for treating deal with data once more at every turn.
Before finally obtaining Hash1 value and Hash2 value, data multiply by 10^7, the uint32 type data that its each real number become contain 7-10 significant digits, 128bit altogether, promptly final Hash1 value and Hash2 value.
In order to verify the characteristic of the optics Hash function that the present invention constructs, under the MATLABR2008a environment, a large amount of attack tests have been done.Concrete method of testing and result are following:
1. generate 1,000,000 groups of information planes at random; To each information plane do at random repeatedly add for 100 times 1 or subtract 1 the operation (changing a bit position); Calculate its hash value, the phenomenon that all do not bump, and confirmed that the hash value that institute of the present invention design scheme produces has good avalanche effect.
2. generate 1,000,000 groups of information planes at random; Each information plane is done 200 operations; Wherein each operation makes that the numeral of a random site deducts a random number in the information plane; Calculate its hash value, the phenomenon that all do not bump, and confirmed that the hash value that institute of the present invention design scheme produces has good avalanche effect.
Optical encryption method provided by the invention has well satisfied the data compression function of Hash function, can convert the input information of random length the output of regular length to.
Optical encryption method provided by the invention has well satisfied the one-way data encryption function of Hash function, can be encrypted to ciphertext to the information of input, and calculate upward irreversible.
Optical encryption method provided by the invention has well satisfied Hash function avalanche effect, changes any one bit position of input information, and the hash value of its generation will have very big variation.
Fig. 5 is a kind of embodiment of optical encryption method implement device of the present invention, adopts general purpose PC, digital signal processor (DSP) and field-programmable application-specific integrated circuit (ASIC) (FPGA) to constitute the hardware configuration of master-slave mode optics Hash function implement device.As main frame, the DSP subsystem of being made up of dsp chip 203, fpga chip 204, power management chip 205, Flash memory 206, synchronous dynamic ram 207 and synchronous triggering static RAM (SRAM) 208 is as slave with general purpose PC 201 for this device.Functions such as information exchange between employing software programming realization main frame and the slave and real-time communication, interface selection, man-machine interface.The slave that adopts DSP+FPGA to constitute is realized various digital informations are calculated hash value.Dsp chip 203 is accomplished optics Hash computing, and fpga chip 204 is accomplished the interruption controls of system reset control, power management, pci controller 202 and dsp chip 203 interface controls, pci controller and DSP, the transmission time sequence control of data.Carry out data communication, information exchange through pci bus between the host and slave processors.
Fig. 6 is a kind of embodiment of the present invention.In this embodiment; Array of digital signal processors is constituting by individual digit signal processor 601 or a plurality of digital signal processor 601; Algorithm is cured in the EEPROM in the array of digital signal processors, constitutes embedded system, thereby can break away from the PC isolated operation.The multimedia messages of this off line is hidden system and is had advantages such as volume is little, flexible and convenient.
Fig. 7 is another embodiment of the present invention.In this embodiment, complicated programmable logic device array is the structural representation by the built-in optical class Hash function implement device that constitutes of the programmable logic device 701 of the programmable logic device 701 of single complicacy or a plurality of complicacies.
Fig. 8 is another embodiment of the present invention.In this embodiment, the implement device of optics Hash function is to be made up of the array that single field programmable gate array chip 801 or a plurality of field programmable gate array chip 801 combine.
Fig. 9 is another embodiment of the present invention.The built-in optical class Hash function implement device that the array that the array that it is made up of the programmable logic device 901 of single or a plurality of complicacies and single or a plurality of field programmable gate array chip 902 constitute is formed.
Figure 10 is another embodiment of the present invention; In this instance; The implement device of optics Hash function is to be made up of data sampling sensor 1001, radio transmitting and receiving chip 1002 and central processing unit 1003; Wherein be solidified with the algorithm of optics Hash function among the EEPROM of central processing unit, accomplish the core calculations part of optics Hash function, the data that data that central processing unit can deal with data pick-up transducers be quasi real time gathered or radio transmitting and receiving chip receive by central processing unit; Generate hash value, accomplish the data integrity authentication.
Realize that according to method provided by the invention the device of optics Hash function can use Visual C++ software environment to realize on general purpose PC.Certainly these particular environment only are illustrative, and method of the present invention can be used for computer that a plurality of different vendors make and realizes together with the software that uses any suitable language, such as WINAVR, DEV C++ etc.
The building method and the device of the class Hash function based on virtual optics provided by the invention can be handled Any Digit information, comprise picture, text, audio frequency etc.Effectively the integrality of protected data has great importance at multi-medium data and network epoch in vogue.Physical background of the present invention is clear simultaneously, has good expansion and flexibility.
Above content is to combine concrete preferred implementation to the further explain that the present invention did, and can not assert that practical implementation of the present invention is confined to these explanations.For the those of ordinary skill of technical field under the present invention, under the prerequisite that does not break away from the present invention's design, can also make some simple deduction or replace, all should be regarded as belonging to protection scope of the present invention.
Claims (1)
1. encryption method based on virtual optics is characterized in that: may further comprise the steps:
1) with pending digital information with the whole branch of 128bit, the data block of last not enough 128bit all fills 1, constructs information plane Info;
In the step 1); The method that constructs information plane Info is: with pending digital information; With the whole branch of 128bit; The data block of last not enough 128bit all fills 1, constructs the even number data block, and perhaps constructing and replenishing one after the odd number data block is that 1 128bit data block constitutes the even number data block entirely; Then said even number data block is divided into the numerical matrix that two rows finally construct two rows, 4 * 4 * N; Wherein the value of N depends on the length of digital information, and each data block is 128bit, be that minimum unit constitutes one 4 * 4 numerical matrix matrix with " the no symbol word " of 8bit;
2) in the three dimensions of simulation virtual optical imagery process, information plane Info is carried out piecemeal, the discrete Fraunhofer diffraction through " progressively cascade " is a Fourier transform then, realizes the function of encrypting and compressing; When carrying out the discrete Fraunhofer diffraction of " progressively cascade ", utilize algorithm to add the operation of " replacement phase place " in an orderly manner, make that whole process is irreversible, thereby realize having unidirectional encryption function;
Said step 2) in, " progressively cascade " and " replacement phase place " detailed process is: in the information plane Info that step 1) obtains, the numerical matrix of each row 4 * 4 * N is all done following processing: do amplitude with first numerical matrix earlier; Second numerical matrix is modulated into phase place, constructs first complex wave field, and it is done Fourier transform one time; Obtain second complex wave field; Then second complex wave field got amplitude, the 3rd numerical matrix is modulated into phase place, construct the 3rd complex wave field, then the 3rd complex wave field got amplitude, the 4th numerical matrix is modulated into phase place; Construct the 4th complex wave field; ..., until N-1 complex wave field of structure, then N-1 complex wave field got amplitude, N numerical matrix is modulated into phase place; Construct N complex wave field, so just accomplished " progressively cascade " and " replacement phase place " operation of the numerical matrix of each row 4 * 4 * N;
Can be following by the encryption method of the whole pending digital information that is divided into 8 data matrix matrix1, matrix3, matrix5, matrix7 and matrix2, matrix4, matrix6, matrix8 of 128bit:
A) with pending digital information with the whole branch of 128bit; The data block of last not enough 128bit all fills 1; Obtain 8 data matrix matrix1, matrix3, matrix5, matrix7 and matrix2, matrix4, matrix6, matrix8, construct information plane Info;
B) respectively matrix1, matrix3, matrix5, matrix7 and matrix2, matrix4, matrix6, matrix8 are done the operation of " progressively cascade " and " replacement phase place ", obtain Info1 and Info2 respectively:
Info1＝PHK[matrix1，matrix3，matrix5，matrix7；4]
Info2＝PHK[matrix2，matrix4，matrix6，matrix8；4]；
Wherein, the PHK operator to embody formula following:
PHK[A，B，C(……)；N]＝abs{FFT[abs{FFT[A.*exp(j*π*B/258)]}.*exp(j*π*C/258)]}
FFT representes DFT in this expression formula, and abs representes that the logarithm value matrix asks mould promptly to get amplitude, and Exp representes the power of e;
Info1 and Info2 are divided into 42 * 2 real number matrix respectively, are labeled as matrix1 ', matrix2 ', matrix3 ', matrix4 ' and matrix5 ', matrix6 ', matrix7 ', matrix8 ';
Get matrix1 ' and matrix2 ' does amplitude, get matrix3 ' and matrix4 ' and do phase place, construct i.e. two complex matrixs in two complex wave fields, it is done Fourier transform one time, obtain Info11 and Info12:
Info11＝FFT[matrix1′.*exp(j*π*matrix3′/258)]
Info12＝FFT[matrix2′.*exp(j*π*matrix4′/258)]；
Get matrix5 ' and matrix6 ' does amplitude, get matrix7 ' and matrix8 ' and do phase place, construct i.e. two complex matrixs in two complex wave fields, it is done Fourier transform one time, obtain Info21 and Info22:
Info21＝FFT[matrix5′.*exp(j*π*matrix7′/258)]
Info22＝FFT[matrix6′.*exp(j*π*matrix8/′258)]；
Utilize the amplitude addition of Info11 and Info12, a new complex matrix is constructed in the phase place addition, and it is done Fourier transform one time, obtains Info111; Utilize the amplitude addition of Info21 and Info22, another new complex matrix is constructed in the phase place addition, and it is done Fourier transform one time, obtains Info222:
Info111＝FFT[(abs(Info11)+abs(Info12)).*(angle(Info11)+angle(Info12))]
Info222＝FFT[(abs(Info21)+abs(Info22)).*(angle(Info21)+angle(Info22))]
Wherein phase place is got in angle () expression;
Utilize the amplitude addition of complex matrix Info111 and Info222, a new complex matrix is constructed in the phase place addition, it is done Fourier transform one time, and get amplitude, obtains one 2 * 2 real number matrix, and this real number matrix is double type data, i.e. Hashl value:
Hashl=abs{FFT [(abs (Info111)+abs (Info222)) .* (angle (Info111)+angle (Info222))] }; Data multiply by 10^7; The uint32 type data that its each real number become contain 7-10 significant digits, 128bit promptly gets Hash1 value finally altogether;
3) c) each " word " of information plane Info done the operation of a cyclic shift, made 4 of its ring shift lefts, construct a supplementary plane; Step a), b are carried out in this supplementary plane), obtain the Hash2 value of 128bit;
D) constitute one 2 * 4 data matrix by the Hash1 of 128bit and the Hash2 of 128bit, wherein each numerical value all is the integer of a uint32 type, and this matrix is the hash value of the 256bit that finally obtains.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2009101052854A CN101616000B (en) | 2009-01-24 | 2009-01-24 | Encryption method based on virtual optics and device therefor |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2009101052854A CN101616000B (en) | 2009-01-24 | 2009-01-24 | Encryption method based on virtual optics and device therefor |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101616000A CN101616000A (en) | 2009-12-30 |
| CN101616000B true CN101616000B (en) | 2012-05-02 |
Family
ID=41495430
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2009101052854A Active CN101616000B (en) | 2009-01-24 | 2009-01-24 | Encryption method based on virtual optics and device therefor |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101616000B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9633195B2 (en) | 2012-05-30 | 2017-04-25 | Label Tech International Trims Limited | Authentication apparatus and methods |
| CN104284054B (en) * | 2014-08-05 | 2017-05-03 | 华北水利水电大学 | Multi-image encrypting and decrypting method based on ghost imaging and public key cryptography |
| CN107659753B (en) * | 2017-10-23 | 2019-08-06 | 北京邮电大学 | The compression encryption method of image |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1474283A (en) * | 2003-08-04 | 2004-02-11 | 深圳大学 | Information hidden encrypting/decrypting method and device based on virtual imaging |
| CN1487421A (en) * | 2003-08-11 | 2004-04-07 | 深圳大学 | 3D digital watermark embedding and detecting method and device based on virtual optics |
| CN101227269A (en) * | 2007-01-18 | 2008-07-23 | 中国科学院自动化研究所 | Method for binding and publishing digital information or cryptographic key based on fingerprint frequency domain |
-
2009
- 2009-01-24 CN CN2009101052854A patent/CN101616000B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1474283A (en) * | 2003-08-04 | 2004-02-11 | 深圳大学 | Information hidden encrypting/decrypting method and device based on virtual imaging |
| CN1487421A (en) * | 2003-08-11 | 2004-04-07 | 深圳大学 | 3D digital watermark embedding and detecting method and device based on virtual optics |
| CN101227269A (en) * | 2007-01-18 | 2008-07-23 | 中国科学院自动化研究所 | Method for binding and publishing digital information or cryptographic key based on fingerprint frequency domain |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101616000A (en) | 2009-12-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109639677B (en) | Cloud storage outsourcing decryption attribute-based encryption method capable of limiting access times | |
| US11770262B2 (en) | Odd index precomputation for authentication path computation | |
| Van Dijk et al. | Hourglass schemes: how to prove that cloud files are encrypted | |
| CN103259643B (en) | A kind of full homomorphic cryptography method of matrix | |
| CN112152777B (en) | Homomorphic cryptographic operation-oriented key conversion method, system, equipment and readable storage medium | |
| CN106230590A (en) | A kind of ciphertext policy ABE base encryption method of many authorized organizations | |
| CN101488214A (en) | Method for expanding anti-fake digital watermark and electronic seal information content | |
| CN104376526B (en) | Image encryption method based on vortex beams and Phase Retrieve Algorithm | |
| CN103825723A (en) | Encryption method and device | |
| CN110022309B (en) | Safe and efficient data sharing method in mobile cloud computing system | |
| US11722313B2 (en) | State synchronization for post-quantum signing facilities | |
| CN102263636A (en) | Stream cipher key control method for fusing neural network with chaotic mappings | |
| WO2020168627A1 (en) | Encryption and decryption method and device employing zipper-type dynamic hashing and nlfsr techniques | |
| CN109951279A (en) | A kind of anonymous data storage method based on block chain and edge device | |
| CN101616000B (en) | Encryption method based on virtual optics and device therefor | |
| CN101582170B (en) | Remote sensing image encryption method based on elliptic curve cryptosystem | |
| Yang et al. | Dual traceable distributed attribute-based searchable encryption and ownership transfer | |
| US20190319802A1 (en) | Parallel processing techniques for hash-based signature algorithms | |
| Yoon et al. | A 55nm 50nJ/encode 13nJ/decode Homomorphic Encryption Crypto-Engine for IoT Nodes to Enable Secure Computation on Encrypted Data | |
| CN100527666C (en) | Asynmmetric ciphering and deciphering method and apparatus based on virtual wavefront coding | |
| CN115632782B (en) | Random number generation method, system and equipment based on SM4 counter mode | |
| US20230185905A1 (en) | Protection of authentication tag computation against power and electromagnetic side-channel attacks | |
| CN104376525A (en) | Image encryption method based on iteration non-linear double-random-phase encoding | |
| CN114629665B (en) | Hardware platform for trusted computing | |
| Liu et al. | Optimization of AES and RSA algorithm and its mixed encryption system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| DD01 | Delivery of document by public notice |
Addressee: Gao Juan Document name: Notification that Application Deemed not to be Proposed |
|
| ASS | Succession or assignment of patent right |
Owner name: SHENZHEN ESUN DISPLAY CO., LTD. Free format text: FORMER OWNER: SHENZHEN UNIVERSITY Effective date: 20121120 |
|
| C41 | Transfer of patent application or patent right or utility model | ||
| COR | Change of bibliographic data |
Free format text: CORRECT: ADDRESS; FROM: 518060 SHENZHEN, GUANGDONG PROVINCE TO: 518048 SHENZHEN, GUANGDONG PROVINCE |
|
| TR01 | Transfer of patent right |
Effective date of registration: 20121120 Address after: 518048, B301, three floor, No. 4001, Fu Qiang Road, Futian District, Guangdong, Shenzhen, Shenzhen, China, AB Patentee after: Shenzhen Esun Display Co., Ltd. Address before: 518060 Nanhai Road, Guangdong, Shenzhen, No. 3688, No. Patentee before: Shenzhen University |
|
| CP02 | Change in the address of a patent holder |
Address after: 518133 23rd floor, Yishang science and technology creative building, Jiaan South Road, Haiwang community Central District, Xin'an street, Bao'an District, Shenzhen City, Guangdong Province Patentee after: SHENZHEN ESUN DISPLAY Co.,Ltd. Address before: 518048 B301, 3rd floor, block AB, 4001 Fuqiang Road, Futian District, Shenzhen City, Guangdong Province Patentee before: SHENZHEN ESUN DISPLAY Co.,Ltd. |
|
| CP02 | Change in the address of a patent holder |