Abstract:
An integrated cryptographic apparatus providing confidentiality and integrity includes an integrated cryptographic module including confidentiality and integrity. Further, the integrated cryptographic apparatus includes a hash function unit for detecting whether a message is modified by using the integrated cryptographic module. Furthermore, the integrated cryptographic apparatus includes a block cipher unit for constructing a data encryption algorithm by using the integrated cryptographic module.

Description:
CROSS-REFERENCE TO RELATED APPLICATION(S) 
       [0001]    The present invention claims priority of Korean Patent Application No. 10-2010-0133553, filed on Dec. 23, 2010, which is incorporated herein by reference. 
       FIELD OF THE INVENTION 
       [0002]    The present invention relates to an integrated cryptographic technology; and, more particularly, to an integrated cryptographic module and a method thereof providing confidentiality and integrity, which is suitable for designing an integrated cryptographic module capable of using both a block cipher providing confidentiality and a hash function guaranteeing integrity in a resource-limited environment such as RFID (radio frequency identification) or USN (ubiquitous sensor network) in an ubiquitous computing environment. 
       BACKGROUND OF THE INVENTION 
       [0003]    Generally, a cryptographic hash function is a compression function, which receives a bit string of arbitrary length and outputs a bit string of fixed length. The cryptographic hash function is for increasing security and efficiency of a cryptographic system. 
         [0004]    The cryptographic hash function is used in various cryptographic systems such as internet banking, digital signature, message authentication code, key exchange algorithm, key generation algorithm, and pseudo random number generator, and the like. In the sense that safety of such cryptographic systems is based on that of hash function, it is important to design a secure hash function. 
         [0005]    Currently, NIST (National Institute of Standards and Technology) recommends using SHA-224/256/384/512, outputs of which have 224, 256, 384, and 512 bits respectively, instead of MD5 or SHA-1. The NIST is currently undertaking the Cryptographic Hash Project for developing SHA-3 for 6 years from 2007 to 2012. As shown in the NIST&#39;s project, it is very necessary to develop a new secure and efficient hash function. 
         [0006]    Meanwhile, block cipher, which is most commonly used among symmetric key algorithms, is an algorithm for ensuring confidentiality by encrypting data using a secret key shared between a transmitter and a receiver. 
         [0007]    A representative block cipher is AES (Advanced Encryption Standard), which is the federal standard cipher. The AES is the next-generation standard algorithm to replace the DES (Data Encryption Standard), which has been used over 20 years as the federal standard cipher. The DES is developed by IBM in 1972 to protect computer data under the supervision of NBS (National Bureau of Standards), which is a former body of the NIST. 
         [0008]    Since granted as the federal standard and re-granted every five years, the DES had existed as the standard. However, after 1997, as the security problem of the DES came to the fore, NIST started to develop AES as a replacement of the DES. AES has been granted as the US federal standard cryptographic algorithm, and been used worldwide. 
         [0009]    To construct a secure cryptographic system, a block cipher and a hash function ensuring confidentiality and integrity are necessary. However, according to conventional cryptographic systems, a block cipher and a hash function are constructed as separate algorithms, and it is difficult to implement two primitives at the same time under a resource-limited environment such as RFID/USN of a ubiquitous computing environment. 
         [0010]    For example, even though the hash function SHA and block cipher AES are US federal standard cryptographic algorithms, those two algorithms need to be implemented independently because design methods thereof are different from each other. 
       SUMMARY OF THE INVENTION 
       [0011]    In view of the above, the present invention provides an integrated cryptographic module and a method thereof providing confidentiality and integrity, which is suitable for designing an integrated cryptographic module capable of using both a block cipher providing confidentiality and a hash function guaranteeing integrity in a resource-limited environment such as RFID (radio frequency identification) or USN (ubiquitous sensor network) of an ubiquitous computing environment. 
         [0012]    In accordance a first aspect of the present invention, there is provided an integrated cryptographic apparatus providing confidentiality and integrity including: an integrated cryptographic module including a confidentiality and an integrity performances; a hash function unit for detecting whether a message is modified by using the integrated cryptographic module; and a block cipher unit for constructing a data cryptographic algorithm by using the integrated cryptographic module. 
         [0013]    In accordance with a second aspect of the present invention, there is provided an integrated cryptographic method providing confidentiality and integrity including: generating a hash function for detecting whether a message is modified by using an integrated cryptographic module; and generating a block cipher for constructing a data encryption algorithm by using the integrated cryptographic module. 
         [0014]    In accordance with an embodiment of the present invention, it is possible to provide confidentiality and integrity by using a block cipher and a hash function in a resource-limited environment such as RFID (radio frequency identification) or USN (ubiquitous sensor network) in an ubiquitous computing environment. Further, it is possible to provide flexibility of selectively using the block cipher or the hash function in the integrated cipher module. 
     
    
     
       BRIEF DESCRIPTION OF THE DRAWINGS 
         [0015]    The objects and features of the present invention will become apparent from the following description of embodiments, given in conjunction with the accompanying drawings, in which: 
           [0016]      FIG. 1  is a basic structural diagram of an integrated cryptographic module ICM in accordance with an embodiment of the present invention; 
           [0017]      FIG. 2  is a block diagram showing a structure of a hash function unit providing integrity in accordance with an embodiment of the present invention; 
           [0018]      FIG. 3  is a diagram showing a message compressing unit in accordance with an embodiment of the present invention; 
           [0019]      FIG. 4  is a diagram showing a state updating function used in a message compressing unit and a hash value output unit in accordance with an embodiment of the present invention; 
           [0020]      FIG. 5  is a diagram showing a hash value output unit of a hash function unit in accordance with an embodiment of the present invention; and 
           [0021]      FIG. 6  is a diagram showing a block cipher unit providing confidentiality in accordance with an embodiment of the present invention. 
       
    
    
     DETAILED DESCRIPTION OF THE EMBODIMENTS 
       [0022]    Embodiments of the present invention will be described herein, including the best mode known to the inventors for carrying out the invention. Variations of those preferred embodiments may become apparent to those of ordinary skill in the art upon reading the foregoing description. The inventors expect skilled artisans to employ such variations as appropriate, and the inventors intend for the invention to be practiced otherwise than as specifically described herein. Accordingly, this invention includes all modifications and equivalents of the subject matter recited in the claims appended hereto as permitted by applicable law. Moreover, any combination of the above-described elements in all possible variations thereof is encompassed by the invention unless otherwise indicated herein or otherwise clearly contradicted by context. 
         [0023]    In the following description of the present invention, if the detailed description of the already known structure and operation may confuse the subject matter of the present invention, the detailed description thereof will be omitted. The following terms are terminologies defined by considering functions in the embodiments of the present invention and may be changed operators intend for the invention and practice. Hence, the terms should be defined throughout the description of the present invention. 
         [0024]    Combinations of each step in respective blocks of block diagrams and a sequence diagram attached herein may be carried out by computer program instructions. Since the computer program instructions may be loaded in processors of a general purpose computer, a special purpose computer, or other programmable data processing apparatus, the instructions, carried out by the processor of the computer or other programmable data processing apparatus, create devices for performing functions described in the respective blocks of the block diagrams or in the respective steps of the sequence diagram. 
         [0025]    Since the computer program instructions, in order to implement functions in specific manner, may be stored in a memory useable or readable by a computer aiming for a computer or other programmable data processing apparatus, the instruction stored in the memory useable or readable by a computer may produce manufacturing items including an instruction device for performing functions described in the respective blocks of the block diagrams and in the respective steps of the sequence diagram. Since the computer program instructions may be loaded in a computer or other programmable data processing apparatus, instructions, a series of processing steps of which is executed in a computer or other programmable data processing apparatus to create processes executed by a computer so as to operate a computer or other programmable data processing apparatus, may provide steps for executing functions described in the respective blocks of the block diagrams and the respective sequences of the sequence diagram. 
         [0026]    Moreover, the respective blocks or the respective sequences may indicate modules, segments, or some of codes including at least one executable instruction for executing a specific logical function(s). In several alternative embodiments, is noticed that functions described in the blocks or the sequences may run out of order. For example, two successive blocks and sequences may be substantially executed simultaneously or often in reverse order according to corresponding functions. 
         [0027]    Hereinafter, embodiments of the present invention will be described with reference to the accompanying drawings which form a part hereof. 
         [0028]      FIG. 1  is a basic structural diagram of an integrated cryptographic module ICM according to an embodiment of the present invention. 
         [0029]    Referring to  FIG. 1 , an integrated cryptographic module ICM  100  performs an operation as shown in Table 1, receiving inputs X=X 1 ∥X 2 ∥ . . . ∥X 8 , Y, Ctr 0 , Ctr 1 , Sel 0 , and Sel 1 . 
         [0030]    Herein, X is 256 bits, X i (1≦i≦8), Y, Ctr 0 , and Ctr 1  are 32 bit word, Sel 0 , Sel 1  are 1 bit, and ∥ is a concatenation operation. 
         [0000]    
       
         
               
             
               
               
             
           
               
                 TABLE 1 
               
               
                   
               
             
             
               
                 ICM(X,Y,Ctr 0 ,Ctr 1 ,Sel 0 ,Sel 1 ) 
               
             
          
           
               
                   
                 X 8  = X 8  ⊕ MUX(Y,Ctr 0 ,Sel 0 )X 3  = X 3  ⊕ MUX(X 8 ,Ctr 0 ,Sel 0 ) 
               
               
                   
                 X 7  = X 7  ⊕ MUX(X 4 ,Ctr 1 ,Sel 1 ); X 1  = X 1  ⊕G(X 3 ); X 5  = X 5  ⊕G(X 7 ) 
               
               
                   
                 X 3  = X 3  ⊕ X 1   &lt;&lt;&lt;11 ; X 7  = X 7  ⊕ X 5   &lt;&lt;&lt;17 ; 
               
               
                   
                 T = X 8 ; X 8  = X 7 ; X 7  = X 6 ; X 6  = X 5   
               
               
                   
                 X 5  = X 4 ; X 4  = X 3 ; X 3  = X 2 ; X 1  = T 
               
               
                   
                   
               
             
          
         
       
     
         [0031]    In Table 1, T is 32-bit word-temporary variable, x &lt;&lt;&lt;r  is an operation for circularly moving x by s bits to the left, ⊕ is an operation for XOR among 32-bit words. 
         [0032]    MUX(x,y,z) is a function for outputting x when z is 0, and outputting y when z is 1. A function G is for receiving a 32-bit word as an input and outputting a 32-bit word as an output. As the function G, a function having good confusion and diffusion property can be used. The function G can be constructed by combining S-box, which is a representative substitution function for confusion performance, and a permutation function for diffusion property. 
         [0033]    Table 2 shows an example of performing 4×4 S-box operation for each 4-bit block generated by dividing 32-bit word input into 8 4-bit blocks. 
         [0000]    
       
         
               
             
               
               
               
               
               
               
               
               
               
               
               
               
               
               
               
               
               
             
           
               
                 TABLE 2 
               
             
             
               
                   
               
               
                 S-box(x 0 , x 1 , x 2 , x 3 ) = (x 0 ′, x 1 ′, x 2 ′, x 3 ′) 
               
             
          
           
               
                 input 
                 0 
                 1 
                 2 
                 3 
                 4 
                 5 
                 6 
                 7 
                 8 
                 9 
                 a 
                 b 
                 c 
                 d 
                 e 
                 F 
               
               
                   
               
               
                 output 
                 8 
                 4 
                 2 
                 d 
                 1 
                 f 
                 7 
                 a 
                 5 
                 9 
                 b 
                 e 
                 6 
                 c 
                 0 
                 3 
               
               
                   
               
             
          
         
       
     
         [0034]    Table 3 is an example of a permutation function for diffusion property with 32-bit word input divided into eight 4-bit blocks. 
         [0000]    
       
         
               
             
               
               
               
             
           
               
                 TABLE 3 
               
               
                   
               
             
             
               
                 DL(w 0 ,w 1 ,w 2 ,w 3 ,w 4 ,w 5 ,w 6 ,w 7 ) = (w 0 ′,w 1 ′,w 2 ′,w 3 ′,w 4 ′,w 5 ′,w 6 ′,w 7 ′) 
               
             
          
           
               
                   
                 w 0 ′ = w 1  ⊕ w 2  ⊕ w 3  ⊕ w 4  ⊕ w 7   
                  w 1 ′ = w 0  ⊕ w 2  ⊕ w 3  ⊕ w 4  ⊕ w 5   
               
               
                   
                 w 2 ′ = w 0  ⊕ w 1  ⊕ w 3  ⊕ w 5  ⊕ w 6   
                  w 3 ′ = w 0  ⊕ w 1  ⊕ w 2  ⊕ w 6  ⊕ w 7   
               
               
                   
                 w 4 ′ = w 1  ⊕ w 2  ⊕ w 3  ⊕ w 4  ⊕ w 5   
                  w 5 ′ = w 0  ⊕ w 2  ⊕ w 4  ⊕ w 5  ⊕ w 6  ⊕ w 7   
               
               
                   
                 w 6 ′ = w 0  ⊕ w 1  ⊕ w 3  ⊕ w 4  ⊕ w 6  ⊕ w 7   
                 w 7 ′ = w 0  ⊕ w 1  ⊕ w 2  ⊕ w 4  ⊕ w 5  ⊕ w 7   
               
               
                   
                   
               
             
          
         
       
     
         [0035]    Meanwhile, circular movement amounts used in a left-circular-movement operation in Table 1 are fixed constant different with each other, and the amounts are not limited to certain values, but can be selected among values having good diffusion property in view of cryptography. 
         [0036]      FIG. 2  is a block diagram showing a structure of a hash function unit providing integrity in accordance with an embodiment of the present invention. 
         [0037]    Referring to  FIG. 2 , a hash function unit  200  providing integrity includes a message pre-processing unit  210 , a message compressing unit  220 , and a hash value output unit  230 . 
         [0038]    The hash function unit  200  uses a 32-bit word operation. Therefore, in the first step, the message pre-processing unit  210  converts a bit string of arbitrary length into a 32-bit word array. In the second step, the message compressing unit  220  compresses the message converted into 32-bit word. In the third step, the hash value output unit  230  outputs a hash value of a length that a user desires to be. 
         [0039]    In detail, the message pre-processing unit  210  converts a bit string of arbitrary length into a 32-bit word array. The message pre-processing unit  210  regards a 32-bit word array as a 4-byte string, so that a first byte becomes an most significant byte of a word. 
         [0040]    For example, the bit string 10101101 01101011 11001001 10101110 becomes a 32-bit word W=ad6bc9ae. This is the same as a result of type casting 4-byte string in a type of ‘unsigned long’ in a big-endian computer. 
         [0041]    When converting a bit string of an arbitrary length into 32-bit word array, it may be repeated to convert a first 4-byte into a first word, and a second 4-byte into second word, with regarding the bit string as a byte array. 
         [0042]    For example, a bit string 10101101 01101011 11001001 10101110 00111111 01011001 01000110 becomes a 32-bit word array ad6bc9ae 3f594600. 
         [0043]    If an input message is not a 32-bit multiple, 1000 . . . 000 can be filled in the input message to make the input message a 32-bit multiple. For example, when an input message is given as 10100010 0011101 11100101 01101011 11001001 10001010 10011101, the length of the input message is 56, 1 and 7 0&#39;s can be added to the input message to make the input message 64-bit. Therefore, the 32-bit word array of 64-bit can be given to be a239e56b c98a9d80. 
         [0044]    As shown in  FIG. 3 , the message compressing unit  220  sequentially compresses the message word array converted into 32-bit by the message pre-processing unit  210 , by using a state updating function f  222 . If it is assumed that a 32-bit message word array converted by the message pre-processing unit  210  to be X=X 1 ∥X 2 ∥ . . . X t , the message compressing unit  220  can be defined as Table 4. Herein, M i (1≦i≦t) is a 32-bit word. 
         [0000]    
       
         
               
               
             
               
               
             
               
               
             
           
               
                   
                 TABLE 4 
               
               
                   
                   
               
             
             
               
                   
                 MCP(M) 
               
             
          
           
               
                   
                 X 1  = IV 1 ; X 2  = IV 2 ; X 3  = IV 3 ; X 4  = IV 4 ; 
               
               
                   
                 X 5  = IV 5 ; X 6  = IV 6 ; X 7  = IV 7 ; X 8  = IV 8 ; 
               
               
                   
                 for from i = 1 to i = t 
               
             
          
           
               
                   
                 f(X,M i ); 
               
               
                   
                   
               
             
          
         
       
     
         [0045]    In Table 4, IV 1 , . . . IV 8  are initial vectors fixed to be 32-bit words and are not limited to certain values. 
         [0046]    The state updating function f  222  is as shown in  FIG. 4 , and can be constructed by using the integrated cryptographic module ICM  100 . The state updating function f  222  updates a 256-bit X=X∥ 1 ∥X 2 ∥ . . . ∥X 8  (herein, M i (1≦i≦8) is a 32-bit word) by using the integrated cryptographic module ICM  100 . 
         [0047]    The state updating function f  222  can be defined as Table 5. 
         [0000]    
       
         
               
               
             
               
               
             
               
               
             
               
               
             
           
               
                   
                 TABLE 5 
               
               
                   
                   
               
             
             
               
                   
                 f( X,M i  ) 
               
             
          
           
               
                   
                 ICM( X,M i ,Ctr 0,1 ,Ctr 1,1 ,0,0 ); 
               
             
          
           
               
                   
                 for from i = 2 to i =R H   
               
             
          
           
               
                   
                 ICM( X,M i ,Ctr 0,i ,Ctr 1,i ,1,0 ); 
               
               
                   
                   
               
             
          
         
       
     
         [0048]    The state updating function f  222  updates X by applying the integrated cryptographic module ICM  100  for R H -times repeatedly to inputs X and M i . Herein Ctr 0,i  and Ctr 1,i (1≦i≦R H ) are fixed constants different with each other, and are not limited to certain values. R H  may be selectively used in a range that security of the hash function unit  200  providing integrity can be ensured. 
         [0049]    The hash value output unit  230  is as shown in  FIG. 5 , and is a function for outputting a hash value of a desired length, after a compression by the message compressing unit  220 . The hash value output unit  230  outputs a 32-bit word h i  (1≦i≦8) with additionally performing the state updating function f  222  by the desired length of hash function. The hash value output unit  230  can be defined as Table 6. 
         [0000]    
       
         
               
               
             
               
               
             
               
               
             
               
               
             
           
               
                   
                 TABLE 6 
               
               
                   
                   
               
             
             
               
                   
                 HOP(X) 
               
             
          
           
               
                   
                 Out h 1  ← X 1 ; 
               
               
                   
                 if i &gt; 1 
               
             
          
           
               
                   
                 for from i = 2 to i =H  Length   
               
             
          
           
               
                   
                 f( X,0 ); 
               
               
                   
                 Out h i  ← X 1 ; 
               
               
                   
                   
               
             
          
         
       
     
         [0050]    When a length of a hash value is 32-bits, h 1  may be output being converted into bit string, as a hash value. When a length of a hash value is 64-bits, h 1 ∥h 2  is output being converted into bit string. When a length of a hash value is 224 bits, h 1 ∥h 2 ∥h 3 ∥h 4 ∥h 5 ∥h 6 ∥h 7  is output being converted into bit array. In this case, each output variable h i  satisfies h i =h i1 h i2 h i3 h i4  (wherein, h ij  is 1-byte), the hash value may be converted as following byte array. 
         [0000]    h 11 h 12 h 13 h 14 h 21 h 22 h 23 h 24 h 31 h 32 h 33 h 34 h 41 h 42 h 43 h 44 h 51 h 52 h 53 h 54 h 61 h 62 h 63 h 64 h 71 h 72 h 73 h 74    
         [0051]    Hereinafter, a block cipher  300  providing confidentiality will be explained in detail step by step. The block cipher  300  is as shown in  FIG. 6 , and is a function for receiving a 128-bit plaintext P=P 1 ∥P 2 ∥P 3 ∥P 4  and a 128-bit key K=K 1 ∥K 2 ∥K 3 ∥K 4  as inputs and outputting a 128-bit ciphertext C=C 1 ∥C 2 ∥C 3 ∥C 4 . The block cipher  300  is defined as Table 7 by using the integrated cryptographic module ICM  100 . 
         [0000]    
       
         
               
               
             
               
               
             
               
               
             
               
               
             
               
               
             
           
               
                   
                 TABLE 7 
               
               
                   
                   
               
             
             
               
                   
                 BC( P,C,K ) 
               
             
          
           
               
                   
                 X 1  ← P 1 ; X 3  ← P 2 ; X 5  ← P 3 ; X 7  ← P 4 ; 
               
               
                   
                 X 2  ← K 1 ; X 4  ← K 2 ; X 6  ← K 3 ; X 8  ← K 4 ; 
               
             
          
           
               
                   
                 for from i = 1 to i =R B   
               
             
          
           
               
                   
                 ICM( X,0,Ctr 0,i ,Ctr 1,i ,0,1 ); 
               
               
                   
                 ICM( X,0,Ctr 0,i ,Ctr 1,i ,0,0 ); 
               
             
          
           
               
                   
                 C 1  ← X 3 ; C 2  ← X 5 ; C 3  ← X 7 ; C 4  ← X 1 ; 
               
               
                   
                   
               
             
          
         
       
     
         [0052]    In Table 7, Ctr i , Ctr 0,i  and Ctr 1,i  (wherein, 1≦i≦R B ) are fixed constants different with each other, and are not limited to certain values. R B  may be selectively used in a range that security of the block cipher  300  providing confidentiality can be ensured. 
         [0053]    As explained above, in accordance with an embodiment of the present invention, there is provided an integrated cryptographic module capable of using both a block cipher providing confidentiality and a hash function guaranteeing integrity in a resource-limited environment such as RFID (radio frequency identification) or USN (ubiquitous sensor network) in an ubiquitous computing environment. 
         [0054]    An integrated cryptographic module according to an embodiment of the present invention, can construct a more efficient cryptographic system than conventional systems which need two independent algorithms. Moreover, the module can be implemented efficiently and securely with a simple operation in a limited environment such as RFID (radio frequency identification) or USN (ubiquitous sensor network) in an ubiquitous computing environment. 
         [0055]    While the invention has been shown and described with respect to the embodiments, it will be understood by those skilled in the art that various changes and modification may be made without departing from the scope of the invention as defined in the following claims.