summaryrefslogtreecommitdiff
path: root/cesar/cp2
diff options
context:
space:
mode:
authorlaranjeiro2008-06-17 15:56:12 +0000
committerlaranjeiro2008-06-17 15:56:12 +0000
commitd1232e983eb3836992f6eda1fedb36fd9886f579 (patch)
tree431a25804688c683ba75e09118793677625988be /cesar/cp2
parent402be329044891a65347d0ff353d4c331a116a0d (diff)
cp2/secu: SHA hash tested.
git-svn-id: svn+ssh://pessac/svn/cesar/trunk@2360 017c9cb6-072f-447c-8318-d5b54f68fe89
Diffstat (limited to 'cesar/cp2')
-rw-r--r--cesar/cp2/secu/inc/sha256.h28
-rw-r--r--cesar/cp2/secu/sha256.h7
-rw-r--r--cesar/cp2/secu/src/sha256.c294
-rw-r--r--cesar/cp2/secu/test/src/test-sha2.c53
4 files changed, 382 insertions, 0 deletions
diff --git a/cesar/cp2/secu/inc/sha256.h b/cesar/cp2/secu/inc/sha256.h
index c15be95868..d9350fc0dd 100644
--- a/cesar/cp2/secu/inc/sha256.h
+++ b/cesar/cp2/secu/inc/sha256.h
@@ -1,3 +1,4 @@
+<<<<<<< HEAD:cp2/secu/inc/sha256.h
#ifndef cp2_secu_inc_sha256_h
#define cp2_secu_inc_sha256_h
/* Cesar project {{{
@@ -37,3 +38,30 @@ void
cp_secu_sha2_process (sha2_t *ctx, u8 *data, uint length);
#endif /* cp2_secu_inc_sha256_h */
+=======
+#ifndef _SHA256_H
+#define _SHA256_H
+
+#ifndef uint8
+#define uint8 unsigned char
+#endif
+
+#ifndef uint32
+#define uint32 unsigned long int
+#endif
+
+typedef struct
+{
+ uint32 total[2];
+ uint32 state[8];
+ uint8 buffer[64];
+}
+sha256_context;
+
+void sha256_starts( sha256_context *ctx );
+void sha256_update( sha256_context *ctx, uint8 *input, uint32 length );
+void sha256_finish( sha256_context *ctx, uint8 digest[32] );
+
+#endif /* sha256.h */
+
+>>>>>>> cp2/secu : tested the SHA256.:cp2/secu/inc/sha256.h
diff --git a/cesar/cp2/secu/sha256.h b/cesar/cp2/secu/sha256.h
index 056fb75fc3..06d0ccdef7 100644
--- a/cesar/cp2/secu/sha256.h
+++ b/cesar/cp2/secu/sha256.h
@@ -17,10 +17,17 @@
/** SHA 256
* \param data the buffer containing the data to hash.
+<<<<<<< HEAD:cp2/secu/sha256.h
* \param length the length of the data.
* \return the buffer with the hashed value.
*/
void
cp_secu_sha256 (u8 *data, uint length);
+=======
+ * \return the buffer with the hashed value.
+ */
+void
+cp_secu_sha256 (u8 *data);
+>>>>>>> cp2/secu : tested the SHA256.:cp2/secu/sha256.h
#endif /* cp2_secu_sha256_h */
diff --git a/cesar/cp2/secu/src/sha256.c b/cesar/cp2/secu/src/sha256.c
index 0b65eb90fe..a095d5c31a 100644
--- a/cesar/cp2/secu/src/sha256.c
+++ b/cesar/cp2/secu/src/sha256.c
@@ -1,3 +1,4 @@
+<<<<<<< HEAD:cp2/secu/src/sha256.c
/* Cesar project {{{
*
* Copyright (C) 2008 Spidcom
@@ -44,6 +45,69 @@ cp_secu_sha2_init (sha2_t *ctx)
dbg_assert(ctx);
/* SHA-256 */
+=======
+/*
+ * FIPS-180-2 compliant SHA-256 implementation
+ *
+ * Copyright (C) 2001-2003 Christophe Devine
+ *
+ * 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 "common/std.h"
+#include <string.h>
+#include "lib/swap.h"
+
+#include "cp2/secu/inc/sha256.h"
+
+//#define GET_UINT32(n,b,i) \
+//{ \
+// (n) = ( (uint32) (b)[(i) ] << 24 ) \
+// | ( (uint32) (b)[(i) + 1] << 16 ) \
+// | ( (uint32) (b)[(i) + 2] << 8 ) \
+// | ( (uint32) (b)[(i) + 3] ); \
+//}
+//
+//#define PUT_UINT32(n,b,i) \
+//{ \
+// (b)[(i) ] = (uint8) ( (n) >> 24 ); \
+// (b)[(i) + 1] = (uint8) ( (n) >> 16 ); \
+// (b)[(i) + 2] = (uint8) ( (n) >> 8 ); \
+// (b)[(i) + 3] = (uint8) ( (n) ); \
+//}
+
+#define GET_UINT32(n,b,i) \
+{ \
+ uint _tmp = b[i + 3] << 24 | b[i + 2] << 16 \
+ | b[i + 1] << 8 | b[i]; \
+ (n) = swap32(_tmp); \
+}
+
+#define PUT_UINT32(n,b,i) \
+{ \
+ (b)[(i) ] = (uint8) ( (n) >> 24 ); \
+ (b)[(i) + 1] = (uint8) ( (n) >> 16 ); \
+ (b)[(i) + 2] = (uint8) ( (n) >> 8 ); \
+ (b)[(i) + 3] = (uint8) ( (n) ); \
+}
+
+void sha256_starts( sha256_context *ctx )
+{
+ ctx->total[0] = 0;
+ ctx->total[1] = 0;
+
+>>>>>>> cp2/secu : tested the SHA256.:cp2/secu/src/sha256.c
ctx->state[0] = 0x6A09E667;
ctx->state[1] = 0xBB67AE85;
ctx->state[2] = 0x3C6EF372;
@@ -54,6 +118,7 @@ cp_secu_sha2_init (sha2_t *ctx)
ctx->state[7] = 0x5BE0CD19;
}
+<<<<<<< HEAD:cp2/secu/src/sha256.c
/**
* Process the Hash
* \param ctx the module context.
@@ -154,3 +219,232 @@ cp_secu_sha256 (u8 *data, uint length)
cp_secu_sha2_process (&sha, data, length);
}
+=======
+void sha256_process( sha256_context *ctx, uint8 data[64] )
+{
+ uint32 temp1, temp2, W[64];
+ uint32 A, B, C, D, E, F, G, H;
+
+ GET_UINT32( W[0], data, 0 );
+ GET_UINT32( W[1], data, 4 );
+ GET_UINT32( W[2], data, 8 );
+ GET_UINT32( W[3], data, 12 );
+ GET_UINT32( W[4], data, 16 );
+ GET_UINT32( W[5], data, 20 );
+ GET_UINT32( W[6], data, 24 );
+ GET_UINT32( W[7], data, 28 );
+ GET_UINT32( W[8], data, 32 );
+ GET_UINT32( W[9], data, 36 );
+ GET_UINT32( W[10], data, 40 );
+ GET_UINT32( W[11], data, 44 );
+ GET_UINT32( W[12], data, 48 );
+ GET_UINT32( W[13], data, 52 );
+ GET_UINT32( W[14], data, 56 );
+ GET_UINT32( W[15], data, 60 );
+
+#define SHR(x,n) ((x & 0xFFFFFFFF) >> n)
+#define ROTR(x,n) (SHR(x,n) | (x << (32 - n)))
+
+#define S0(x) (ROTR(x, 7) ^ ROTR(x,18) ^ SHR(x, 3))
+#define S1(x) (ROTR(x,17) ^ ROTR(x,19) ^ SHR(x,10))
+
+#define S2(x) (ROTR(x, 2) ^ ROTR(x,13) ^ ROTR(x,22))
+#define S3(x) (ROTR(x, 6) ^ ROTR(x,11) ^ ROTR(x,25))
+
+#define F0(x,y,z) ((x & y) | (z & (x | y)))
+#define F1(x,y,z) (z ^ (x & (y ^ z)))
+
+#define R(t) \
+( \
+ W[t] = S1(W[t - 2]) + W[t - 7] + \
+ S0(W[t - 15]) + W[t - 16] \
+)
+
+#define P(a,b,c,d,e,f,g,h,x,K) \
+{ \
+ temp1 = h + S3(e) + F1(e,f,g) + K + x; \
+ temp2 = S2(a) + F0(a,b,c); \
+ d += temp1; h = temp1 + temp2; \
+}
+
+ A = ctx->state[0];
+ B = ctx->state[1];
+ C = ctx->state[2];
+ D = ctx->state[3];
+ E = ctx->state[4];
+ F = ctx->state[5];
+ G = ctx->state[6];
+ H = ctx->state[7];
+
+ P( A, B, C, D, E, F, G, H, W[ 0], 0x428A2F98 );
+ P( H, A, B, C, D, E, F, G, W[ 1], 0x71374491 );
+ P( G, H, A, B, C, D, E, F, W[ 2], 0xB5C0FBCF );
+ P( F, G, H, A, B, C, D, E, W[ 3], 0xE9B5DBA5 );
+ P( E, F, G, H, A, B, C, D, W[ 4], 0x3956C25B );
+ P( D, E, F, G, H, A, B, C, W[ 5], 0x59F111F1 );
+ P( C, D, E, F, G, H, A, B, W[ 6], 0x923F82A4 );
+ P( B, C, D, E, F, G, H, A, W[ 7], 0xAB1C5ED5 );
+ P( A, B, C, D, E, F, G, H, W[ 8], 0xD807AA98 );
+ P( H, A, B, C, D, E, F, G, W[ 9], 0x12835B01 );
+ P( G, H, A, B, C, D, E, F, W[10], 0x243185BE );
+ P( F, G, H, A, B, C, D, E, W[11], 0x550C7DC3 );
+ P( E, F, G, H, A, B, C, D, W[12], 0x72BE5D74 );
+ P( D, E, F, G, H, A, B, C, W[13], 0x80DEB1FE );
+ P( C, D, E, F, G, H, A, B, W[14], 0x9BDC06A7 );
+ P( B, C, D, E, F, G, H, A, W[15], 0xC19BF174 );
+ P( A, B, C, D, E, F, G, H, R(16), 0xE49B69C1 );
+ P( H, A, B, C, D, E, F, G, R(17), 0xEFBE4786 );
+ P( G, H, A, B, C, D, E, F, R(18), 0x0FC19DC6 );
+ P( F, G, H, A, B, C, D, E, R(19), 0x240CA1CC );
+ P( E, F, G, H, A, B, C, D, R(20), 0x2DE92C6F );
+ P( D, E, F, G, H, A, B, C, R(21), 0x4A7484AA );
+ P( C, D, E, F, G, H, A, B, R(22), 0x5CB0A9DC );
+ P( B, C, D, E, F, G, H, A, R(23), 0x76F988DA );
+ P( A, B, C, D, E, F, G, H, R(24), 0x983E5152 );
+ P( H, A, B, C, D, E, F, G, R(25), 0xA831C66D );
+ P( G, H, A, B, C, D, E, F, R(26), 0xB00327C8 );
+ P( F, G, H, A, B, C, D, E, R(27), 0xBF597FC7 );
+ P( E, F, G, H, A, B, C, D, R(28), 0xC6E00BF3 );
+ P( D, E, F, G, H, A, B, C, R(29), 0xD5A79147 );
+ P( C, D, E, F, G, H, A, B, R(30), 0x06CA6351 );
+ P( B, C, D, E, F, G, H, A, R(31), 0x14292967 );
+ P( A, B, C, D, E, F, G, H, R(32), 0x27B70A85 );
+ P( H, A, B, C, D, E, F, G, R(33), 0x2E1B2138 );
+ P( G, H, A, B, C, D, E, F, R(34), 0x4D2C6DFC );
+ P( F, G, H, A, B, C, D, E, R(35), 0x53380D13 );
+ P( E, F, G, H, A, B, C, D, R(36), 0x650A7354 );
+ P( D, E, F, G, H, A, B, C, R(37), 0x766A0ABB );
+ P( C, D, E, F, G, H, A, B, R(38), 0x81C2C92E );
+ P( B, C, D, E, F, G, H, A, R(39), 0x92722C85 );
+ P( A, B, C, D, E, F, G, H, R(40), 0xA2BFE8A1 );
+ P( H, A, B, C, D, E, F, G, R(41), 0xA81A664B );
+ P( G, H, A, B, C, D, E, F, R(42), 0xC24B8B70 );
+ P( F, G, H, A, B, C, D, E, R(43), 0xC76C51A3 );
+ P( E, F, G, H, A, B, C, D, R(44), 0xD192E819 );
+ P( D, E, F, G, H, A, B, C, R(45), 0xD6990624 );
+ P( C, D, E, F, G, H, A, B, R(46), 0xF40E3585 );
+ P( B, C, D, E, F, G, H, A, R(47), 0x106AA070 );
+ P( A, B, C, D, E, F, G, H, R(48), 0x19A4C116 );
+ P( H, A, B, C, D, E, F, G, R(49), 0x1E376C08 );
+ P( G, H, A, B, C, D, E, F, R(50), 0x2748774C );
+ P( F, G, H, A, B, C, D, E, R(51), 0x34B0BCB5 );
+ P( E, F, G, H, A, B, C, D, R(52), 0x391C0CB3 );
+ P( D, E, F, G, H, A, B, C, R(53), 0x4ED8AA4A );
+ P( C, D, E, F, G, H, A, B, R(54), 0x5B9CCA4F );
+ P( B, C, D, E, F, G, H, A, R(55), 0x682E6FF3 );
+ P( A, B, C, D, E, F, G, H, R(56), 0x748F82EE );
+ P( H, A, B, C, D, E, F, G, R(57), 0x78A5636F );
+ P( G, H, A, B, C, D, E, F, R(58), 0x84C87814 );
+ P( F, G, H, A, B, C, D, E, R(59), 0x8CC70208 );
+ P( E, F, G, H, A, B, C, D, R(60), 0x90BEFFFA );
+ P( D, E, F, G, H, A, B, C, R(61), 0xA4506CEB );
+ P( C, D, E, F, G, H, A, B, R(62), 0xBEF9A3F7 );
+ P( B, C, D, E, F, G, H, A, R(63), 0xC67178F2 );
+
+ ctx->state[0] += A;
+ ctx->state[1] += B;
+ ctx->state[2] += C;
+ ctx->state[3] += D;
+ ctx->state[4] += E;
+ ctx->state[5] += F;
+ ctx->state[6] += G;
+ ctx->state[7] += H;
+}
+
+void sha256_update( sha256_context *ctx, uint8 *input, uint32 length )
+{
+ uint32 left, fill;
+
+ if( ! length ) return;
+
+ left = ctx->total[0] & 0x3F;
+ fill = 64 - left;
+
+ ctx->total[0] += length;
+ ctx->total[0] &= 0xFFFFFFFF;
+
+ if( ctx->total[0] < length )
+ ctx->total[1]++;
+
+ if( left && length >= fill )
+ {
+ memcpy( (void *) (ctx->buffer + left),
+ (void *) input, fill );
+ sha256_process( ctx, ctx->buffer );
+ length -= fill;
+ input += fill;
+ left = 0;
+ }
+
+ while( length >= 64 )
+ {
+ sha256_process( ctx, input );
+ length -= 64;
+ input += 64;
+ }
+
+ if( length )
+ {
+ memcpy( (void *) (ctx->buffer + left),
+ (void *) input, length );
+ }
+}
+
+static uint8 sha256_padding[64] =
+{
+ 0x80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
+};
+
+void sha256_finish( sha256_context *ctx, uint8 digest[32] )
+{
+ uint32 last, padn;
+ uint32 high, low;
+ uint8 msglen[8];
+
+ high = ( ctx->total[0] >> 29 )
+ | ( ctx->total[1] << 3 );
+ low = ( ctx->total[0] << 3 );
+
+ PUT_UINT32( high, msglen, 0 );
+ PUT_UINT32( low, msglen, 4 );
+
+ last = ctx->total[0] & 0x3F;
+ padn = ( last < 56 ) ? ( 56 - last ) : ( 120 - last );
+
+ sha256_update( ctx, sha256_padding, padn );
+ sha256_update( ctx, msglen, 8 );
+
+ PUT_UINT32( ctx->state[0], digest, 0 );
+ PUT_UINT32( ctx->state[1], digest, 4 );
+ PUT_UINT32( ctx->state[2], digest, 8 );
+ PUT_UINT32( ctx->state[3], digest, 12 );
+ PUT_UINT32( ctx->state[4], digest, 16 );
+ PUT_UINT32( ctx->state[5], digest, 20 );
+ PUT_UINT32( ctx->state[6], digest, 24 );
+ PUT_UINT32( ctx->state[7], digest, 28 );
+}
+
+/** Compute the SHA 256 Hash value.
+ */
+void
+cp_secu_sha256 (u8 *buffer)
+{
+ uint sha256sum[8];
+ uint i;
+ sha256_context ctx;
+
+ sha256_starts(&ctx);
+ sha256_update(&ctx, (u8 *) buffer, strlen((char *)buffer));
+ sha256_finish(&ctx, (u8*) sha256sum);
+
+ for (i = 0; i < 8; i++)
+ {
+ sha256sum[i] = swap32(sha256sum[i]);
+ }
+
+ memcpy (buffer, sha256sum, 64);
+}
+>>>>>>> cp2/secu : tested the SHA256.:cp2/secu/src/sha256.c
diff --git a/cesar/cp2/secu/test/src/test-sha2.c b/cesar/cp2/secu/test/src/test-sha2.c
index e4da68d8c3..333f783cd5 100644
--- a/cesar/cp2/secu/test/src/test-sha2.c
+++ b/cesar/cp2/secu/test/src/test-sha2.c
@@ -23,21 +23,74 @@ test_case_sha2 (test_t test)
{
u8 buffer[64] __attribute__((aligned(64))) =
"The quick brown fox jumps over the lazy dog\0";
+<<<<<<< HEAD:cp2/secu/test/src/test-sha2.c
uint result [16] = {0xd7a8fbb3, 0x07d78094, 0x69ca9abc,
0xb0082e4f, 0x8d5651e4, 0x6d3cdb76, 0x2d02d0bf, 0x37c9e592};
uint i;
cp_secu_sha256 (buffer, strlen( (char*) buffer));
+=======
+ uint result [8] = {0xd7a8fbb3, 0x07d78094, 0x69ca9abc,
+ 0xb0082e4f, 0x8d5651e4, 0x6d3cdb76, 0x2d02d0bf, 0x37c9e592};
+
+ u8 buffer2[64] __attribute__((aligned(64))) =
+ "The quick brown fox jumps over the lazy cog\0";
+ uint result2 [8] = {0xe4c4d8f3, 0xbf76b692, 0xde791a17, 0x3e053211,
+ 0x50f7a345, 0xb46484fe, 0x427f6acc, 0x7ecc81be};
+
+ u8 buffer3[64] __attribute__((aligned(64))) =
+ "";
+ uint result3 [8] = {0xe3b0c442, 0x98fc1c14, 0x9afbf4c8, 0x996fb924,
+ 0x27ae41e4, 0x649b934c, 0xa495991b, 0x7852b855};
+
+ uint i;
+
+ cp_secu_sha256 (buffer);
+>>>>>>> cp2/secu : tested the SHA256.:cp2/secu/test/src/test-sha2.c
test_case_begin (test, "SHA 256");
test_begin (test, "SHA 256")
{
+<<<<<<< HEAD:cp2/secu/test/src/test-sha2.c
for (i = 0; i < 16; i++)
{
test_fail_if (read_u32_from_word (buffer) != result[i],
"Wrong buffer out value, value read : %x, shall be : %x",
read_u32_from_word (buffer), result[i]);
+=======
+ for (i = 0; i < 8; i++)
+ {
+ test_fail_if (read_u32_from_word (buffer + i*4) != result[i],
+ "Wrong buffer out value, value read : %x, shall be : %x",
+ read_u32_from_word (buffer + i*4), result[i]);
+ }
+ }
+ test_end;
+
+ cp_secu_sha256 (buffer2);
+
+ test_begin (test, "SHA 256 Test 2")
+ {
+ for (i = 0; i < 8; i++)
+ {
+ test_fail_if (read_u32_from_word (buffer2 + i*4) != result2[i],
+ "Wrong buffer out value, value read : %x, shall be : %x",
+ read_u32_from_word (buffer2 + i*4), result2[i]);
+ }
+ }
+ test_end;
+
+ cp_secu_sha256 (buffer3);
+
+ test_begin (test, "SHA 256 Test 3")
+ {
+ for (i = 0; i < 8; i++)
+ {
+ test_fail_if (read_u32_from_word (buffer3 + i*4) != result3[i],
+ "Wrong buffer out value, value read : %x, shall be : %x",
+ read_u32_from_word (buffer3 + i*4), result3[i]);
+>>>>>>> cp2/secu : tested the SHA256.:cp2/secu/test/src/test-sha2.c
}
}
test_end;