1. A method for performing a compression operation for fast message hashing, comprising the steps of: receiving a message and generating a plurality of expanded messages using the received message; receiving chain variable data and converting the chain variable data into initial state data which is used in the following compression operation; generating a final value of the state data by iterating a combination function and a step function using the state data and the plurality of expanded messages; and updating the chain variable data using the state data of the final value, wherein the updated chain variable data is used to generate a final hash value, wherein: the plurality of expanded messages is (R+1) messages ranging from W 0 to W R , the message M is a concatenation of 32 sub messages ranging from M[0] to M[31], and the plurality of expanded messages is generated based on Equation 1 below: the plurality of expanded messages is (R+1) messages ranging from W 0 to W R , where R is an integer equal to or larger than 1, 
 W r =W r [0]∥ W r [1]∥. .. ∥ W r [15],0≦ r≦R (1) where W r is an (r+1)-th expanded message of the plurality of expanded messages, W r is a concatenation of 16 sub expanded messages, and, for x, i.e., an integer equal to or larger than 0 and equal to or smaller than 15, W r [x] is an (x+1)-th sub expanded message of W r , wherein the sub expanded messages are generated based on Equations 2, 3 and 4 below: 
 W 0 [ i ]= M [ i ], 0≦ i≦ 15  (2) 
 W 1 [ i ]= M [ i +16], 0≦ i≦ 15  (3) 
 W r [ i ]= W r −2[τ( i )] W r −1[ i ], 2≦ r≦R, 0≦ i≦ 15  (4) where a value of τ(i) is an integer equal to or larger than 0 and equal to or smaller than 15, and τ is a bijective function.