Apparatus and method for computing SHA-1hash function

• US 20050144204A1
• Filed: 08/12/2004
• Published: 06/30/2005
• Est. Priority Date: 12/26/2003
• Status: Active Grant

• Current Assignee: Electronics and Telecommunications Research Institute
• Original Assignee: Electronics and Telecommunications Research Institute
• Inventors: Kim, Young Sae, Park, Young Soo, Jun, Sung Ik, Lee, Yun Kyung, Lee, Sang Woo, Chung, Kyo II
• Granted Patent: US 7,376,685 B2
• Time in Patent Office: Days
• US Class Current: 708/200
• CPC Class Codes: H04L 9/0643 Hash functions, e.g. MD5, SHA, HMAC or f9 MAC

Abstract

An apparatus and method for computing a SHA-1 hash function value are provided. The apparatus includes a first register unit including a plurality of registers that store a first bit string of predetermined lengths for generation of a hash function value; a second register unit storing input data in units of second bit strings with predetermined lengths, and sequentially outputting the second bit strings; a third register unit performing an operation on the first bit string of the plurality of registers and the second bit strings output from the second register unit so as to generate and store a third bit string, and updating first-bit string of the plurality of registers based on the third bit string; and an adding unit combining the first bit string stored in the first register unit, the first bit string of the third bit string stored in the third register unit, and the original initial values stored in the first register unit so as to obtain a hash function value. Accordingly, it is possible to reduce the size of the apparatus and stably compute a hash function value at a high speed.

Claims

1. An apparatus for computing a SHA-1 hash function, comprising:

a first register unit including a plurality of registers that store a first bit string of predetermined lengths for generation of a hash function value;

a second register unit storing input data in units of second bit strings with predetermined lengths, and sequentially outputting the second bit strings;

a third register unit performing an operation on the first bit string of the plurality of registers and the second bit strings output from the second register unit so as to generate and store a third bit string, and updating first-bit string of the plurality of registers based on the third bit string; and

an adding unit combining the first bit string stored in the first register unit, the first bit string of the third bit string stored in the third register unit, and the original initial values stored in the first register unit so as to obtain a hash function value.

2. The apparatus of claim 1, wherein the plurality registers of the first register unit comprise a register B, a register C, a register D, and a register E,

wherein the register B receives the third bit strings from the third register unit and updates first bit string in the register B with the third bit string,

the register C performs a shift operation on the third bit string and updates the first bit string stored in the register C with a result of shift operation, and

the register D and register E update their first bit strings with the result of the shift operation output from the register C.

3. The apparatus of claim 2, wherein the third register unit comprises:

a function operation unit calculating an F_function value using the initial values stored in the registers B through D;

a first adder combining the second bit strings output from the second register unit and the initial value of the register E;

a second adder combining a result of shift operation input from the shift operation unit and a result of calculation input from the function operation unit;

a third adder combining a predetermined constant and a result of combination input from the first adder to obtain the third bit string; and

a rotation operator performing a shift operation in the third bit string stored in the third register unit;

4. The apparatus of claim 1, wherein the second register unit comprises:

a shift register dividing the input data into units of 32 bits to obtain first through sixteenth W data, outputting the first W data that is the most significant 32 bit data, and shifting the input data by 32 bits in the left direction; and

a feedback unit performing an exclusive OR (XOR) operation on a result of performing the XOR operation on the first and third W data and a result of performing the XOR operation on the ninth and fourteenth W data, shifting a final result of the XOR operation by a 1 bit, and feeding back a result of shifting.

5. The apparatus of claim 1, wherein the updating of the initial values of the first register unit and the outputting of the second bit strings of the second register unit are performed for predetermined periods, and

wherein the adding unit outputs the hash function value when the intermediate values have been computed 80 times.

6. A method of computing a SHA-1 hash function, comprising:

(a) storing initial values in registers A, B, C, D, and E;

(b) dividing input data into bit strings of predetermined lengths, storing the bit strings in a register W, and outputting the stored bit strings;

(c) performing a predetermined logic operation on the respective initial values stored in the registers A, B, C, D, and E, and the bit strings stored in the register W;

(d) calculating intermediate values of the registers A, B, C, D, and E based on a result of the predetermined logic operation, updating the initial values of the registers A, B, C, D, and E with their intermediate values, and storing the updated initial values in the registers A, B, C, D, and E;

(e) repeatedly performing (a) through (e) a predetermined number of times, and obtaining final values of the registers A, B, C, D, and E by combining the respective intermediate values stored in the registers A, B, C, D, and E with their original initial values.

7. The method of claim 6, wherein during (b), a predetermined logic operation is performed on predetermined bit strings stored in the register W, a result of logic operation is fed back to store the result in the register W, the stored result is shifted by 32 bits, and a result of shifting is stored in the register W.

8. The method of claim 6, wherein (c) comprises:

(c1) obtaining the intermediate values by calculating predetermined bit values using a result of rotationally shifting a value A stored in the Register A by 5 bits;

a result of performing an operation on the initial values stored in the registers B, C, and D;

a result of performing an operation on values C and D stored in the registers C and D using a predetermined function;

a value E stored in the register E;

a predetermined constant; and

input value stored in the register W;

(c2) updating the initial value of the register B with its intermediate value;

(c3) updating the initial value of the register C with a result of shifting its intermediate value by 30 bits in the left direction; and

(c3) updating the initial values of the registers D and E with the initial value of the register C.

9. The method of claim 6, wherein during (e), when the calculating of intermediate values of the registers A, B, C, D, and E has been performed 80 times, their final values are calculated.

10. The method of claim 6, wherein during (b), the input data is divided into 32-bit 16 W data, the first W data of 32-bit 16 W data stored in the Register W is output, the 16 W data is shifted by 32 bits, an exclusive OR (XOR) operation is performed on a result of performing the XOR operation on the first and third W data and a result of performing the XOR operation on the ninth and fourteenth W data, a final result of performing the XOR operation is rotationally shifted by 1 bit, and a result of rotationally shifting is fed back to the fifteen W data, the first W data being the most significant data.