1. An apparatus for performing a compression operation in a hash algorithm, comprising: a message extension unit for receiving a message and generating 32, 384-bit extended messages; a chaining variable initial conversion unit for receiving chaining variable data and converting the chaining variable data into 512-bit initial state data; a step function operation unit for repeatedly calculating a step function based on the initial state data and the plurality of extended messages and then producing final state data, wherein: the step function operation unit produces the final state data by repeatedly calculating the step function based on the 512-bit initial state data (X 0 =X 0 [0]∥X 0 [1]∥ • • • ∥X 0 [14]∥X 0 [15]) and the 32, 384-bit extended messages (W r =W r [0]∥W r [1]∥ • • • ∥W r [10]∥W r [11]), and the step function is a function for calculating the following Equations (1) to (5): 
 T r [i]=X r [i]⊕W r [i], 0≦ i≦ 11  (1) 
 X r+1 [i]=ROL 9 ( T r [i] T r [i+ 4]),0≦ i≦ 3  (2) 
 X r+1 [i]=ROL 27 ( T r [i] T r [i+ 4]),4≦ i≦ 7  (3) 
 X r+1 [i]=ROL 29 ( T r [i] X r [i+ 4]),8≦ i≦ 11  (4) 
 X r+1 [i]=T r [i− 12],12≦ i≦ 15  (5) where x⊕y denotes an exclusive OR operation on x and y which respectively have 32-bit values, x y denotes an operation of outputting a remainder of division when a sum of values representing the 32-bit x and y by positive integers, respectively, is divided by 2 32 , in 32 bits, and ROL a (x) denotes an operation of cyclically shifting the 32-bit x to left by ‘a’ bits and outputting a shifted value; and a chaining variable final conversion, unit for generating updated chaining variable data from the chaining variable data using the final state data, and outputting the updated chaining variable data.