| /******************************************************************************* |
| Copyright (C) Marvell International Ltd. and its affiliates |
| |
| This software file (the "File") is owned and distributed by Marvell |
| International Ltd. and/or its affiliates ("Marvell") under the following |
| alternative licensing terms. Once you have made an election to distribute the |
| File under one of the following license alternatives, please (i) delete this |
| introductory statement regarding license alternatives, (ii) delete the two |
| license alternatives that you have not elected to use and (iii) preserve the |
| Marvell copyright notice above. |
| |
| ******************************************************************************** |
| Marvell Commercial License Option |
| |
| If you received this File from Marvell and you have entered into a commercial |
| license agreement (a "Commercial License") with Marvell, the File is licensed |
| to you under the terms of the applicable Commercial License. |
| |
| ******************************************************************************** |
| Marvell GPL License Option |
| |
| If you received this File from Marvell, you may opt to use, redistribute and/or |
| modify this File in accordance with the terms and conditions of the General |
| Public License Version 2, June 1991 (the "GPL License"), a copy of which is |
| available along with the File in the license.txt file or by writing to the Free |
| Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 or |
| on the worldwide web at http://www.gnu.org/licenses/gpl.txt. |
| |
| THE FILE IS DISTRIBUTED AS-IS, WITHOUT WARRANTY OF ANY KIND, AND THE IMPLIED |
| WARRANTIES OF MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE ARE EXPRESSLY |
| DISCLAIMED. The GPL License provides additional details about this warranty |
| disclaimer. |
| ******************************************************************************** |
| Marvell BSD License Option |
| |
| If you received this File from Marvell, you may opt to use, redistribute and/or |
| modify this File under the following licensing terms. |
| Redistribution and use in source and binary forms, with or without modification, |
| are permitted provided that the following conditions are met: |
| |
| * Redistributions of source code must retain the above copyright notice, |
| this list of conditions and the following disclaimer. |
| |
| * Redistributions in binary form must reproduce the above copyright |
| notice, this list of conditions and the following disclaimer in the |
| documentation and/or other materials provided with the distribution. |
| |
| * Neither the name of Marvell nor the names of its contributors may be |
| used to endorse or promote products derived from this software without |
| specific prior written permission. |
| |
| THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND |
| ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED |
| WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE |
| DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR |
| ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES |
| (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; |
| LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON |
| ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS |
| SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| |
| *******************************************************************************/ |
| |
| #include "mvOs.h" |
| #include "mvSHA1.h" |
| |
| #define SHA1HANDSOFF |
| |
| typedef union |
| { |
| MV_U8 c[64]; |
| MV_U32 l[16]; |
| |
| } CHAR64LONG16; |
| |
| static void mvSHA1Transform(MV_U32 state[5], const MV_U8 *buffer); |
| |
| #define rol(value, bits) (((value) << (bits)) | ((value) >> (32 - (bits)))) |
| |
| |
| #ifdef MV_CPU_LE |
| #define blk0(i) (block->l[i] = (rol(block->l[i], 24) & 0xFF00FF00) | \ |
| (rol(block->l[i], 8) & 0x00FF00FF)) |
| #else |
| #define blk0(i) block->l[i] |
| #endif |
| #define blk(i) (block->l[i & 15] = rol(block->l[(i + 13) & 15] ^ \ |
| block->l[(i + 8) & 15] ^ block->l[(i + 2) & 15] ^ block->l[i & 15], 1)) |
| |
| /* (R0+R1), R2, R3, R4 are the different operations used in SHA1 */ |
| #define R0(v,w,x,y,z,i) \ |
| z += ((w & (x ^ y)) ^ y) + blk0(i) + 0x5A827999 + rol(v, 5); \ |
| w = rol(w, 30); |
| #define R1(v,w,x,y,z,i) \ |
| z += ((w & (x ^ y)) ^ y) + blk(i) + 0x5A827999 + rol(v, 5); \ |
| w = rol(w, 30); |
| #define R2(v,w,x,y,z,i) \ |
| z += (w ^ x ^ y) + blk(i) + 0x6ED9EBA1 + rol(v, 5); w = rol(w, 30); |
| #define R3(v,w,x,y,z,i) \ |
| z += (((w | x) & y) | (w & x)) + blk(i) + 0x8F1BBCDC + rol(v, 5); \ |
| w = rol(w, 30); |
| #define R4(v,w,x,y,z,i) \ |
| z += (w ^ x ^ y) + blk(i) + 0xCA62C1D6 + rol(v, 5); \ |
| w=rol(w, 30); |
| |
| /* Hash a single 512-bit block. This is the core of the algorithm. */ |
| static void mvSHA1Transform(MV_U32 state[5], const MV_U8 *buffer) |
| { |
| MV_U32 a, b, c, d, e; |
| CHAR64LONG16* block; |
| |
| #ifdef SHA1HANDSOFF |
| static MV_U32 workspace[16]; |
| |
| block = (CHAR64LONG16 *) workspace; |
| memcpy(block, buffer, 64); |
| #else |
| block = (CHAR64LONG16 *) buffer; |
| #endif |
| /* Copy context->state[] to working vars */ |
| a = state[0]; |
| b = state[1]; |
| c = state[2]; |
| d = state[3]; |
| e = state[4]; |
| /* 4 rounds of 20 operations each. Loop unrolled. */ |
| R0(a,b,c,d,e, 0); R0(e,a,b,c,d, 1); R0(d,e,a,b,c, 2); R0(c,d,e,a,b, 3); |
| R0(b,c,d,e,a, 4); R0(a,b,c,d,e, 5); R0(e,a,b,c,d, 6); R0(d,e,a,b,c, 7); |
| R0(c,d,e,a,b, 8); R0(b,c,d,e,a, 9); R0(a,b,c,d,e,10); R0(e,a,b,c,d,11); |
| R0(d,e,a,b,c,12); R0(c,d,e,a,b,13); R0(b,c,d,e,a,14); R0(a,b,c,d,e,15); |
| R1(e,a,b,c,d,16); R1(d,e,a,b,c,17); R1(c,d,e,a,b,18); R1(b,c,d,e,a,19); |
| R2(a,b,c,d,e,20); R2(e,a,b,c,d,21); R2(d,e,a,b,c,22); R2(c,d,e,a,b,23); |
| R2(b,c,d,e,a,24); R2(a,b,c,d,e,25); R2(e,a,b,c,d,26); R2(d,e,a,b,c,27); |
| R2(c,d,e,a,b,28); R2(b,c,d,e,a,29); R2(a,b,c,d,e,30); R2(e,a,b,c,d,31); |
| R2(d,e,a,b,c,32); R2(c,d,e,a,b,33); R2(b,c,d,e,a,34); R2(a,b,c,d,e,35); |
| R2(e,a,b,c,d,36); R2(d,e,a,b,c,37); R2(c,d,e,a,b,38); R2(b,c,d,e,a,39); |
| R3(a,b,c,d,e,40); R3(e,a,b,c,d,41); R3(d,e,a,b,c,42); R3(c,d,e,a,b,43); |
| R3(b,c,d,e,a,44); R3(a,b,c,d,e,45); R3(e,a,b,c,d,46); R3(d,e,a,b,c,47); |
| R3(c,d,e,a,b,48); R3(b,c,d,e,a,49); R3(a,b,c,d,e,50); R3(e,a,b,c,d,51); |
| R3(d,e,a,b,c,52); R3(c,d,e,a,b,53); R3(b,c,d,e,a,54); R3(a,b,c,d,e,55); |
| R3(e,a,b,c,d,56); R3(d,e,a,b,c,57); R3(c,d,e,a,b,58); R3(b,c,d,e,a,59); |
| R4(a,b,c,d,e,60); R4(e,a,b,c,d,61); R4(d,e,a,b,c,62); R4(c,d,e,a,b,63); |
| R4(b,c,d,e,a,64); R4(a,b,c,d,e,65); R4(e,a,b,c,d,66); R4(d,e,a,b,c,67); |
| R4(c,d,e,a,b,68); R4(b,c,d,e,a,69); R4(a,b,c,d,e,70); R4(e,a,b,c,d,71); |
| R4(d,e,a,b,c,72); R4(c,d,e,a,b,73); R4(b,c,d,e,a,74); R4(a,b,c,d,e,75); |
| R4(e,a,b,c,d,76); R4(d,e,a,b,c,77); R4(c,d,e,a,b,78); R4(b,c,d,e,a,79); |
| /* Add the working vars back into context.state[] */ |
| state[0] += a; |
| state[1] += b; |
| state[2] += c; |
| state[3] += d; |
| state[4] += e; |
| /* Wipe variables */ |
| a = b = c = d = e = 0; |
| } |
| |
| void mvSHA1Init(MV_SHA1_CTX* context) |
| { |
| /* SHA1 initialization constants */ |
| context->state[0] = 0x67452301; |
| context->state[1] = 0xEFCDAB89; |
| context->state[2] = 0x98BADCFE; |
| context->state[3] = 0x10325476; |
| context->state[4] = 0xC3D2E1F0; |
| context->count[0] = context->count[1] = 0; |
| } |
| |
| |
| /* Run your data through this. */ |
| void mvSHA1Update(MV_SHA1_CTX *context, MV_U8 const *data, |
| unsigned int len) |
| { |
| MV_U32 i, j; |
| |
| j = (context->count[0] >> 3) & 63; |
| if ((context->count[0] += len << 3) < (len << 3)) |
| context->count[1]++; |
| context->count[1] += (len >> 29); |
| if ((j + len) > 63) |
| { |
| memcpy(&context->buffer[j], data, (i = 64-j)); |
| mvSHA1Transform(context->state, context->buffer); |
| for ( ; i + 63 < len; i += 64) |
| { |
| mvSHA1Transform(context->state, &data[i]); |
| } |
| j = 0; |
| } |
| else |
| { |
| i = 0; |
| } |
| memcpy(&context->buffer[j], &data[i], len - i); |
| } |
| |
| void mvSHA1Final(MV_U8* digest, MV_SHA1_CTX* context) |
| { |
| MV_U32 i; |
| MV_U8 finalcount[8]; |
| |
| for (i = 0; i < 8; i++) |
| { |
| finalcount[i] = (unsigned char)((context->count[(i >= 4 ? 0 : 1)] >> |
| ((3-(i & 3)) * 8) ) & 255); /* Endian independent */ |
| } |
| mvSHA1Update(context, (const unsigned char *) "\200", 1); |
| while ((context->count[0] & 504) != 448) |
| { |
| mvSHA1Update(context, (const unsigned char *) "\0", 1); |
| } |
| mvSHA1Update(context, finalcount, 8); /* Should cause a mvSHA1Transform() |
| */ |
| for (i = 0; i < 20; i++) |
| { |
| digest[i] = (unsigned char) |
| ((context->state[i >> 2] >> ((3 - (i & 3)) * 8)) & 255); |
| } |
| /* Wipe variables */ |
| i = 0; |
| memset(context->buffer, 0, 64); |
| memset(context->state, 0, 20); |
| memset(context->count, 0, 8); |
| memset(finalcount, 0, 8); |
| |
| #ifdef SHA1HANDSOFF /* make SHA1Transform overwrite it's own static vars */ |
| mvSHA1Transform(context->state, context->buffer); |
| #endif |
| } |
| |
| |
| void mvSHA1(MV_U8 const *buf, unsigned int len, MV_U8* digest) |
| { |
| MV_SHA1_CTX ctx; |
| |
| mvSHA1Init(&ctx); |
| mvSHA1Update(&ctx, buf, len); |
| mvSHA1Final(digest, &ctx); |
| } |