add rap file generation

[iso2ps2.git] / ps2classic / sha1.c

/*\r
 *  sha1.c\r
 *\r
 *	Copyright (C) 1998\r
 *	Paul E. Jones <paulej@arid.us>\r
 *	All Rights Reserved\r
 *\r
 *  This software is licensed as "freeware."  Permission to distribute\r
 *  this software in source and binary forms is hereby granted without\r
 *  a fee.  THIS SOFTWARE IS PROVIDED 'AS IS' AND WITHOUT ANY EXPRESSED\r
 *  OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\r
 *  WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.\r
 *  THE AUTHOR SHALL NOT BE HELD LIABLE FOR ANY DAMAGES RESULTING\r
 *  FROM THE USE OF THIS SOFTWARE, EITHER DIRECTLY OR INDIRECTLY, INCLUDING,\r
 *  BUT NOT LIMITED TO, LOSS OF DATA OR DATA BEING RENDERED INACCURATE.\r
 *\r
 *****************************************************************************\r
 *	$Id: sha1.c,v 1.2 2004/03/27 18:00:33 paulej Exp $\r
 *****************************************************************************\r
 *\r
 *  Description:\r
 *      This file implements the Secure Hashing Standard as defined\r
 *      in FIPS PUB 180-1 published April 17, 1995.\r
 *\r
 *      The Secure Hashing Standard, which uses the Secure Hashing\r
 *      Algorithm (SHA), produces a 160-bit message digest for a\r
 *      given data stream.  In theory, it is highly improbable that\r
 *      two messages will produce the same message digest.  Therefore,\r
 *      this algorithm can serve as a means of providing a "fingerprint"\r
 *      for a message.\r
 *\r
 *  Portability Issues:\r
 *      SHA-1 is defined in terms of 32-bit "words".  This code was\r
 *      written with the expectation that the processor has at least\r
 *      a 32-bit machine word size.  If the machine word size is larger,\r
 *      the code should still function properly.  One caveat to that\r
 *      is that the input functions taking characters and character\r
 *      arrays assume that only 8 bits of information are stored in each\r
 *      character.\r
 *\r
 *  Caveats:\r
 *      SHA-1 is designed to work with messages less than 2^64 bits\r
 *      long. Although SHA-1 allows a message digest to be generated for\r
 *      messages of any number of bits less than 2^64, this\r
 *      implementation only works with messages with a length that is a\r
 *      multiple of the size of an 8-bit character.\r
 *\r
 */\r
\r
#include "sha1.h"\r
\r
/*\r
 *  Define the circular shift macro\r
 */\r
#define SHA1CircularShift(bits,word) \\r
                ((((word) << (bits)) & 0xFFFFFFFF) | \\r
                ((word) >> (32-(bits))))\r
\r
/* Function prototypes */\r
void SHA1ProcessMessageBlock(SHA1Context *);\r
void SHA1PadMessage(SHA1Context *);\r
\r
/*  \r
 *  SHA1Reset\r
 *\r
 *  Description:\r
 *      This function will initialize the SHA1Context in preparation\r
 *      for computing a new message digest.\r
 *\r
 *  Parameters:\r
 *      context: [in/out]\r
 *          The context to reset.\r
 *\r
 *  Returns:\r
 *      Nothing.\r
 *\r
 *  Comments:\r
 *\r
 */\r
void SHA1Reset(SHA1Context *context)\r
{\r
    context->Length_Low             = 0;\r
    context->Length_High            = 0;\r
    context->Message_Block_Index    = 0;\r
\r
    context->Message_Digest[0]      = 0x67452301;\r
    context->Message_Digest[1]      = 0xEFCDAB89;\r
    context->Message_Digest[2]      = 0x98BADCFE;\r
    context->Message_Digest[3]      = 0x10325476;\r
    context->Message_Digest[4]      = 0xC3D2E1F0;\r
\r
    context->Computed   = 0;\r
    context->Corrupted  = 0;\r
}\r
\r
/*  \r
 *  SHA1Result\r
 *\r
 *  Description:\r
 *      This function will return the 160-bit message digest into the\r
 *      Message_Digest array within the SHA1Context provided\r
 *\r
 *  Parameters:\r
 *      context: [in/out]\r
 *          The context to use to calculate the SHA-1 hash.\r
 *\r
 *  Returns:\r
 *      1 if successful, 0 if it failed.\r
 *\r
 *  Comments:\r
 *\r
 */\r
int SHA1Result(SHA1Context *context)\r
{\r
\r
    if (context->Corrupted)\r
    {\r
        return 0;\r
    }\r
\r
    if (!context->Computed)\r
    {\r
        SHA1PadMessage(context);\r
        context->Computed = 1;\r
    }\r
\r
    return 1;\r
}\r
\r
/*  \r
 *  SHA1Input\r
 *\r
 *  Description:\r
 *      This function accepts an array of octets as the next portion of\r
 *      the message.\r
 *\r
 *  Parameters:\r
 *      context: [in/out]\r
 *          The SHA-1 context to update\r
 *      message_array: [in]\r
 *          An array of characters representing the next portion of the\r
 *          message.\r
 *      length: [in]\r
 *          The length of the message in message_array\r
 *\r
 *  Returns:\r
 *      Nothing.\r
 *\r
 *  Comments:\r
 *\r
 */\r
void SHA1Input(     SHA1Context         *context,\r
                    const unsigned char *message_array,\r
                    unsigned            length)\r
{\r
    if (!length)\r
    {\r
        return;\r
    }\r
\r
    if (context->Computed || context->Corrupted)\r
    {\r
        context->Corrupted = 1;\r
        return;\r
    }\r
\r
    while(length-- && !context->Corrupted)\r
    {\r
        context->Message_Block[context->Message_Block_Index++] =\r
                                                (*message_array & 0xFF);\r
\r
        context->Length_Low += 8;\r
        /* Force it to 32 bits */\r
        context->Length_Low &= 0xFFFFFFFF;\r
        if (context->Length_Low == 0)\r
        {\r
            context->Length_High++;\r
            /* Force it to 32 bits */\r
            context->Length_High &= 0xFFFFFFFF;\r
            if (context->Length_High == 0)\r
            {\r
                /* Message is too long */\r
                context->Corrupted = 1;\r
            }\r
        }\r
\r
        if (context->Message_Block_Index == 64)\r
        {\r
            SHA1ProcessMessageBlock(context);\r
        }\r
\r
        message_array++;\r
    }\r
}\r
\r
/*  \r
 *  SHA1ProcessMessageBlock\r
 *\r
 *  Description:\r
 *      This function will process the next 512 bits of the message\r
 *      stored in the Message_Block array.\r
 *\r
 *  Parameters:\r
 *      None.\r
 *\r
 *  Returns:\r
 *      Nothing.\r
 *\r
 *  Comments:\r
 *      Many of the variable names in the SHAContext, especially the\r
 *      single character names, were used because those were the names\r
 *      used in the publication.\r
 *         \r
 *\r
 */\r
void SHA1ProcessMessageBlock(SHA1Context *context)\r
{\r
    const unsigned K[] =            /* Constants defined in SHA-1   */      \r
    {\r
        0x5A827999,\r
        0x6ED9EBA1,\r
        0x8F1BBCDC,\r
        0xCA62C1D6\r
    };\r
    int         t;                  /* Loop counter                 */\r
    unsigned    temp;               /* Temporary word value         */\r
    unsigned    W[80];              /* Word sequence                */\r
    unsigned    A, B, C, D, E;      /* Word buffers                 */\r
\r
    /*\r
     *  Initialize the first 16 words in the array W\r
     */\r
    for(t = 0; t < 16; t++)\r
    {\r
        W[t] = ((unsigned) context->Message_Block[t * 4]) << 24;\r
        W[t] |= ((unsigned) context->Message_Block[t * 4 + 1]) << 16;\r
        W[t] |= ((unsigned) context->Message_Block[t * 4 + 2]) << 8;\r
        W[t] |= ((unsigned) context->Message_Block[t * 4 + 3]);\r
    }\r
\r
    for(t = 16; t < 80; t++)\r
    {\r
       W[t] = SHA1CircularShift(1,W[t-3] ^ W[t-8] ^ W[t-14] ^ W[t-16]);\r
    }\r
\r
    A = context->Message_Digest[0];\r
    B = context->Message_Digest[1];\r
    C = context->Message_Digest[2];\r
    D = context->Message_Digest[3];\r
    E = context->Message_Digest[4];\r
\r
    for(t = 0; t < 20; t++)\r
    {\r
        temp =  SHA1CircularShift(5,A) +\r
                ((B & C) | ((~B) & D)) + E + W[t] + K[0];\r
        temp &= 0xFFFFFFFF;\r
        E = D;\r
        D = C;\r
        C = SHA1CircularShift(30,B);\r
        B = A;\r
        A = temp;\r
    }\r
\r
    for(t = 20; t < 40; t++)\r
    {\r
        temp = SHA1CircularShift(5,A) + (B ^ C ^ D) + E + W[t] + K[1];\r
        temp &= 0xFFFFFFFF;\r
        E = D;\r
        D = C;\r
        C = SHA1CircularShift(30,B);\r
        B = A;\r
        A = temp;\r
    }\r
\r
    for(t = 40; t < 60; t++)\r
    {\r
        temp = SHA1CircularShift(5,A) +\r
               ((B & C) | (B & D) | (C & D)) + E + W[t] + K[2];\r
        temp &= 0xFFFFFFFF;\r
        E = D;\r
        D = C;\r
        C = SHA1CircularShift(30,B);\r
        B = A;\r
        A = temp;\r
    }\r
\r
    for(t = 60; t < 80; t++)\r
    {\r
        temp = SHA1CircularShift(5,A) + (B ^ C ^ D) + E + W[t] + K[3];\r
        temp &= 0xFFFFFFFF;\r
        E = D;\r
        D = C;\r
        C = SHA1CircularShift(30,B);\r
        B = A;\r
        A = temp;\r
    }\r
\r
    context->Message_Digest[0] =\r
                        (context->Message_Digest[0] + A) & 0xFFFFFFFF;\r
    context->Message_Digest[1] =\r
                        (context->Message_Digest[1] + B) & 0xFFFFFFFF;\r
    context->Message_Digest[2] =\r
                        (context->Message_Digest[2] + C) & 0xFFFFFFFF;\r
    context->Message_Digest[3] =\r
                        (context->Message_Digest[3] + D) & 0xFFFFFFFF;\r
    context->Message_Digest[4] =\r
                        (context->Message_Digest[4] + E) & 0xFFFFFFFF;\r
\r
    context->Message_Block_Index = 0;\r
}\r
\r
/*  \r
 *  SHA1PadMessage\r
 *\r
 *  Description:\r
 *      According to the standard, the message must be padded to an even\r
 *      512 bits.  The first padding bit must be a '1'.  The last 64\r
 *      bits represent the length of the original message.  All bits in\r
 *      between should be 0.  This function will pad the message\r
 *      according to those rules by filling the Message_Block array\r
 *      accordingly.  It will also call SHA1ProcessMessageBlock()\r
 *      appropriately.  When it returns, it can be assumed that the\r
 *      message digest has been computed.\r
 *\r
 *  Parameters:\r
 *      context: [in/out]\r
 *          The context to pad\r
 *\r
 *  Returns:\r
 *      Nothing.\r
 *\r
 *  Comments:\r
 *\r
 */\r
void SHA1PadMessage(SHA1Context *context)\r
{\r
    /*\r
     *  Check to see if the current message block is too small to hold\r
     *  the initial padding bits and length.  If so, we will pad the\r
     *  block, process it, and then continue padding into a second\r
     *  block.\r
     */\r
    if (context->Message_Block_Index > 55)\r
    {\r
        context->Message_Block[context->Message_Block_Index++] = 0x80;\r
        while(context->Message_Block_Index < 64)\r
        {\r
            context->Message_Block[context->Message_Block_Index++] = 0;\r
        }\r
\r
        SHA1ProcessMessageBlock(context);\r
\r
        while(context->Message_Block_Index < 56)\r
        {\r
            context->Message_Block[context->Message_Block_Index++] = 0;\r
        }\r
    }\r
    else\r
    {\r
        context->Message_Block[context->Message_Block_Index++] = 0x80;\r
        while(context->Message_Block_Index < 56)\r
        {\r
            context->Message_Block[context->Message_Block_Index++] = 0;\r
        }\r
    }\r
\r
    /*\r
     *  Store the message length as the last 8 octets\r
     */\r
    context->Message_Block[56] = (context->Length_High >> 24) & 0xFF;\r
    context->Message_Block[57] = (context->Length_High >> 16) & 0xFF;\r
    context->Message_Block[58] = (context->Length_High >> 8) & 0xFF;\r
    context->Message_Block[59] = (context->Length_High) & 0xFF;\r
    context->Message_Block[60] = (context->Length_Low >> 24) & 0xFF;\r
    context->Message_Block[61] = (context->Length_Low >> 16) & 0xFF;\r
    context->Message_Block[62] = (context->Length_Low >> 8) & 0xFF;\r
    context->Message_Block[63] = (context->Length_Low) & 0xFF;\r
\r
    SHA1ProcessMessageBlock(context);\r
}\r