"

 COPYRIGHT (c) 1999 by eXept Software AG

 This software is furnished under a license and may be used

 only in accordance with the terms of that license and with the

 inclusion of the above copyright notice.   This software may not

 be provided or otherwise made available to, or used by, any

 other person.  No title to or ownership of the software is

 hereby transferred.

"

HashStream subclass:#SHA1Stream

	instanceVariableNames:'hashContext'

	classVariableNames:'HashSize ContextSize'

	poolDictionaries:''

	category:'System-Crypt-Streams'

!

!SHA1Stream primitiveDefinitions!

%{

#if defined(__LSBFIRST)

# define LITTLE_ENDIAN /* This should be #define'd if true. */

#endif

#include <stdio.h>

#include <string.h>

typedef struct {

    unsigned long state[5];

    unsigned long count[2];

    unsigned char buffer[64];

} SHA1_CTX;

#if ORIGINAL

void SHA1Transform(unsigned long state[5], unsigned char buffer[64]);

void SHA1Init(SHA1_CTX* context);

void SHA1Update(SHA1_CTX* context, unsigned char* data, unsigned int len);

void SHA1Final(unsigned char digest[20], SHA1_CTX* context);

#else

#define SHA1Init   __SHA1Init

#define SHA1Update __SHA1Update

#define SHA1Final  __SHA2Final

void SHA1Init();

void SHA1Update();

void SHA1Final();

#endif

%}

! !

!SHA1Stream primitiveFunctions!

%{

/*

SHA-1 in C

By Steve Reid <steve@edmweb.com>

100% Public Domain

Test Vectors (from FIPS PUB 180-1)

"abc"

  A9993E36 4706816A BA3E2571 7850C26C 9CD0D89D

"abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq"

  84983E44 1C3BD26E BAAE4AA1 F95129E5 E54670F1

A million repetitions of "a"

  34AA973C D4C4DAA4 F61EEB2B DBAD2731 6534016F

*/

#define rol(value, bits) (((value) << (bits)) | ((value) >> (32 - (bits))))

/* blk0() and blk() perform the initial expand. */

/* I got the idea of expanding during the round function from SSLeay */

#ifdef LITTLE_ENDIAN

#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

#if ORIGINAL

SHA1Transform (unsigned long state[5], unsigned char buffer[64])

#else

SHA1Transform (state, buffer)

    unsigned long state[5]; 

    unsigned char buffer[64];

#endif

{

unsigned long a, b, c, d, e;

typedef union {

    unsigned char c[64];

    unsigned long l[16];

} CHAR64LONG16;

CHAR64LONG16* block;

#ifdef SHA1HANDSOFF

static unsigned char workspace[64];

    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;

}

/* SHA1Init - Initialize new context */

void 

#if ORIGINAL

SHA1Init(SHA1_CTX* context)

#else

SHA1Init(context)

    SHA1_CTX* context;

#endif

{

    /* 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 

#if ORIGINAL

SHA1Update(SHA1_CTX* context, unsigned char* data, unsigned int len)

#else

SHA1Update(context, data, len)

    SHA1_CTX* context;

    unsigned char* data;

    unsigned int len;

#endif

{

unsigned int 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) {

    }

    else i = 0;

    memcpy(&context->buffer[j], &data[i], len - i);

}

/* Add padding and return the message digest. */

void

#if ORIGINAL

SHA1Final(unsigned char digest[20], SHA1_CTX* context)

#else

SHA1Final(digest, context)

    unsigned char digest[20];

    SHA1_CTX* context;

#endif

{

unsigned long i, j;

unsigned char finalcount[8];

    for (i = 0; i < 8; i++) {

    }

    SHA1Update(context, (unsigned char *)"\200", 1);

    while ((context->count[0] & 504) != 448) {

    }

    SHA1Update(context, finalcount, 8);  /* Should cause a SHA1Transform() */

    for (i = 0; i < 20; i++) {

    }

    /* Wipe variables */

    i = j = 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 */

    SHA1Transform(context->state, context->buffer);

#endif

}

#if 0

/*************************************************************/

int main(int argc, char** argv)

{

int i, j;

SHA1_CTX context;

unsigned char digest[20], buffer[16384];

FILE* file;

    if (argc > 2) {

    }

    if (argc < 2) {

    }

    else {

    } 

    SHA1Init(&context);

    while (!feof(file)) {  /* note: what if ferror(file) */

    }

    SHA1Final(digest, &context);

    fclose(file);

    for (i = 0; i < 5; i++) {

    }

    putchar('\n');

    exit(0);

}

#endif

%}

! !

!SHA1Stream class methodsFor:'documentation'!

copyright

"

 COPYRIGHT (c) 1999 by eXept Software AG

 This software is furnished under a license and may be used

 only in accordance with the terms of that license and with the

 inclusion of the above copyright notice.   This software may not

 be provided or otherwise made available to, or used by, any

 other person.  No title to or ownership of the software is

 hereby transferred.

"

!

documentation

"

    Generate a SHA-1 hash value as defined in

    NIST, FIPS PUB 180-1: Secure Hash Standard, April 1995.

    This may be used as checksum

    or for generating cryptographic signatures.

    performance: roughly 9580 Kb/s on a 400Mhz PIII

    [author:]

    [see also:]

    [class variables:]

    [instance variables:]

"

!

examples

"

Test Vectors (from FIPS PUB 180-1)

'abc'

  A9993E36 4706816A BA3E2571 7850C26C 9CD0D89D

'abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq'

  84983E44 1C3BD26E BAAE4AA1 F95129E5 E54670F1

A million repetitions of 'a'

  34AA973C D4C4DAA4 F61EEB2B DBAD2731 6534016F

    |hashStream|

    hashStream := SHA1Stream new.

    hashStream nextPut:'abc'.

    hashStream hashValue printOn:Transcript base:16. Transcript cr.

    hashStream nextPut:'dbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq'.

    hashStream hashValue printOn:Transcript base:16. Transcript cr.

    |hashStream|

    hashStream := SHA1Stream new.

    hashStream nextPut:'abc' asByteArray.

    hashStream hashValue printOn:Transcript base:16. Transcript cr.

    hashStream nextPut:'dbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq' asByteArray.

    hashStream hashValue printOn:Transcript base:16. Transcript cr.

    |hashStream|

    hashStream := SHA1Stream new.

    1000000 timesRepeat:[ hashStream nextPut:$a ].

    hashStream hashValue printOn:Transcript base:16. Transcript cr.

    |hashStream|

    hashStream := SHA1Stream new.

    hashStream nextPut:'a'.

    hashStream hashValue printOn:Transcript base:16. Transcript cr.

    |hashStream|

    hashStream := SHA1Stream new.

    hashStream nextPut:$a.

    hashStream hashValue printOn:Transcript base:16. Transcript cr.

  timing throughput:

    |hashStream n t|

    hashStream := SHA1Stream new.

    n := 1000000.

    t := Time millisecondsToRun:[

    t := (t / 1000) asFloat.

    Transcript show:t; show:' seconds for '; show:(50*n/1024) asFloat; showCR:' Kb'.

    Transcript show:(n*50/1024 / t); showCR:' Kb/s'

"

! !

!SHA1Stream class methodsFor:'initialization'!

initialize

    |ctxSize|

%{

    ctxSize = __MKSMALLINT(sizeof(SHA1_CTX));

%}.

    ContextSize := ctxSize.

    HashSize := 20.

    "

    "

! !

!SHA1Stream class methodsFor:'queries'!

blockSize

    "return the block size used internally by the compression function"

    ^ 64

    "Created: / 18.3.1999 / 08:37:10 / stefan"

!

hashSize

    "return the size of the hashvalue returned by instances of this class"

    ^ HashSize

    "Modified: / 18.3.1999 / 07:54:22 / stefan"

! !

!SHA1Stream methodsFor:'initialization'!

initialize

    hashContext := ByteArray new:ContextSize.

    self reset

    "Created: / 17.3.1999 / 16:11:37 / stefan"

    "Modified: / 18.3.1999 / 07:56:46 / stefan"

! !

!SHA1Stream methodsFor:'positioning'!

reset

   "reset the stream in order to compute a new hash value"

%{

   if (__isNonNilObject(__INST(hashContext)) &&

       __qClass(__INST(hashContext)) == @global(ByteArray) &&

       __byteArraySize(__INST(hashContext)) == sizeof(SHA1_CTX)

   ) {

   }

%}.

   ^ self primitiveFailed

    "Created: / 18.3.1999 / 07:59:02 / stefan"

! !

!SHA1Stream methodsFor:'queries'!

hashValue

    "Get the value hashed so far.

     The context is kept, so that more objects may be hashed after

     retrieving a hash value"

    |digest|

    digest := ByteArray new:HashSize.

%{

    if (__isNonNilObject(__INST(hashContext)) &&

    ) {

    }

%}.

    ^ self primitiveFailed

    "Created: / 17.3.1999 / 16:13:12 / stefan"