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

? 歡迎來(lái)到蟲蟲下載站! | ?? 資源下載 ?? 資源專輯 ?? 關(guān)于我們
? 蟲蟲下載站

?? sha1.c

?? 基于QT4圖形庫(kù)的BT下載客戶端源碼
?? C
字號(hào):
/*
 *  sha1.c
 *
 *	Copyright (C) 1998
 *	Paul E. Jones <paulej@arid.us>
 *	All Rights Reserved
 *
 *****************************************************************************
 *	$Id: sha1.c,v 1.2 2004/03/27 18:00:33 paulej Exp $
 *****************************************************************************
 *
 *  Description:
 *      This file implements the Secure Hashing Standard as defined
 *      in FIPS PUB 180-1 published April 17, 1995.
 *
 *      The Secure Hashing Standard, which uses the Secure Hashing
 *      Algorithm (SHA), produces a 160-bit message digest for a
 *      given data stream.  In theory, it is highly improbable that
 *      two messages will produce the same message digest.  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 was
 *      written with the expectation that the processor has at least
 *      a 32-bit machine word size.  If the machine word size is larger,
 *      the code should still function properly.  One caveat to that
 *      is that the input functions taking characters and character
 *      arrays assume that only 8 bits of information are stored in each
 *      character.
 *
 *  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 circular shift macro
 */
#define SHA1CircularShift(bits,word) \
                ((((word) << (bits)) & 0xFFFFFFFF) | \
                ((word) >> (32-(bits))))

/* Function prototypes */
void SHA1ProcessMessageBlock(SHA1Context *);
void SHA1PadMessage(SHA1Context *);

/*  
 *  SHA1Reset
 *
 *  Description:
 *      This function will initialize the SHA1Context in preparation
 *      for computing a new message digest.
 *
 *  Parameters:
 *      context: [in/out]
 *          The context to reset.
 *
 *  Returns:
 *      Nothing.
 *
 *  Comments:
 *
 */
void SHA1Reset(SHA1Context *context)
{
    context->Length_Low             = 0;
    context->Length_High            = 0;
    context->Message_Block_Index    = 0;

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

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

/*  
 *  SHA1Result
 *
 *  Description:
 *      This function will return the 160-bit message digest into the
 *      Message_Digest array within the SHA1Context provided
 *
 *  Parameters:
 *      context: [in/out]
 *          The context to use to calculate the SHA-1 hash.
 *
 *  Returns:
 *      1 if successful, 0 if it failed.
 *
 *  Comments:
 *
 */
int SHA1Result(SHA1Context *context)
{

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

    if (!context->Computed)
    {
        SHA1PadMessage(context);
        context->Computed = 1;
    }

    return 1;
}

/*  
 *  SHA1Input
 *
 *  Description:
 *      This function accepts an array of octets as the next portion of
 *      the message.
 *
 *  Parameters:
 *      context: [in/out]
 *          The SHA-1 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:
 *      Nothing.
 *
 *  Comments:
 *
 */
void SHA1Input(     SHA1Context         *context,
                    const unsigned char *message_array,
                    unsigned            length)
{
    if (!length)
    {
        return;
    }

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

    while(length-- && !context->Corrupted)
    {
        context->Message_Block[context->Message_Block_Index++] =
                                                (*message_array & 0xFF);

        context->Length_Low += 8;
        /* Force it to 32 bits */
        context->Length_Low &= 0xFFFFFFFF;
        if (context->Length_Low == 0)
        {
            context->Length_High++;
            /* Force it to 32 bits */
            context->Length_High &= 0xFFFFFFFF;
            if (context->Length_High == 0)
            {
                /* Message is too long */
                context->Corrupted = 1;
            }
        }

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

        message_array++;
    }
}

/*  
 *  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 the SHAContext, especially the
 *      single character names, were used because those were the names
 *      used in the publication.
 *         
 *
 */
void SHA1ProcessMessageBlock(SHA1Context *context)
{
    const unsigned K[] =            /* Constants defined in SHA-1   */      
    {
        0x5A827999,
        0x6ED9EBA1,
        0x8F1BBCDC,
        0xCA62C1D6
    };
    int         t;                  /* Loop counter                 */
    unsigned    temp;               /* Temporary word value         */
    unsigned    W[80];              /* Word sequence                */
    unsigned    A, B, C, D, E;      /* Word buffers                 */

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

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

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

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

    context->Message_Digest[0] =
                        (context->Message_Digest[0] + A) & 0xFFFFFFFF;
    context->Message_Digest[1] =
                        (context->Message_Digest[1] + B) & 0xFFFFFFFF;
    context->Message_Digest[2] =
                        (context->Message_Digest[2] + C) & 0xFFFFFFFF;
    context->Message_Digest[3] =
                        (context->Message_Digest[3] + D) & 0xFFFFFFFF;
    context->Message_Digest[4] =
                        (context->Message_Digest[4] + E) & 0xFFFFFFFF;

    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 SHA1ProcessMessageBlock()
 *      appropriately.  When it returns, it can be assumed that the
 *      message digest has been computed.
 *
 *  Parameters:
 *      context: [in/out]
 *          The context to pad
 *
 *  Returns:
 *      Nothing.
 *
 *  Comments:
 *
 */
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) & 0xFF;
    context->Message_Block[57] = (context->Length_High >> 16) & 0xFF;
    context->Message_Block[58] = (context->Length_High >> 8) & 0xFF;
    context->Message_Block[59] = (context->Length_High) & 0xFF;
    context->Message_Block[60] = (context->Length_Low >> 24) & 0xFF;
    context->Message_Block[61] = (context->Length_Low >> 16) & 0xFF;
    context->Message_Block[62] = (context->Length_Low >> 8) & 0xFF;
    context->Message_Block[63] = (context->Length_Low) & 0xFF;

    SHA1ProcessMessageBlock(context);
}

?? 快捷鍵說(shuō)明

復(fù)制代碼 Ctrl + C
搜索代碼 Ctrl + F
全屏模式 F11
切換主題 Ctrl + Shift + D
顯示快捷鍵 ?
增大字號(hào) Ctrl + =
減小字號(hào) Ctrl + -
亚洲欧美第一页_禁久久精品乱码_粉嫩av一区二区三区免费野_久草精品视频
亚洲免费观看高清完整版在线观看熊| 国产成人综合亚洲网站| 欧美bbbbb| 久久国产婷婷国产香蕉| 高清不卡一区二区| 在线观看一区日韩| 日韩女优av电影在线观看| 国产精品三级视频| 亚洲h在线观看| 九色porny丨国产精品| 9久草视频在线视频精品| 欧美日韩三级在线| 国产欧美一区视频| 性欧美疯狂xxxxbbbb| 国产一区二区三区蝌蚪| 色琪琪一区二区三区亚洲区| 欧美一区二区三区思思人| 欧美国产禁国产网站cc| 国产夫妻精品视频| 色婷婷一区二区| 欧美一级二级三级蜜桃| 中文字幕一区日韩精品欧美| 肉色丝袜一区二区| 成人av在线一区二区三区| 3d动漫精品啪啪一区二区竹菊| 欧美激情一区二区| 日日夜夜免费精品| av亚洲精华国产精华精| 日韩一区二区视频在线观看| 中文字幕一区不卡| 韩国女主播成人在线观看| 在线视频中文字幕一区二区| 亚洲精品一区二区在线观看| 亚洲丶国产丶欧美一区二区三区| 国产.精品.日韩.另类.中文.在线.播放| 欧美性受xxxx黑人xyx性爽| 国产日韩在线不卡| 蜜桃一区二区三区在线| 在线一区二区三区| 国产精品美女久久久久久久久| 蜜臀av一区二区| 欧美三级视频在线播放| 日韩一区中文字幕| 精品亚洲aⅴ乱码一区二区三区| 欧美三级在线播放| 亚洲欧美电影院| 国产91精品欧美| 久久中文字幕电影| 美女视频免费一区| 欧美日韩高清一区二区不卡| 亚洲欧美偷拍另类a∨色屁股| 豆国产96在线|亚洲| 久久蜜桃av一区二区天堂 | 成人美女在线视频| 精品国产亚洲在线| 免费高清在线视频一区·| 欧美性生交片4| 亚洲精品国产高清久久伦理二区| 国产不卡高清在线观看视频| 精品国产免费久久| 蜜桃视频一区二区| 日韩视频在线观看一区二区| 天天色图综合网| 欧美日韩精品电影| 亚洲国产sm捆绑调教视频| 色诱视频网站一区| 一区二区三区中文字幕精品精品| 91看片淫黄大片一级在线观看| 国产精品视频你懂的| 高清av一区二区| 中文字幕av在线一区二区三区| 国产美女一区二区| 久久久国产精品午夜一区ai换脸| 国模大尺度一区二区三区| 337p日本欧洲亚洲大胆精品| 久久精品国产澳门| 精品国产一区二区三区忘忧草 | 日韩三级中文字幕| 蜜臀久久99精品久久久久宅男 | 日本视频一区二区| 日韩你懂的在线观看| 麻豆精品国产传媒mv男同| 日韩免费视频一区| 国产一区二区不卡在线 | 成人免费毛片app| 国产精品久久久久影院老司| aa级大片欧美| 亚洲综合偷拍欧美一区色| 欧美情侣在线播放| 蜜桃在线一区二区三区| 久久精品一区八戒影视| 不卡电影免费在线播放一区| 亚洲欧美视频在线观看| 欧洲一区二区三区免费视频| 天天综合色天天综合| 精品噜噜噜噜久久久久久久久试看 | 毛片av中文字幕一区二区| 精品国免费一区二区三区| 成人久久18免费网站麻豆| 亚洲黄一区二区三区| 欧美人与禽zozo性伦| 久久国产婷婷国产香蕉| 国产精品免费丝袜| 欧美性大战久久| 久久99精品久久久久久动态图| 国产日韩欧美精品综合| 色偷偷88欧美精品久久久| 日韩精品成人一区二区三区| 精品国产一区二区亚洲人成毛片| 成人精品视频网站| 亚洲国产精品久久人人爱| 欧美r级在线观看| 成人免费观看av| 香蕉乱码成人久久天堂爱免费| 精品久久久久久久久久久久久久久久久 | 国产福利一区在线| 91美女片黄在线观看91美女| 成人黄色大片在线观看| 亚洲精品美腿丝袜| 欧美疯狂做受xxxx富婆| 极品尤物av久久免费看| 国产精品系列在线| 欧美精选在线播放| 福利一区在线观看| 亚洲一区二区三区四区不卡| 久久先锋资源网| 欧洲国产伦久久久久久久| 韩国女主播成人在线观看| 亚洲美女视频在线观看| 精品欧美乱码久久久久久1区2区| 99久久精品国产一区二区三区| 日本sm残虐另类| 亚洲欧洲无码一区二区三区| 日韩一区二区在线看| 91在线视频免费91| 韩国女主播成人在线观看| 亚洲一二三区在线观看| 欧美国产激情一区二区三区蜜月| 欧美日韩五月天| a级高清视频欧美日韩| 免费成人在线网站| 亚洲制服欧美中文字幕中文字幕| 久久日一线二线三线suv| 欧美浪妇xxxx高跟鞋交| av高清不卡在线| 极品少妇xxxx偷拍精品少妇| 亚洲午夜在线电影| 中文字幕在线不卡一区 | 久久国产生活片100| 亚洲精品一二三区| 亚洲国产精品精华液ab| 日韩网站在线看片你懂的| 欧美主播一区二区三区| 成人少妇影院yyyy| 国产九色精品成人porny | 欧美精品一区二| 91精品一区二区三区久久久久久| 91亚洲国产成人精品一区二区三 | 久久久久久久国产精品影院| 欧美性受xxxx| 91麻豆国产香蕉久久精品| 成人午夜免费电影| 国产中文一区二区三区| 日本aⅴ亚洲精品中文乱码| 亚洲电影在线免费观看| 又紧又大又爽精品一区二区| 中文字幕在线不卡一区二区三区| 国产欧美一区视频| 久久精品一区蜜桃臀影院| 精品国产凹凸成av人网站| 日韩一区二区三区观看| 7777精品伊人久久久大香线蕉经典版下载| 色婷婷激情综合| 91视频一区二区三区| 99视频有精品| av在线一区二区三区| 成人免费视频视频在线观看免费| 国产传媒日韩欧美成人| 激情都市一区二区| 国产综合久久久久久久久久久久| 另类专区欧美蜜桃臀第一页| 麻豆国产欧美日韩综合精品二区| 奇米综合一区二区三区精品视频| 天天综合天天综合色| 日韩—二三区免费观看av| 日日骚欧美日韩| 蜜桃精品视频在线| 久久国产成人午夜av影院| 激情文学综合插| 国产成人在线看| 成人av网址在线观看| 成人av电影在线网| 欧美日韩你懂得| 国产欧美日韩中文久久| 精品国产乱码久久久久久影片| 日韩一区和二区| 精品国产1区二区| 久久精品日韩一区二区三区| 国产视频视频一区| 国产精品色哟哟网站|