Apparatus and method for hash cryptography

A message scheduler generating a plurality of first and second message data required for first and second hash calculations, respectively, in an apparatus for hash cryptography, comprising:

• a memory that divides and stores block data to be calculated into N sub-block data;
• a register that stores and outputs input data;
• an XOR calculator that operates when the first hash calculation is performed and updates the data of the register by XOR-calculating the sub-block data stored in the memory and the data stored in the register,
• a rotation shift calculator that rotation-shifts and outputs the data stored in the register after the XOR calculation is repeatedly performed a predetermined number of times by the XOR calculator;
• a logic calculator that operates when the second hash calculation is performed and performs corresponding logic calculation among a plurality of logic calculations with respect to any one of the sub-block data stored in the memory;
• and
• an OR calculator that updates the data of the register by OR-calculating the data outputted from the logic calculator and the data stored in the register,
• wherein the N sub-block data and the output data of the rotation shift calculator are respectively used as the plurality of first message data when the first hash calculation is performed,
• the data by the OR calculation after the corresponding logic calculation and the OR calculation are repeatedly performed with respect to the N sub-block data and the second message data of a predetermined number are used as the plurality of second message data when the second hash calculation is performed, and
• N is a positive integer.

A message compressor calculating a message digest by performing hash calculation with respect to block data to be calculated in an apparatus for hash cryptography, comprising:

• a plurality of registers that store and output input data and are connected to each other in a structure in which data outputted from a former register is inputted into a latter register;
• and
• an OR calculator that OR-calculates first data selected among a plurality of inputted first data and data stored in a first register among the plurality of registers to update the data of the first register when a first hash calculation is performed, and OR-calculates second data selected among a plurality of inputted second data and data stored in a second register among the plurality of registers to update the data of the second register when a second hash calculation is performed,
• wherein a first round calculation is performed, which stores the data outputted from the OR calculator in a third register that is positioned at a first location of the plurality of registers after repeatedly performing the OR calculation a first number of times while changing selection of the first data and operates the plurality of registers as shift registers when the first hash calculation is performed, and a message digest according to the first hash calculation is calculated by repeatedly performing the first round calculation a predetermined number of times of rounds, and
• a second round calculation is performed, which stores the data outputted from the OR calculator in the third register after repeatedly performing the OR calculation a second number of times while changing selection of the second data and operates the plurality of registers as the shift registers when the second hash calculation is performed, and a message digest by the second hash calculation is calculated by repeatedly performing the second round calculation a predetermined number of times of rounds.

A method for hash cryptography, comprising:

• dividing calculation data received from the outside into N block data and storing the block data in a memory;
• storing the N block data in a register;
• generating the N block data stored in the register as first message data to be used in first to N-th rounds when a first hash calculation is performed;
• generating the first message data of a corresponding round by performing XOR calculation a predetermined number of times by using one XOR calculator on the basis of the first message data and the data stored in the register in each of (N+1)-th to M-th rounds when the first hash calculation is performed;
• generating the N block data stored in the register as second message data to be used in the first to N-th rounds when a second hash calculation is performed;
• generating the second message data of a corresponding round by performing XOR calculation a predetermined number of times by using one OR calculator on the basis of the second message data and the data stored in the register in each of (N+1)-th to K-th rounds when the second hash calculation is performed;
• calculating a first message digest by using M first message data corresponding to first to M-th rounds when the first hash calculation is performed;
• and
• calculating a second message digest by using second message data corresponding to first to K-th rounds when the second hash calculation is performed,
• wherein the N, M, and K are positive integers.