亚洲欧美第一页_禁久久精品乱码_粉嫩av一区二区三区免费野_久草精品视频

? 歡迎來到蟲蟲下載站! | ?? 資源下載 ?? 資源專輯 ?? 關于我們
? 蟲蟲下載站

?? sha1.c

?? SHA-1 algorithm implemented in C.
?? C
字號:
/*
 *  sha1.c
 *
 *  Description:
 *      This file implements the Secure Hashing Algorithm 1 as
 *      defined in FIPS PUB 180-1 published April 17, 1995.
 *
 *      The SHA-1, produces a 160-bit message digest for a given
 *      data stream.  It should take about 2**n steps to find a
 *      message with the same digest as a given message and
 *      2**(n/2) to find any two messages with the same digest,
 *      when n is the digest size in bits.  Therefore, this
 *      algorithm can serve as a means of providing a
 *      "fingerprint" for a message.
 *
 *  Portability Issues:
 *      SHA-1 is defined in terms of 32-bit "words".  This code
 *      uses <stdint.h> (included via "sha1.h" to define 32 and 8
 *      bit unsigned integer types.  If your C compiler does not
 *      support 32 bit unsigned integers, this code is not
 *      appropriate.
 *
 *  Caveats:
 *      SHA-1 is designed to work with messages less than 2^64 bits
 *      long. Although SHA-1 allows a message digest to be generated
 *      for messages of any number of bits less than 2^64, this
 *      implementation only works with messages with a length that is
 *      a multiple of the size of an 8-bit character.
 *
 */

#include "sha1.h"

/*
 *  Define the SHA1 circular left shift macro
 */
#define SHA1CircularShift(bits,word) \
                (((word) << (bits)) | ((word) >> (32-(bits))))

/* Local Function Prototyptes */
void SHA1PadMessage(SHA1Context *);
void SHA1ProcessMessageBlock(SHA1Context *);

/*
 *  SHA1Reset
 *
 *  Description:
 *      This function will initialize the SHA1Context in preparation
 *      for computing a new SHA1 message digest.
 *
 *  Parameters:
 *      context: [in/out]
 *          The context to reset.
 *
 *  Returns:
 *      sha Error Code.
 *
 */
int SHA1Reset(SHA1Context *context)
{
    if (!context)
    {
        return shaNull;
    }

    context->Length_Low             = 0;
    context->Length_High            = 0;
    context->Message_Block_Index    = 0;

    context->Intermediate_Hash[0]   = 0x67452301;
    context->Intermediate_Hash[1]   = 0xEFCDAB89;
    context->Intermediate_Hash[2]   = 0x98BADCFE;
    context->Intermediate_Hash[3]   = 0x10325476;
    context->Intermediate_Hash[4]   = 0xC3D2E1F0;

    context->Computed   = 0;
    context->Corrupted  = 0;

    return shaSuccess;
}

/*
 *  SHA1Result
 *
 *  Description:
 *      This function will return the 160-bit message digest into the
 *      Message_Digest array  provided by the caller.
 *      NOTE: The first octet of hash is stored in the 0th element,
 *            the last octet of hash in the 19th element.
 *
 *  Parameters:
 *      context: [in]
 *          The context to use to calculate the SHA-1 hash.
 *      Message_Digest: [out]
 *          Where the digest is returned.
 *
 *  Returns:
 *      sha Error Code.
 *
 */
int SHA1Result( SHA1Context *context,
                uint8_t Message_Digest[SHA1HashSize])
{
    int i;
	unsigned int temp;

    if (!context || !Message_Digest)
    {
        return shaNull;
    }

    if (context->Corrupted)
    {
        return context->Corrupted;
    }

    if (!context->Computed)
    {
        SHA1PadMessage(context);
        for(i=0; i<64; ++i)
        {
            /* message may be sensitive, clear it out */
            context->Message_Block[i] = 0;
        }
        context->Length_Low = 0;    /* and clear length */
        context->Length_High = 0;
        context->Computed = 1;
    }

    for(i = 0; i < SHA1HashSize; ++i)
    {
		temp = context->Intermediate_Hash[i>>2];
		temp = temp >> 8 * ( 3 - ( i & 0x03 ) );
        Message_Digest[i] = temp;
    }

    return shaSuccess;
}

/*
 *  SHA1Input
 *
 *  Description:
 *      This function accepts an array of octets as the next portion
 *      of the message.
 *
 *  Parameters:
 *      context: [in/out]
 *          The SHA context to update
 *      message_array: [in]
 *          An array of characters representing the next portion of
 *          the message.
 *      length: [in]
 *          The length of the message in message_array
 *
 *  Returns:
 *      sha Error Code.
 *
 */
int SHA1Input(    SHA1Context    *context,
                  const uint8_t  *message_array,
                  unsigned       length)
{
    if (!length)
    {
        return shaSuccess;
    }

    if (!context || !message_array)
    {
        return shaNull;
    }

    if (context->Computed)
    {
        context->Corrupted = shaStateError;
        return shaStateError;
    }

    if (context->Corrupted)
    {
         return context->Corrupted;
    }
    while(length-- && !context->Corrupted)
    {
	    context->Message_Block[context->Message_Block_Index++] =  (*message_array & 0xFF);
	    context->Length_Low += 8;
	    if (context->Length_Low == 0)
	    {
			context->Length_High++;
			if (context->Length_High == 0)
       	 	{
	            		/* Message is too long */
       	     		context->Corrupted = 1;
	        	}
 	     }

	    if (context->Message_Block_Index == 64)
    	    {
        		SHA1ProcessMessageBlock(context);
	    }

    	    message_array++;
    }

    return shaSuccess;
}

/*
 *  SHA1ProcessMessageBlock
 *
 *  Description:
*      This function will process the next 512 bits of the message
 *      stored in the Message_Block array.
 *
 *  Parameters:
 *      None.
 *
 *  Returns:
 *      Nothing.
 *
 *  Comments:
 *      Many of the variable names in this code, especially the
 *      single character names, were used because those were the
 *      names used in the publication.
 *
 *
 */
void SHA1ProcessMessageBlock(SHA1Context *context)
{
    const uint32_t K[] =    {       /* Constants defined in SHA-1   */
                            0x5A827999,
                            0x6ED9EBA1,
                            0x8F1BBCDC,
                            0xCA62C1D6
                            };
    int           t;                 /* Loop counter                */
    uint32_t      temp;              /* Temporary word value        */
    uint32_t      W[80];             /* Word sequence               */
    uint32_t      A, B, C, D, E;     /* Word buffers                */

    /*
     *  Initialize the first 16 words in the array W
     */
    for(t = 0; t < 16; t++)
    {
        W[t] = context->Message_Block[t * 4] << 24;
        W[t] |= context->Message_Block[t * 4 + 1] << 16;
        W[t] |= context->Message_Block[t * 4 + 2] << 8;
        W[t] |= context->Message_Block[t * 4 + 3];
    }

    for(t = 16; t < 80; t++)
    {
		temp = W[t-3] ^ W[t-8];
		temp = temp ^ W[t-14];
		temp = temp ^ W[t-16];
		temp = SHA1CircularShift(1, temp);
       W[t] = SHA1CircularShift(1,W[t-3] ^ W[t-8] ^ W[t-14] ^ W[t-16]);
    }

    A = context->Intermediate_Hash[0];
    B = context->Intermediate_Hash[1];
    C = context->Intermediate_Hash[2];
    D = context->Intermediate_Hash[3];
    E = context->Intermediate_Hash[4];

    for(t = 0; t < 20; t++)
    {
        temp =  SHA1CircularShift(5,A) +
                ((B & C) | ((~B) & D)) + E + W[t] + K[0];
        E = D;
        D = C;
        C = SHA1CircularShift(30,B);
        B = A;
        A = temp;
    }

    for(t = 20; t < 40; t++)
    {
        temp = SHA1CircularShift(5,A) + (B ^ C ^ D) + E + W[t] + K[1];
        E = D;
        D = C;
        C = SHA1CircularShift(30,B);
        B = A;
        A = temp;
    }

    for(t = 40; t < 60; t++)
    {
        temp = SHA1CircularShift(5,A) +
               ((B & C) | (B & D) | (C & D)) + E + W[t] + K[2];
        E = D;
        D = C;
        C = SHA1CircularShift(30,B);
        B = A;
        A = temp;
    }

    for(t = 60; t < 80; t++)
    {
        temp = SHA1CircularShift(5,A) + (B ^ C ^ D) + E + W[t] + K[3];
        E = D;
        D = C;
        C = SHA1CircularShift(30,B);
        B = A;
        A = temp;
    }

    context->Intermediate_Hash[0] += A;
    context->Intermediate_Hash[1] += B;
    context->Intermediate_Hash[2] += C;
    context->Intermediate_Hash[3] += D;
    context->Intermediate_Hash[4] += E;

    context->Message_Block_Index = 0;
}

/*
 *  SHA1PadMessage
 *
 *  Description:
 *      According to the standard, the message must be padded to an even
 *      512 bits.  The first padding bit must be a '1'.  The last 64
 *      bits represent the length of the original message.  All bits in
 *      between should be 0.  This function will pad the message
 *      according to those rules by filling the Message_Block array
 *      accordingly.  It will also call the ProcessMessageBlock function
 *      provided appropriately.  When it returns, it can be assumed that
 *      the message digest has been computed.
 *
 *  Parameters:
 *      context: [in/out]
 *          The context to pad
 *      ProcessMessageBlock: [in]
 *          The appropriate SHA*ProcessMessageBlock function
 *  Returns:
 *      Nothing.
 *
 */

void SHA1PadMessage(SHA1Context *context)
{
    /*
     *  Check to see if the current message block is too small to hold
     *  the initial padding bits and length.  If so, we will pad the
     *  block, process it, and then continue padding into a second
     *  block.
     */
    if (context->Message_Block_Index > 55)
    {
        context->Message_Block[context->Message_Block_Index++] = 0x80;
        while(context->Message_Block_Index < 64)
        {
            context->Message_Block[context->Message_Block_Index++] = 0;
        }

        SHA1ProcessMessageBlock(context);

        while(context->Message_Block_Index < 56)
        {
            context->Message_Block[context->Message_Block_Index++] = 0;
        }
    }
    else
    {
        context->Message_Block[context->Message_Block_Index++] = 0x80;
        while(context->Message_Block_Index < 56)
        {
            context->Message_Block[context->Message_Block_Index++] = 0;
        }
    }

    /*
     *  Store the message length as the last 8 octets
     */
    context->Message_Block[56] = context->Length_High >> 24;
    context->Message_Block[57] = context->Length_High >> 16;
    context->Message_Block[58] = context->Length_High >> 8;
    context->Message_Block[59] = context->Length_High;
    context->Message_Block[60] = context->Length_Low >> 24;
    context->Message_Block[61] = context->Length_Low >> 16;
    context->Message_Block[62] = context->Length_Low >> 8;
    context->Message_Block[63] = context->Length_Low;

    SHA1ProcessMessageBlock(context);
}

?? 快捷鍵說明

復制代碼 Ctrl + C
搜索代碼 Ctrl + F
全屏模式 F11
切換主題 Ctrl + Shift + D
顯示快捷鍵 ?
增大字號 Ctrl + =
減小字號 Ctrl + -
亚洲欧美第一页_禁久久精品乱码_粉嫩av一区二区三区免费野_久草精品视频
91同城在线观看| 日本中文字幕一区| 成人动漫一区二区| 亚洲婷婷国产精品电影人久久| 不卡欧美aaaaa| 亚洲一区免费视频| 337p亚洲精品色噜噜| 久久精品国产99| 国产亚洲欧洲997久久综合| 成人激情开心网| 亚洲精品亚洲人成人网 | 夜夜嗨av一区二区三区网页| 色美美综合视频| 丰满亚洲少妇av| 国产精品久久久久久久久图文区 | 91久久人澡人人添人人爽欧美| 一区二区三区在线观看网站| 欧美日韩精品一二三区| 九色综合狠狠综合久久| 国产欧美日韩三级| 色综合中文综合网| 韩国女主播一区| 国产精品入口麻豆原神| 一本一本久久a久久精品综合麻豆 一本一道波多野结衣一区二区 | 日韩欧美国产一区二区三区| 国产91丝袜在线18| 亚洲动漫第一页| 精品成人一区二区三区四区| voyeur盗摄精品| 水蜜桃久久夜色精品一区的特点| 久久青草欧美一区二区三区| 色婷婷精品大视频在线蜜桃视频 | 亚洲免费av高清| 精品毛片乱码1区2区3区| a在线播放不卡| 久久99精品久久久久久国产越南| 亚洲天堂精品在线观看| 欧美mv和日韩mv国产网站| 一本大道av伊人久久综合| 精品亚洲成a人| 亚洲午夜视频在线观看| 国产精品理伦片| 2023国产精品| 777xxx欧美| 91国产福利在线| 国产91在线|亚洲| 久久精品噜噜噜成人88aⅴ| 亚洲最大的成人av| 国产视频一区二区在线观看| 日韩三级中文字幕| 欧美视频一区在线| 91啪亚洲精品| 高清不卡一二三区| 国内外成人在线| 日韩国产在线观看| 亚洲成av人片在线观看无码| 最近日韩中文字幕| 国产欧美一区二区精品久导航| 91精品国产综合久久久蜜臀图片| 欧美专区亚洲专区| 日韩欧美激情四射| 在线免费观看日本欧美| 91亚洲精品久久久蜜桃| 成人小视频免费在线观看| 精品一区二区三区蜜桃| 日韩高清中文字幕一区| 图片区小说区区亚洲影院| 伊人婷婷欧美激情| 亚洲欧美国产高清| 国产精品久久久久久户外露出| 久久久另类综合| 久久久99久久| 久久久久久影视| 国产人成一区二区三区影院| 日本一二三四高清不卡| 国产人成亚洲第一网站在线播放| 久久久一区二区| 欧美激情中文不卡| 欧美国产在线观看| 中文字幕在线播放不卡一区| 自拍偷在线精品自拍偷无码专区| 亚洲日本护士毛茸茸| 亚洲激情图片一区| 亚洲国产一区在线观看| 丝袜亚洲精品中文字幕一区| 视频一区视频二区中文字幕| 日本不卡在线视频| 麻豆精品蜜桃视频网站| 国产一区二区三区日韩| 国产不卡在线视频| 成人91在线观看| 欧美在线观看一区二区| 欧美丝袜丝交足nylons| 日韩午夜电影av| 精品少妇一区二区三区视频免付费 | 偷窥少妇高潮呻吟av久久免费| 午夜成人在线视频| 免费观看日韩av| 国产成人免费9x9x人网站视频| 99re这里都是精品| 欧美视频中文字幕| 精品国产区一区| 中文字幕一区二区三区不卡 | 韩国欧美一区二区| www.日韩在线| 777欧美精品| 国产欧美日韩激情| 亚洲福利一区二区三区| 精品在线一区二区三区| 成人av动漫在线| 91精品欧美一区二区三区综合在 | 成人欧美一区二区三区小说| 一区二区三区欧美日| 精品综合免费视频观看| 99精品桃花视频在线观看| 制服.丝袜.亚洲.另类.中文| 中文一区在线播放| 亚洲成人av电影| 国产成人精品亚洲日本在线桃色 | 国产高清精品在线| 欧美性高清videossexo| 国产日韩欧美在线一区| 亚洲高清视频在线| 成人激情小说网站| 欧美一级日韩一级| 亚洲三级在线播放| 国产在线不卡一卡二卡三卡四卡| 欧美亚洲一区二区在线观看| 国产亲近乱来精品视频| 日本不卡视频在线观看| 97久久精品人人做人人爽| 日韩精品影音先锋| 亚洲成av人片观看| 99re8在线精品视频免费播放| 日韩欧美不卡在线观看视频| 亚洲综合视频在线| fc2成人免费人成在线观看播放| 日韩三级在线免费观看| 亚洲午夜在线视频| 91色|porny| 国产精品美女久久久久久2018 | 粉嫩13p一区二区三区| 欧美一区二区精品在线| 亚洲精品国久久99热| 国产成人精品免费视频网站| 日韩欧美一级在线播放| 亚洲成av人**亚洲成av**| 99精品视频在线免费观看| 欧美激情在线观看视频免费| 老司机免费视频一区二区三区| 777a∨成人精品桃花网| 亚洲综合一区二区三区| 色综合色狠狠综合色| 国产精品黄色在线观看| 福利一区二区在线| 久久久精品日韩欧美| 狠狠狠色丁香婷婷综合激情| 欧美一区二区三区视频免费播放 | 另类小说视频一区二区| 91精品国产一区二区三区| 亚洲成人手机在线| 欧美日韩视频一区二区| 亚洲高清中文字幕| 欧美日韩免费观看一区三区| 亚洲一二三四区| 欧美性猛片xxxx免费看久爱| 亚洲一二三区视频在线观看| 欧美最新大片在线看| 亚洲国产色一区| 67194成人在线观看| 日日夜夜精品免费视频| 91麻豆精品国产自产在线 | 国产精品一区二区在线观看不卡| 欧美一区二区女人| 久久福利资源站| 久久一日本道色综合| 粉嫩在线一区二区三区视频| 中文字幕av一区二区三区高| 成人国产精品免费观看动漫| 亚洲欧洲综合另类在线| 在线观看亚洲精品| 日韩一区欧美二区| 精品国产不卡一区二区三区| 国产美女视频一区| 国产精品国产三级国产| 欧美色图一区二区三区| 日本欧美一区二区三区| 26uuu精品一区二区三区四区在线| 韩国毛片一区二区三区| 国产精品久久久久久久久动漫| 欧美制服丝袜第一页| 久久精品99国产精品日本| 国产午夜精品一区二区三区视频 | 亚洲欧洲成人精品av97| 欧美午夜精品久久久久久孕妇 | 亚洲综合小说图片| 日韩亚洲欧美高清| 成人av免费观看| 日日骚欧美日韩| 中文字幕欧美三区|