WO2002017535A1 - Apparatus and method for generating hash functions using chaotic device - Google Patents
Apparatus and method for generating hash functions using chaotic device Download PDFInfo
- Publication number
- WO2002017535A1 WO2002017535A1 PCT/KR2000/000848 KR0000848W WO0217535A1 WO 2002017535 A1 WO2002017535 A1 WO 2002017535A1 KR 0000848 W KR0000848 W KR 0000848W WO 0217535 A1 WO0217535 A1 WO 0217535A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- chaos
- bit
- signals
- hash
- signal
- Prior art date
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/001—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols using chaotic signals
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/06—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols the encryption apparatus using shift registers or memories for block-wise or stream coding, e.g. DES systems or RC4; Hash functions; Pseudorandom sequence generators
- H04L9/0643—Hash functions, e.g. MD5, SHA, HMAC or f9 MAC
Landscapes
- Engineering & Computer Science (AREA)
- Computer Security & Cryptography (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Power Engineering (AREA)
- Complex Calculations (AREA)
Abstract
An apparatus and method of generating a harsh function using chaos devices are disclosed. According to the present invention, an input information signal is converted to a real number, and chaos signals modulated by the information signal are fedback to the chaos devices. The chaos signals generated in the chaos devices are converted on a bit-by-bit basis by a bit conversion unit, and a hash vector is operated logically and rotated on the bit-by-bit basis in a hash vector rotation unit by means of the signals converted on the bit-by-bit basis. A comparison unit determines whether other information signals continue to be inputted and outputs the hash vector generated in the hash vector rotation unit as a hash value when the other information signals are not inputted any longer.
Description
APPARATUS AND METHOD FOR GENERATING HASH FUNCTIONS USING CHAOTIC DEVICE
Technical Field The present invention relates to an apparatus and method for generating a hash function, and more particularly, to an apparatus and method for generating a hash function, which is capable of easily and effectively generating hash values in a range within which chaos signals are not synchronized, using chaos devices.
Background Art
Recently, studies of a chaos theory which has been applied various fields of industry are actively performed.
Since a chaos device is sensitive to initial conditions, two substantially identical chaos devices become very different from each other and are changed promptly with different loci and values which do not have any interrelation with a lapse of time even at an extremely small variation of initial conditions. In other words, the chaos devices go into a non-periodic and unpredictable state with the lapse of time. Such a phenomenon of the chaos devices results from an initial sensitive response property which is called butterfly effect. Synchronization of a chaos system means that state variables of each chaos device become identical to one another in the chaos system comprising at least two same chaos devices each of which has a plurality of the state variables to control the chaos phenomenon. This synchronization technology is applicable to a various fields of industry. In particular, it is highly applicable to a security communication. Furthermore, a hash function as one measurement of cryptography has been recently generated so as to use it for an authentication, which is one of the main currents of cryptography. Generally, the hash function is known to include MD (Message Digest) family such as MD-2, MD-4 and MD-5, HAVAL, Snefru, N-Hash, SHA, PMD-V, RIPEMD, etc. All of these hash functions compress the contents of data by properly
mixing all data to represent all the data as single data having a size of 128 bits. In other words, the hash functions compress data by dividing data into the number of bit having a proper size and using calculation, transposition, replacement, inversion, etc. on a bit-by-bit basis. However, when the calculation on the bit-by-bit basis is executed by the conventional hash f nctions mentioned above, there is a problem that various types of data with identical calculation results can be generated. Namely, there are data which can generate same hash values even though bit order is changed because the addition of "0" to " 1 " produces the same value as the addition of "1" to "0" upon calculation thereof on the bit-by-bit basis. Further, even though data is distorted by use of nonlinear functions, there is a problem in that the data can be easily analyzed since methods which can measure how hash values are changed by a change of a piece of data were developed.
In addition, it is common that the conventional hash functions are substantially and roughly generated by manual work and used after evaluation of their performances. Accordingly, it is very difficult to design the hash function due to a problem that there is likelihood that erroneous information is authenticated and determined as correct information within a certain range even though a small error occurs.
Disclosure of the Invention
Accordingly, the present invention is conceived to solve the above problems in the prior art. An object of the present invention is to provide an apparatus and method for generating a hash function using chaos devices which is capable of automatically and easily generating an ideal hash function with the unlimited number of available functions as well as with complete different values and uniform distribution even at a single bit error.
In order to accomplish the above object, an apparatus for generating a hash function using chaos devices according to a first aspect of the present invention comprises a chaos signal generation means for generating chaos signals in which
variables are related functionally with one another; a data conversion means for converting an input information signal to a real number; a modulation means for modulating the chaos signals generated in the chaos signal generation means by means of the information signal, which is converted to the real number in the data conversion means and outputted from the data conversion means, and applying the chaos signals modulated by the information signal to the chaos signal generation means; a conversion means for converting the chaos signals generated in the chaos signal generation means on a bit-by-bit basis; a hash vector rotation means for operating logically and rotating a hash vector on the bit-by-bit basis with the converted signals; and a comparison means for determining whether other information signals continue to be inputted and outputting the hash vector generated in the hash vector rotation means as a hash value when other information signals are not inputted any longer.
Further, a method for generating a hash function using chaos devices according to a second aspect of the present invention comprises generating chaos signals from the chaos devices with variables related functionally with one another; converting an input infonnation signal to a real number; modulating the generated chaos signals by means of the information signal converted to the real number and applying the chaos signals modulated by the information signal to the chaos devices; converting the chaos signals generated from the chaos devices on a bit-by- bit basis; operating logically and rotating a hash vector on the bit-by-bit basis with the converted signals; determining whether other information signals continue to be inputted; and outputting the hash vector as a hash value when other information signals are not inputted any longer.
Brief Description of the Drawings
The above and other objects, features and other advantages of the present invention will be more clearly understood from the following detailed description taken in conjunction with the accompanying drawings, in which: FIG. 1 is a block diagram showing the configuration of an apparatus for
generating a hash function using chaos devices according to the present invention; and
FIG. 2 is a flowchart for illustrating a method for generating a hash function using chaos devices according to the present invention.
Best Mode for Carrying Out the Invention
Hereinafter, a preferred embodiment of an apparatus and method for generating a hash function using chaos devices according to the present invention will be described in detail with respect to the accompanying drawings. FIG. 1 is a block diagram showing the configuration of an apparatus for generating a hash function using chaos devices according to the present invention. Referring to FIG. 1, the hash function generator according to the present invention includes first and second chaos devices 30, 70 for generating chaos signal, in which variables are related functionally to one another. A data conversion unit 10 for converting an input information signal to a real number is connected to a modulation unit 20 for modulating the chaos signal generated in the first chaos device 30 by means of the information signal, which is converted to the real number in the data conversion unit 10 and outputted from the data conversion unit, and applying the chaos signal modulated by the information signal to the first chaos device 30. The modulation unit 20 is also connected to the first chaos device 30. The first chaos device 30 is connected to a first conversion unit 40 for converting the chaos signal generated in the first chaos device 30 on the bit-by-bit-basis. The first conversion unit 40 is connected to a first hash vector rotation unit 50 for operating logically and rotating a hash vector on the bit-by-bit basis with the signal converted in the first conversion unit 40. The first hash vector rotation unit 50 is connected to a first comparison unit 60.
The first comparison unit 60 determines whether other information signals continue to be inputted. Then, in a case where it is determined that the information signals continue to be inputted, the first comparison unit 60 modulates the chaos signal and feedbacks the modulated chaos signal to the first chaos device 30.
Otherwise, the first comparison unit 60 applies the chaos signal generated in the first chaos device 30 to the second chaos device 70 connected to the first comparison unit 60 without modulating the chaos signal. The second chaos device 70 is connected to a second conversion unit 80 for converting the chaos signal generated in the second chaos device 70 on the bit-by-bit basis. The second conversion unit 80 is connected to a second hash vector rotation unit 90 for operating logically and rotating a hash vector on the bit-by-bit basis with the bit signal converted in the second conversion unit 80. The second hash vector rotation unit 90 is connected to a second comparison unit 100. The second comparison unit 100 determines whether the chaos signal is calculated over a predetermined number of times, for example, 10 times, without inputting any information signals. Then, if it is determined that the chaos signal has been calculated over the predetermined number of times, the last hash vector is outputted as a hash value The first chaos device 30 and the second chaos device 70, the first bit conversion unit 40 and the second bit conversion 80, the first hash vector rotation unit 50 and the second hash vector rotation unit 90, and the first comparison unit 60 and the second comparison unit 100 are distinguished from each other, respectively, in the figure for the sake of convenience of description. However, each element in the pairs is actually the same element. In the meantime, logical operations of the bit signal and the hash vector on the bit-by-bit basis in the first and second hash vector rotation units 50, 90 are executed by at least one of an exclusive OR gate, a four- fundamental operation unit, a NOR gate, an OR gate and an AND gate. The modulation unit 20 includes a subtracter for subtracting the chaos signal generated in the first chaos device 30 from the input information signal, a sealer for scaling the output from the subtracter into any scaling value, and an adder for adding the output from the sealer to the chaos signal of the first chaos device. Alternatively, the modulation unit 20 may include a first sealer for scaling the chaos signal generated in the first chaos device into a first scaling value α , a second sealer for scaling the input information signal into a second scaling value β , and an adder for
adding up the outputs of the first and second sealers.
Now, the operation of the hash function generator using the chaos devices according to the present invention will be described.
First, the input information signal is converted to the real number (fn) in the data conversion unit 10, and then inputted into the modulation unit 20. Here, the information signal converted to the real number has a value between "0" and "1". The modulation unit 20 modulates the chaos signal (xn) generated in the first chaos device 30 by use of the converted information signal inputted from the data conversion unit 10 and feedbacks the modulated signal [xn + α (fn - xn)] or [α xn + β fn] (here, α and β are scaling values) to one or more variables or coefficients of the first chaos device 30 or applies an external signal to the first chaos device 30.
The variable of the chaos signal includes an integer, a real number or a complex number, and the modulated value of the modulated signal which has been modulated in the modulation unit 20 and fedback to the variable or coefficient of the first chaos device 30 also includes an integer, a real number or a complex number.
When the modulated signal is fedback to the first chaos device 30, the first chaos device 30 generates another new chaos signal which is different from the chaos signal generated initially. Here, the new chaos signal generated in the first chaos device 30 includes an information signal, and numerous hash values can also be obtained due to characteristics of the first chaos device 30.
Next, a method for generating a hash function using the chaos devices according to the present invention will be described with reference to FIG. 2.
First, the chaos devices 30, 70 are initialized (SI 01), and a hash vector is hen initialized (SI 02). When an information signal is inputted to the data conversion unit 10 (SI 03), the input information signal is data converted to a real number (SI 04). After data conversion, the chaos signal (xn) generated in the chaos device 30 is modulated by the information signal converted to the real number, and the modulated signal is fedback to the variable or coefficient of the chaos device 30 (S105).
Next, the chaos device 30 generates another new chaos signal different from the initially generated chaos signal, using the fedback modulated signal (SI 06). When the new chaos signal has been generated, the chaos signal is converted on the bit-by-bit basis (SI 07). Subsequently, a hash vector is logically operated and rotated on the bit-by-bit basis by using the signal converted on the bit-by-bit basis (SI 08). Next, it is determined as to whether other information signals continue to be inputted (SI 09).
If the other information signals continue to be inputted, the chaos signal generated in the chaos device 30 is modulated by the information signal inputted to the modulation unit 20 and is fedback to the chaos device 30 (SI 10). If the other information signals do not continue to be inputted, the variable value of the chaos signal outputted from the chaos device 30 is outputted as a hash value.
In order to obtain a desired hash value, the chaos signal is applied to the chaos device 70 without further modulation thereof (Si l l). Thereafter, the chaos signal generated in the chaos device 70 is converted on the bit-by-bit basis (SI 12), and a hash vector is then operated logically and rotated on the bit-by-bit basis by using the chaos signal converted on the bit-by-bit basis (SI 13). Next, it is determined as to whether steps Si l l, SI 12 and SI 13 have been performed then times (SI 15). Then, if steps Si l l, SI 12 and SI 13 have not yet been performed ten times, these steps are iteratively performed. If steps Si l l, SI 12 and SI 13 have been performed ten times, the hash vector is outputted as the hash value. Although the performance number of times of these steps is set to 10, it is not limited thereto.
As described above, if the information signal is added to the chaos signal whenever the operation is performed, unique hash values are obtained as resultant values depending on the characteristics of the information and the chaos devices. When a real value between "0" and "1" is taken and calculated in the chaos device 30, the hash values are also distributed uniformly between "0" and "1" depending on a value of the information signal. Accordingly, even when any one bit error occurs in the information signal, a completely different hash value is generated due
to an initial value sensitivity characteristics of the chaos device 30. Further, the number of bits corresponding to a length of the real value performed at the time of calculation is made. Since the number of bits corresponds to the number of bit of the hash value, the hash value with a large number of bits can be obtained depending on a bit value at the time of calculation.
Since the hash values have a uniform distribution theoretically, if a calculation is performed with 256 bits, 2256 hash values are made stochastically. When the number of variables of the chaos device 30 to be used is large, the hash values are increased accordingly. Therefore, the probability that the information signal may be erroneously perceived is 1/(2 n), where n is the number of variable.
Furthermore, the chaos device 30 cannot have an inverse function thereof due to its characteristics. Accordingly, although the hash value and initial value are known, the inverse function cannot be easily obtained. That is, if the number of variables is large, most variables are hidden. Thus, even if 10,000 times iterative calculations are performed, it is nearly impossible for anyone to change the variable since variable of more than 10,000 dimensions should be solved. Accordingly, owing to such a property, the chaos device can be used as a hash function and the resultant value thereof can be an ideal hash value.
Now, with the apparatus and method of generating the hash function using the chaos devices according to the present invention, theoretical background for generation of the hash function will be discussed using a simple logistic map. Such a logistic map is given as the following expression (1).
Xn+l = λ x„ (1 - xn) (1)
This expression is one of the well known expressions for representing a chaos phenomenon. The chaos is determined depending on the value of λ . For example, if λ is 3.9, the chaos device shows chaos. As one example of using the chaos device as the hash function, it is assumed that noise is a result of conversion of the information signal to the real number. Assuming that the variable is modulated by the noise, the chaos device can be given as the following expression (2).
Xn+i = λ [xn + α (fn - xn)](l - [xn + α (fn - xn)]) (2) where fn is a noise signal supposed to be the information signal.
If this expression has the property of hash function, the hash value must have a completely different value after performing iterative calculations corresponding to an amount of information even though a one bit difference occurs therein. However, this expression may generate the same hash value as data with no error in spite of one bit error generated depending on a value of a combination constant α for combining the noise and the value of chaos. This is called as synchronization of chaos. In other words, the two identical chaos devices generate different values because front portions thereof have different amount of data.
However, if rear portions have the same value of data, the two chaos devices generate the same values. This can be seen from the following explanation on how the two chaos devices generates the same values in a portion in which data values are identical although the chaos devices initially generate different values due to different data.
Assuming that a secondary chaos device having the same configuration as a primary chaos device is expressed as the following expression (3).
X'n+l = λ X'„ (1 - X'n) (3)
When noise as the same information signal is applied, the secondary chaos device is changed to the following expression (4). [X'n + α (fn - X'„)](l - [X'n + <X & - x'„)]) (4)
Here, when information signals are different from each other, xn and x'n have different values. However, when a portion with same data occurs, the two values become equal to each other due to the synchronization of chaos depending on the appropriate combination constant α . The two same values can be seen by obtaining a difference between two expressions given as the following expression
(5). yn+1 = λ (1-α ) [l-2(l- )xn - 2 fn]yn + (1-α )2y2 n. (5) where yn = xn - x'n This expression is a new form of nonlinear differential equation.
According to this expression, a parameter present before yn is modulated by xn and fn but a parameter of y2 n is not modulated. Therefore, the meaning of the expression 5 is to provide a new expression in which a parameter is modulated by variables of the primary chaos device. Here, all the values present before yn can be considered as the parameter. Furthermore, various methods for modulating other nonlinear system using noise signals as such are well known.
However, when parameters of the nonlinear system are modulated by the noise signal as such, the chaos device takes on a very complicated aspect. In other words, depending on the conditions of the respective parameters, the chaos device runs irregularly between a chaos signal and a value near "0", converges into "0", or shows chaos.
The running between the chaos signal and the value near "0" is called as on- off intermittency. Since this intermittency enlarges infinitely the length of its average laminar, threshold conditions that a difference between two variables is converged into "0" can occur.
When this threshold conditions is exceeded, a new chaos device made by the difference between variables of the two same chaos devices is instantly converged into "0". Accordingly, since a locus difference between the two chaos devices disappears when the difference between variables of the chaos devices becomes "0", loci of the chaos devices become equal to each other and thus are synchronized.
However, since the loci are not equal to each other if the length of the average laminar is not infinite, the function can be used as a hash function at this time. In other words, halfway occurrence of one bit error means that an initial value is changed once. The initial value changed once never returns to an original value.
From the above expressions, conditions that the length of the average laminar becomes infinite can be obtained theoretically. In other words, since the chaos devices are converged into each other with the combination constant in a region where the synchronization conditions of chaos are not satisfied, they can be
used as good hash functions. Also, conditions for producing the chaos phenomenon is present in a plurality of region from on-off intermittency to chaos.
In general, since a region of synchronization is constant, all the other regions can be used as hash function. Moreover, when a value of combination constant gets away from the synchronization region, there is no probability that the two hash values have the same values.
Due to the property of chaos device, once the same values are generated, since a difference between the expressions for two chaos devices gets "0." Thus, the value remains constant. However, as can be seen from the expression (5), when there is no probability of having "0" value, the chaos devices are never converged into each other and thus have completely different values so that they can be used as ideal hash functions.
The synchronization region of the chaos device may be generated when a value of Lyapunov exponent is negative. Therefore, the logistic map can be used as the hash function in a region where the chaos is not synchronized.
Now, a method of generating the hash function will be described below, using a simultaneous nonlinear difference equation such as the following expression (6).
Xn+1 = I 4 1Xn(l-Xnyn)+β iy2n(l- n)+V lZny2n l (mod 1) yn+1 = I 4α 2yn(l-yn)+β 2xn(l-z„xn)+V 2z3 nyn | (mod i) (6) zn+1 = I 4α 3xn(l-zn)+β 3x2„(l-yn)+Y 3x2nZn l (mod i) where in order that both the primary and secondary chaos devices take the value between "0" and "1," mod 1 functions to take a value below a decimal point when a value of the hash function exceeds " 1 " and to take a value below a decimal point after changing the value of the hash function into a positive value when the hash function value is a negative value.
Next, a method of modulating the system by using, as a noise, a real number converted from the information signal as in the logistic map in the above difference equation will be described. First, if the system is a 64-bit operating system, the information signal is
made into data with the unit of byte, using 64 bits as one byte. Accordingly, a sequence is decided based on the order of information. Also, since the expression 6 has three variables, nine coefficients and three equations, total 15 modulation values are generated. Then, 15 bytes of information signal as one group are fedback to the variables and coefficients of the chaos device or are added as an external signal.
If the information signal is fn k, k is an order up to 15th byte in each group and n is a group sequence. Thus, k is an integer from 1 to 15, and n is proportional to data length. An expression for feedbacking this information signal to the variables is given as the following expression (7).
Xn+H 4(tt l+f4n)x'n(l-X'„y,n)+(β l+f5n)y'2n(l- 'n)+(Y
| (mod 1)
Yn+H 4( 2+f7 n)y'n(l-y'„)+(β 2+f8 n)x'n(l-z, nx, n)+(γ 2+ Z |3 ny'n+fI4 n | (mod 1) (7)
Zn+H 4(tt 3+f10 n)z'n(l-z'n)+(β 3+fπn)z,2n(l-y'n)+(Y ^W n+f^n I (j-Oά ϊ where
3(f3n-zn), each being a result fedback to the variables.
How widely loci of resultant values of calculation are spread becomes a standard for using these equations as the hash functions. Results of these equations or functions have no correlation among them and no correlation with the information signal like the noise. Also, these functions should not generate synchronization. This is because a difference between bits in the front cannot be perceived when synchronization is generated by bits in the rear although the equations of the chaos device are halfway changed due to an error in the number of bit.
In order that such synchronization is not generated, a region where the chaos signals are not synchronized has to be obtained. The region where the chaos signals are not synchronized can be achieved by changing a value δ ; of the combination constant. Then, since a small error of bit generated halfway is spread by the initial value sensitivity, i.e., butterfly effect, xn, yn and zn finally generated have different values one, so that all of xn, yn and zn can be used as the hash values to implement an ideal hash function.
In addition, since this chaos device is subject to perturbation by the information signal, it has the same characteristics as the noise. Thus, an ideal hash function in which an overall locus is dispersed is generated. In order to use the expression (7) as the hash functions, a transmitting party and a receiving party promise each other to use the same initial values. Then, a resultant value generated by feedback of the same data by use of the same chaos device at the receiving party is equal to the hash value at the transmitting party. Alternatively, when the transmitting party transmits the initial value and the resultant value as the hash values to the receiving party, the receiving party can determine an initial value of the chaos device based on the received values and use the calculated result as the hash value.
Since the value of the variable was defined as the real number between "0" and "1," data with 64 bits should be first converted to the real number between "0" and "1," which is in turn fedback as the noise. In addition, since the calculation is actually performed at a very high speed, the hash values are promptly generated in an actual application. Further, the calculation of the hash function is iteratively performed together with a number of operations. Thus, the hash function should be obtained in order to modulate the information signal in an actual calculation. Although three dimensional equations have been used in the present invention, the order of the equations may be raised and some of the variables may be used as the hash values. In such a case, some variables remain hidden due to characteristic of nonlinear dynamics when obtaining the hash function. Thus, it is impossible to obtain the inverse function of the hash function. In addition, since the order of function increases as the number of times of the iterative performance increases, it is impossible to perform an inverse calculation. Further, it is nearly impossible to solve the inverse function when the order of the variables in the equation is not an integer but a real number. In other words, due to noninvertible characteristics of the chaos device, the hash function cannot be actually found through such an analysis of the chaos device.
Accordingly, it is impossible to modulate the data.
In conclusion, the present invention is characterized in that the number of bit of the hash value can be randomly handled. A conventional hash function has a fixed number of operation in calculation. According to the present invention, however, the hash value can be increased by the number of variables added to the number of bit in calculation. Further, there is an advantage in that the calculation speed is not reduced in spite of the increased hash values.
Furthermore, an increased number of variables makes decoding more difficult and leads to an increased number of bits of hash values. Since different hash values are generated depending on the initial values when the initial values or coefficient values of the variables of the chaos device are transmitted along with the hash values, the hash functions dependent on the initial values can be obtained. Also, since the number of hash function itself can be infinitely increased depending on changes in the coefficient values, numerous hash functions can be generated although the number of variables of the chaos device, which is a nonlinear dynamics system, is increased. Particularly, since the speed of calculation is not affected even by an increased number of bits of the hash values, the number of bits of the hash function can be increased without limit. That is, the number of bits of the hash function is dependent on the number of variables and the number of bits to be calculated. This is because an increased number of bits to be calculated leads to an increased amount of data for causing the hash values to be changed at once. Therefore, the probability of birth-day attack can be sufficiently decreased without limit by increasing the number of bits. Furthermore, the present invention is a convenient method capable of easily generating the hash function by almost chaos devices, stochastic systems, or random number generation methods, rather than a method of substituting the hash function manually one by one.
Industrial Applicability
As described above, an apparatus and a method of generating a hash function using chaos devices according to the present invention is characterized in
that the information signal is converted to a real number and then added to the chaos devices, like a method of synchronizing the chaos by a noise. Such an addition may include a feedback of the information signal to variables or coefficients, an addition to the chaos devices as an external signal, or a combination thereof. Accordingly, after initial values and coefficients of the chaos devices or an amount of scaling or combination of a quantity to be added in the chaos devices are determined as the initial values and then the information signal is fedback to the chaos devices, all values of the last or halfway chaos devices are transmitted. Thereafter, the receiving party receives the transmitted values and then checks enOrs of the information signal by substituting the same initial values for the chaos devices and confirming as to whether the last values are equal to the received values.
Claims
1. An apparatus for generating a hash function using chaos devices, comprising: a chaos signal generation means for generating chaos signals in which variables are related functionally with one another; a data conversion means for converting an input information signal to a real number; a modulation means for modulating the chaos signals generated in the chaos signal generation means by means of the information signal, which is converted to the real number in the data conversion means and outputted from the data conversion means, and applying the chaos signals modulated by the information signal to the chaos signal generation means; a conversion means for converting the chaos signals generated in the chaos signal generation means on a bit-by-bit basis; a hash vector rotation means for operating logically and rotating a hash vector on the bit-by-bit basis with the converted signals; and a comparison means for determining whether other information signals continue to be inputted and outputting the hash vector generated in the hash vector rotation means as a hash value when other information signals are not inputted any longer.
2. The apparatus as claimed in claim 1, wherein the hash vector rotation means comprises a logical operation unit for executing an exclusive OR operation, an OR operation, a NOR operation, an AND operation or a four-fundamental operation, on the bit-by-bit basis, for the chaos signal and the hash vector generated on the bit-by- bit basis.
3. The apparatus as claimed in claim 1, wherein the modulation means comprises a first sealer for scaling the information signal, a second sealer for scaling the chaos signals generated in the chaos signal generation means, and an adder for adding the outputs of the first and second sealers to the chaos signals.
4. The apparatus as claimed in claim 1, wherein the modulation means comprises a first sealer for scaling the information signal, a subtracter for subtracting at least one variable signal of the chaos signals from the output of the first sealer, and a second sealer for scaling the output of the subtracter and feedbacking the scaled output to at least one variable corresponding to the at least one variable signal.
5. A method for generating a hash function using chaos devices, comprising the steps of: generating chaos signals from the chaos devices with variables related functionally with one another; converting an input information signal to a real number; modulating the generated chaos signals by means of the information signal converted to the real number and applying the chaos signals modulated by the information signal to the chaos devices; converting the chaos signals generated from the chaos devices on a bit-by- bit basis; operating logically and rotating a hash vector on the bit-by-bit basis with the converted signals; determining whether other information signals continue to be inputted; and outputting the hash vector as a hash value when other information signals are not inputted any longer.
6. The method as claimed in claim 5, further comprising the steps of: when other information signals are not inputted any longer, performing, by a predetermined number of times, the steps of applying the chaos signals to the chaos devices without any modulation thereof, converting the chaos signals generated from the chaos devices- on the bit-by-bit basis, and operating logically and rotating, on the bit-by-bit basis, the hash vector converted on the bit-by-bit basis; and outputting the hash vector as a hash value.
7. The method as claimed in claim 5, wherein the hash value is transposed, replaced or inversed when used.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| PCT/KR2000/000848 WO2002017535A1 (en) | 2000-08-02 | 2000-08-02 | Apparatus and method for generating hash functions using chaotic device |
| AU2000261881A AU2000261881A1 (en) | 2000-08-02 | 2000-08-02 | Apparatus and method for generating hash functions using chaotic device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| PCT/KR2000/000848 WO2002017535A1 (en) | 2000-08-02 | 2000-08-02 | Apparatus and method for generating hash functions using chaotic device |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| WO2002017535A1 true WO2002017535A1 (en) | 2002-02-28 |
Family
ID=19198248
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| PCT/KR2000/000848 WO2002017535A1 (en) | 2000-08-02 | 2000-08-02 | Apparatus and method for generating hash functions using chaotic device |
Country Status (2)
| Country | Link |
|---|---|
| AU (1) | AU2000261881A1 (en) |
| WO (1) | WO2002017535A1 (en) |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5048086A (en) * | 1990-07-16 | 1991-09-10 | Hughes Aircraft Company | Encryption system based on chaos theory |
| US5412730A (en) * | 1989-10-06 | 1995-05-02 | Telequip Corporation | Encrypted data transmission system employing means for randomly altering the encryption keys |
| US6018582A (en) * | 1996-01-05 | 2000-01-25 | France Telecom | Optical transmission system implementing encrypting by deterministic chaos |
-
2000
- 2000-08-02 WO PCT/KR2000/000848 patent/WO2002017535A1/en active Application Filing
- 2000-08-02 AU AU2000261881A patent/AU2000261881A1/en not_active Abandoned
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5412730A (en) * | 1989-10-06 | 1995-05-02 | Telequip Corporation | Encrypted data transmission system employing means for randomly altering the encryption keys |
| US5048086A (en) * | 1990-07-16 | 1991-09-10 | Hughes Aircraft Company | Encryption system based on chaos theory |
| US6018582A (en) * | 1996-01-05 | 2000-01-25 | France Telecom | Optical transmission system implementing encrypting by deterministic chaos |
Also Published As
| Publication number | Publication date |
|---|---|
| AU2000261881A1 (en) | 2002-03-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US5600720A (en) | Encryption apparatus, communication system using the same and method therefor | |
| JP4786531B2 (en) | Encryption system, encryption device, decryption device, program, and integrated circuit | |
| Nevelsteen et al. | Software performance of universal hash functions | |
| EP2351287B1 (en) | Method of generating a cryptographic key, network and computer program therefor | |
| US8165287B2 (en) | Cryptographic hash functions using elliptic polynomial cryptography | |
| KR100513127B1 (en) | Elliptic curve transformation device, utilization device and utilization system | |
| US6088798A (en) | Digital signature method using an elliptic curve, a digital signature system, and a program storage medium having the digital signature method stored therein | |
| US8189771B2 (en) | Hash functions with elliptic polynomial hopping | |
| JPH04250490A (en) | Encrypting system based on chaos theory | |
| CN102687184A (en) | Representative calculation system, method, request device, program and recording medium | |
| CN111444547A (en) | Method, apparatus and computer storage medium for data integrity attestation | |
| US6480606B1 (en) | Elliptic curve encryption method and system | |
| CN112926075B (en) | SM9 key generation method, device, equipment and storage medium | |
| WO2002017535A1 (en) | Apparatus and method for generating hash functions using chaotic device | |
| US6477556B1 (en) | Method and apparatus for arithmetic operation and recording medium of method of operation | |
| Fúster-Sabater et al. | Linear solutions for cryptographic nonlinear sequence generators | |
| CN112019327B (en) | White box realization method and device, electronic equipment and computer storage medium | |
| CN114513780A (en) | Wireless communication network encryption system based on random key | |
| JP2725610B2 (en) | Secret key encryption method and apparatus | |
| Yao et al. | Generalized NLFSR transformation algorithms and cryptanalysis of the class of espresso-like stream ciphers | |
| KR100291050B1 (en) | Method and Apparatus for Producing a Hash Using Chaostic System | |
| Zellagui et al. | Secure MD4 Hash Function Using Henon | |
| EP3576338A1 (en) | High-rate multi-block-length hash function based on block ciphers | |
| CN114422130B (en) | Quantum encryption method based on quantum power function confusion | |
| Chernenko et al. | Encryption Method for Systems with Limited Computing Resources |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| AK | Designated states |
Kind code of ref document: A1 Designated state(s): AT AU BG BR CA CH CN CZ DE DK ES FI GB HU ID IL IN IS JP MX NO NZ PL PT RO RU SE SG US YU |
|
| AL | Designated countries for regional patents |
Kind code of ref document: A1 Designated state(s): AM AZ BY KG KZ MD RU TJ TM AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE |
|
| 121 | Ep: the epo has been informed by wipo that ep was designated in this application | ||
| REG | Reference to national code |
Ref country code: DE Ref legal event code: 8642 |
|
| 32PN | Ep: public notification in the ep bulletin as address of the adressee cannot be established |
Free format text: NOTING OF LOSS OF RIGHTS PURSUANT TO RULE 69(1) EPC |
|
| 122 | Ep: pct application non-entry in european phase | ||
| NENP | Non-entry into the national phase |
Ref country code: JP |