62eb734b49
Remove misc typedefs. Signed-off-by: Bartlomiej Zolnierkiewicz <bzolnier@gmail.com> Signed-off-by: Greg Kroah-Hartman <gregkh@suse.de>
340 lines
11 KiB
C
340 lines
11 KiB
C
/*
|
|
*************************************************************************
|
|
* Ralink Tech Inc.
|
|
* 5F., No.36, Taiyuan St., Jhubei City,
|
|
* Hsinchu County 302,
|
|
* Taiwan, R.O.C.
|
|
*
|
|
* (c) Copyright 2002-2007, Ralink Technology, Inc.
|
|
*
|
|
* This program is free software; you can redistribute it and/or modify *
|
|
* it under the terms of the GNU General Public License as published by *
|
|
* the Free Software Foundation; either version 2 of the License, or *
|
|
* (at your option) any later version. *
|
|
* *
|
|
* This program is distributed in the hope that it will be useful, *
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of *
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *
|
|
* GNU General Public License for more details. *
|
|
* *
|
|
* You should have received a copy of the GNU General Public License *
|
|
* along with this program; if not, write to the *
|
|
* Free Software Foundation, Inc., *
|
|
* 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. *
|
|
* *
|
|
*************************************************************************/
|
|
|
|
#include "../crypt_md5.h"
|
|
|
|
#ifdef MD5_SUPPORT
|
|
/*
|
|
* F, G, H and I are basic MD5 functions.
|
|
*/
|
|
#define F(x, y, z) (((x) & (y)) | ((~x) & (z)))
|
|
#define G(x, y, z) (((x) & (z)) | ((y) & (~z)))
|
|
#define H(x, y, z) ((x) ^ (y) ^ (z))
|
|
#define I(x, y, z) ((y) ^ ((x) | (~z)))
|
|
|
|
#define ROTL(x,n,w) ((x << n) | (x >> (w - n)))
|
|
#define ROTL32(x,n) ROTL(x,n,32) /* 32 bits word */
|
|
|
|
#define ROUND1(a, b, c, d, x, s, ac) { \
|
|
(a) += F((b),(c),(d)) + (x) + (u32)(ac); \
|
|
(a) = ROTL32((a),(s)); \
|
|
(a) += (b); \
|
|
}
|
|
#define ROUND2(a, b, c, d, x, s, ac) { \
|
|
(a) += G((b),(c),(d)) + (x) + (u32)(ac); \
|
|
(a) = ROTL32((a),(s)); \
|
|
(a) += (b); \
|
|
}
|
|
#define ROUND3(a, b, c, d, x, s, ac) { \
|
|
(a) += H((b),(c),(d)) + (x) + (u32)(ac); \
|
|
(a) = ROTL32((a),(s)); \
|
|
(a) += (b); \
|
|
}
|
|
#define ROUND4(a, b, c, d, x, s, ac) { \
|
|
(a) += I((b),(c),(d)) + (x) + (u32)(ac); \
|
|
(a) = ROTL32((a),(s)); \
|
|
(a) += (b); \
|
|
}
|
|
static const u32 MD5_DefaultHashValue[4] = {
|
|
0x67452301UL, 0xefcdab89UL, 0x98badcfeUL, 0x10325476UL
|
|
};
|
|
#endif /* MD5_SUPPORT */
|
|
|
|
#ifdef MD5_SUPPORT
|
|
/*
|
|
========================================================================
|
|
Routine Description:
|
|
Initial Md5_CTX_STRUC
|
|
|
|
Arguments:
|
|
pMD5_CTX Pointer to Md5_CTX_STRUC
|
|
|
|
Return Value:
|
|
None
|
|
|
|
Note:
|
|
None
|
|
========================================================================
|
|
*/
|
|
void MD5_Init(struct rt_md5_ctx_struc *pMD5_CTX)
|
|
{
|
|
NdisMoveMemory(pMD5_CTX->HashValue, MD5_DefaultHashValue,
|
|
sizeof(MD5_DefaultHashValue));
|
|
NdisZeroMemory(pMD5_CTX->Block, MD5_BLOCK_SIZE);
|
|
pMD5_CTX->BlockLen = 0;
|
|
pMD5_CTX->MessageLen = 0;
|
|
} /* End of MD5_Init */
|
|
|
|
/*
|
|
========================================================================
|
|
Routine Description:
|
|
MD5 computation for one block (512 bits)
|
|
|
|
Arguments:
|
|
pMD5_CTX Pointer to Md5_CTX_STRUC
|
|
|
|
Return Value:
|
|
None
|
|
|
|
Note:
|
|
T[i] := floor(abs(sin(i + 1)) * (2 pow 32)), i is number of round
|
|
========================================================================
|
|
*/
|
|
void MD5_Hash(struct rt_md5_ctx_struc *pMD5_CTX)
|
|
{
|
|
u32 X_i;
|
|
u32 X[16];
|
|
u32 a, b, c, d;
|
|
|
|
/* Prepare the message schedule, {X_i} */
|
|
NdisMoveMemory(X, pMD5_CTX->Block, MD5_BLOCK_SIZE);
|
|
for (X_i = 0; X_i < 16; X_i++)
|
|
X[X_i] = cpu2le32(X[X_i]); /* Endian Swap */
|
|
/* End of for */
|
|
|
|
/* MD5 hash computation */
|
|
/* Initialize the working variables */
|
|
a = pMD5_CTX->HashValue[0];
|
|
b = pMD5_CTX->HashValue[1];
|
|
c = pMD5_CTX->HashValue[2];
|
|
d = pMD5_CTX->HashValue[3];
|
|
|
|
/*
|
|
* Round 1
|
|
* Let [abcd k s i] denote the operation
|
|
* a = b + ((a + F(b,c,d) + X[k] + T[i]) <<< s)
|
|
*/
|
|
ROUND1(a, b, c, d, X[0], 7, 0xd76aa478); /* 1 */
|
|
ROUND1(d, a, b, c, X[1], 12, 0xe8c7b756); /* 2 */
|
|
ROUND1(c, d, a, b, X[2], 17, 0x242070db); /* 3 */
|
|
ROUND1(b, c, d, a, X[3], 22, 0xc1bdceee); /* 4 */
|
|
ROUND1(a, b, c, d, X[4], 7, 0xf57c0faf); /* 5 */
|
|
ROUND1(d, a, b, c, X[5], 12, 0x4787c62a); /* 6 */
|
|
ROUND1(c, d, a, b, X[6], 17, 0xa8304613); /* 7 */
|
|
ROUND1(b, c, d, a, X[7], 22, 0xfd469501); /* 8 */
|
|
ROUND1(a, b, c, d, X[8], 7, 0x698098d8); /* 9 */
|
|
ROUND1(d, a, b, c, X[9], 12, 0x8b44f7af); /* 10 */
|
|
ROUND1(c, d, a, b, X[10], 17, 0xffff5bb1); /* 11 */
|
|
ROUND1(b, c, d, a, X[11], 22, 0x895cd7be); /* 12 */
|
|
ROUND1(a, b, c, d, X[12], 7, 0x6b901122); /* 13 */
|
|
ROUND1(d, a, b, c, X[13], 12, 0xfd987193); /* 14 */
|
|
ROUND1(c, d, a, b, X[14], 17, 0xa679438e); /* 15 */
|
|
ROUND1(b, c, d, a, X[15], 22, 0x49b40821); /* 16 */
|
|
|
|
/*
|
|
* Round 2
|
|
* Let [abcd k s i] denote the operation
|
|
* a = b + ((a + G(b,c,d) + X[k] + T[i]) <<< s)
|
|
*/
|
|
ROUND2(a, b, c, d, X[1], 5, 0xf61e2562); /* 17 */
|
|
ROUND2(d, a, b, c, X[6], 9, 0xc040b340); /* 18 */
|
|
ROUND2(c, d, a, b, X[11], 14, 0x265e5a51); /* 19 */
|
|
ROUND2(b, c, d, a, X[0], 20, 0xe9b6c7aa); /* 20 */
|
|
ROUND2(a, b, c, d, X[5], 5, 0xd62f105d); /* 21 */
|
|
ROUND2(d, a, b, c, X[10], 9, 0x2441453); /* 22 */
|
|
ROUND2(c, d, a, b, X[15], 14, 0xd8a1e681); /* 23 */
|
|
ROUND2(b, c, d, a, X[4], 20, 0xe7d3fbc8); /* 24 */
|
|
ROUND2(a, b, c, d, X[9], 5, 0x21e1cde6); /* 25 */
|
|
ROUND2(d, a, b, c, X[14], 9, 0xc33707d6); /* 26 */
|
|
ROUND2(c, d, a, b, X[3], 14, 0xf4d50d87); /* 27 */
|
|
ROUND2(b, c, d, a, X[8], 20, 0x455a14ed); /* 28 */
|
|
ROUND2(a, b, c, d, X[13], 5, 0xa9e3e905); /* 29 */
|
|
ROUND2(d, a, b, c, X[2], 9, 0xfcefa3f8); /* 30 */
|
|
ROUND2(c, d, a, b, X[7], 14, 0x676f02d9); /* 31 */
|
|
ROUND2(b, c, d, a, X[12], 20, 0x8d2a4c8a); /* 32 */
|
|
|
|
/*
|
|
* Round 3
|
|
* Let [abcd k s t] denote the operation
|
|
* a = b + ((a + H(b,c,d) + X[k] + T[i]) <<< s)
|
|
*/
|
|
ROUND3(a, b, c, d, X[5], 4, 0xfffa3942); /* 33 */
|
|
ROUND3(d, a, b, c, X[8], 11, 0x8771f681); /* 34 */
|
|
ROUND3(c, d, a, b, X[11], 16, 0x6d9d6122); /* 35 */
|
|
ROUND3(b, c, d, a, X[14], 23, 0xfde5380c); /* 36 */
|
|
ROUND3(a, b, c, d, X[1], 4, 0xa4beea44); /* 37 */
|
|
ROUND3(d, a, b, c, X[4], 11, 0x4bdecfa9); /* 38 */
|
|
ROUND3(c, d, a, b, X[7], 16, 0xf6bb4b60); /* 39 */
|
|
ROUND3(b, c, d, a, X[10], 23, 0xbebfbc70); /* 40 */
|
|
ROUND3(a, b, c, d, X[13], 4, 0x289b7ec6); /* 41 */
|
|
ROUND3(d, a, b, c, X[0], 11, 0xeaa127fa); /* 42 */
|
|
ROUND3(c, d, a, b, X[3], 16, 0xd4ef3085); /* 43 */
|
|
ROUND3(b, c, d, a, X[6], 23, 0x4881d05); /* 44 */
|
|
ROUND3(a, b, c, d, X[9], 4, 0xd9d4d039); /* 45 */
|
|
ROUND3(d, a, b, c, X[12], 11, 0xe6db99e5); /* 46 */
|
|
ROUND3(c, d, a, b, X[15], 16, 0x1fa27cf8); /* 47 */
|
|
ROUND3(b, c, d, a, X[2], 23, 0xc4ac5665); /* 48 */
|
|
|
|
/*
|
|
* Round 4
|
|
* Let [abcd k s t] denote the operation
|
|
* a = b + ((a + I(b,c,d) + X[k] + T[i]) <<< s)
|
|
*/
|
|
ROUND4(a, b, c, d, X[0], 6, 0xf4292244); /* 49 */
|
|
ROUND4(d, a, b, c, X[7], 10, 0x432aff97); /* 50 */
|
|
ROUND4(c, d, a, b, X[14], 15, 0xab9423a7); /* 51 */
|
|
ROUND4(b, c, d, a, X[5], 21, 0xfc93a039); /* 52 */
|
|
ROUND4(a, b, c, d, X[12], 6, 0x655b59c3); /* 53 */
|
|
ROUND4(d, a, b, c, X[3], 10, 0x8f0ccc92); /* 54 */
|
|
ROUND4(c, d, a, b, X[10], 15, 0xffeff47d); /* 55 */
|
|
ROUND4(b, c, d, a, X[1], 21, 0x85845dd1); /* 56 */
|
|
ROUND4(a, b, c, d, X[8], 6, 0x6fa87e4f); /* 57 */
|
|
ROUND4(d, a, b, c, X[15], 10, 0xfe2ce6e0); /* 58 */
|
|
ROUND4(c, d, a, b, X[6], 15, 0xa3014314); /* 59 */
|
|
ROUND4(b, c, d, a, X[13], 21, 0x4e0811a1); /* 60 */
|
|
ROUND4(a, b, c, d, X[4], 6, 0xf7537e82); /* 61 */
|
|
ROUND4(d, a, b, c, X[11], 10, 0xbd3af235); /* 62 */
|
|
ROUND4(c, d, a, b, X[2], 15, 0x2ad7d2bb); /* 63 */
|
|
ROUND4(b, c, d, a, X[9], 21, 0xeb86d391); /* 64 */
|
|
|
|
/* Compute the i^th intermediate hash value H^(i) */
|
|
pMD5_CTX->HashValue[0] += a;
|
|
pMD5_CTX->HashValue[1] += b;
|
|
pMD5_CTX->HashValue[2] += c;
|
|
pMD5_CTX->HashValue[3] += d;
|
|
|
|
NdisZeroMemory(pMD5_CTX->Block, MD5_BLOCK_SIZE);
|
|
pMD5_CTX->BlockLen = 0;
|
|
} /* End of MD5_Hash */
|
|
|
|
/*
|
|
========================================================================
|
|
Routine Description:
|
|
The message is appended to block. If block size > 64 bytes, the MD5_Hash
|
|
will be called.
|
|
|
|
Arguments:
|
|
pMD5_CTX Pointer to struct rt_md5_ctx_struc
|
|
message Message context
|
|
messageLen The length of message in bytes
|
|
|
|
Return Value:
|
|
None
|
|
|
|
Note:
|
|
None
|
|
========================================================================
|
|
*/
|
|
void MD5_Append(struct rt_md5_ctx_struc *pMD5_CTX,
|
|
IN const u8 Message[], u32 MessageLen)
|
|
{
|
|
u32 appendLen = 0;
|
|
u32 diffLen = 0;
|
|
|
|
while (appendLen != MessageLen) {
|
|
diffLen = MessageLen - appendLen;
|
|
if ((pMD5_CTX->BlockLen + diffLen) < MD5_BLOCK_SIZE) {
|
|
NdisMoveMemory(pMD5_CTX->Block + pMD5_CTX->BlockLen,
|
|
Message + appendLen, diffLen);
|
|
pMD5_CTX->BlockLen += diffLen;
|
|
appendLen += diffLen;
|
|
} else {
|
|
NdisMoveMemory(pMD5_CTX->Block + pMD5_CTX->BlockLen,
|
|
Message + appendLen,
|
|
MD5_BLOCK_SIZE - pMD5_CTX->BlockLen);
|
|
appendLen += (MD5_BLOCK_SIZE - pMD5_CTX->BlockLen);
|
|
pMD5_CTX->BlockLen = MD5_BLOCK_SIZE;
|
|
MD5_Hash(pMD5_CTX);
|
|
} /* End of if */
|
|
} /* End of while */
|
|
pMD5_CTX->MessageLen += MessageLen;
|
|
} /* End of MD5_Append */
|
|
|
|
/*
|
|
========================================================================
|
|
Routine Description:
|
|
1. Append bit 1 to end of the message
|
|
2. Append the length of message in rightmost 64 bits
|
|
3. Transform the Hash Value to digest message
|
|
|
|
Arguments:
|
|
pMD5_CTX Pointer to struct rt_md5_ctx_struc
|
|
|
|
Return Value:
|
|
digestMessage Digest message
|
|
|
|
Note:
|
|
None
|
|
========================================================================
|
|
*/
|
|
void MD5_End(struct rt_md5_ctx_struc *pMD5_CTX, u8 DigestMessage[])
|
|
{
|
|
u32 index;
|
|
u64 message_length_bits;
|
|
|
|
/* append 1 bits to end of the message */
|
|
NdisFillMemory(pMD5_CTX->Block + pMD5_CTX->BlockLen, 1, 0x80);
|
|
|
|
/* 55 = 64 - 8 - 1: append 1 bit(1 byte) and message length (8 bytes) */
|
|
if (pMD5_CTX->BlockLen > 55)
|
|
MD5_Hash(pMD5_CTX);
|
|
/* End of if */
|
|
|
|
/* Append the length of message in rightmost 64 bits */
|
|
message_length_bits = pMD5_CTX->MessageLen * 8;
|
|
message_length_bits = cpu2le64(message_length_bits);
|
|
NdisMoveMemory(&pMD5_CTX->Block[56], &message_length_bits, 8);
|
|
MD5_Hash(pMD5_CTX);
|
|
|
|
/* Return message digest, transform the u32 hash value to bytes */
|
|
for (index = 0; index < 4; index++)
|
|
pMD5_CTX->HashValue[index] =
|
|
cpu2le32(pMD5_CTX->HashValue[index]);
|
|
/* End of for */
|
|
NdisMoveMemory(DigestMessage, pMD5_CTX->HashValue, MD5_DIGEST_SIZE);
|
|
} /* End of MD5_End */
|
|
|
|
/*
|
|
========================================================================
|
|
Routine Description:
|
|
MD5 algorithm
|
|
|
|
Arguments:
|
|
message Message context
|
|
messageLen The length of message in bytes
|
|
|
|
Return Value:
|
|
digestMessage Digest message
|
|
|
|
Note:
|
|
None
|
|
========================================================================
|
|
*/
|
|
void RT_MD5(IN const u8 Message[],
|
|
u32 MessageLen, u8 DigestMessage[])
|
|
{
|
|
struct rt_md5_ctx_struc md5_ctx;
|
|
|
|
NdisZeroMemory(&md5_ctx, sizeof(struct rt_md5_ctx_struc));
|
|
MD5_Init(&md5_ctx);
|
|
MD5_Append(&md5_ctx, Message, MessageLen);
|
|
MD5_End(&md5_ctx, DigestMessage);
|
|
} /* End of RT_MD5 */
|
|
|
|
#endif /* MD5_SUPPORT */
|
|
|
|
/* End of crypt_md5.c */
|