X-Git-Url: https://jxself.org/git/?p=skeinsum.git;a=blobdiff_plain;f=SHA3api_ref.c;fp=SHA3api_ref.c;h=0000000000000000000000000000000000000000;hp=cab5c69f9ac5b08c79ebd881aedbc1dc384fb3c8;hb=c8a25186e510d8f15e54a5b4763e30e0ee9981f4;hpb=aff2ef43197ec56ae8cef81325229925454e09c7

diff --git a/SHA3api_ref.c b/SHA3api_ref.c
deleted file mode 100644
index cab5c69..0000000
--- a/SHA3api_ref.c
+++ /dev/null
@@ -1,134 +0,0 @@
-/***********************************************************************
-**
-** Implementation of the AHS API using the Skein hash function.
-**
-** Source code author: Doug Whiting, 2008.
-**
-** This algorithm and source code is released to the public domain.
-** 
-************************************************************************/
-
-#include <string.h>     /* get the memcpy/memset functions */
-#include "skein.h"      /* get the Skein API definitions   */
-#include "SHA3api_ref.h"/* get the  AHS  API definitions   */
-
-//#define SKEIN_DEBUG 1
-#ifdef SKEIN_DEBUG
-#  include <stdio.h>
-#  include <stdlib.h>
-#  include <string.h>
-#endif
-
-
-/******************************************************************/
-/*     AHS API code                                               */
-/******************************************************************/
-
-/*++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++*/
-/* select the context size and init the context */
-HashReturn Init(hashState *state, int hashbitlen)
-    {
-#if SKEIN_256_NIST_MAX_HASH_BITS
-    if (hashbitlen <= SKEIN_256_NIST_MAX_HASHBITS)
-        {
-        Skein_Assert(hashbitlen > 0,BAD_HASHLEN);
-        state->statebits = 64*SKEIN_256_STATE_WORDS;
-        return Skein_256_Init(&state->u.ctx_256,(size_t) hashbitlen);
-        }
-#endif
-    if (hashbitlen <= SKEIN_512_NIST_MAX_HASHBITS)
-        {
-        state->statebits = 64*SKEIN_512_STATE_WORDS;
-        return Skein_512_Init(&state->u.ctx_512,(size_t) hashbitlen);
-        }
-    else
-        {
-        state->statebits = 64*SKEIN1024_STATE_WORDS;
-        return Skein1024_Init(&state->u.ctx1024,(size_t) hashbitlen);
-        }
-    }
-
-/*++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++*/
-/* process data to be hashed */
-HashReturn Update(hashState *state, const BitSequence *data, DataLength databitlen)
-    {
-    /* only the final Update() call is allowed do partial bytes, else assert an error */
-    Skein_Assert((state->u.h.T[1] & SKEIN_T1_FLAG_BIT_PAD) == 0 || databitlen == 0, FAIL);
-
-    Skein_Assert(state->statebits % 256 == 0 && (state->statebits-256) < 1024,FAIL);
-    if ((databitlen & 7) == 0)  /* partial bytes? */
-        {
-        switch ((state->statebits >> 8) & 3)
-            {
-            case 2:  return Skein_512_Update(&state->u.ctx_512,data,databitlen >> 3);
-            case 1:  return Skein_256_Update(&state->u.ctx_256,data,databitlen >> 3);
-            case 0:  return Skein1024_Update(&state->u.ctx1024,data,databitlen >> 3);
-            default: return FAIL;
-            }
-        }
-    else
-        {   /* handle partial final byte */
-        size_t bCnt = (databitlen >> 3) + 1;                  /* number of bytes to handle (nonzero here!) */
-        u08b_t b,mask;
-
-        mask = (u08b_t) (1u << (7 - (databitlen & 7)));       /* partial byte bit mask */
-        b    = (u08b_t) ((data[bCnt-1] & (0-mask)) | mask);   /* apply bit padding on final byte */
-
-        switch ((state->statebits >> 8) & 3)
-            {
-            case 2:  Skein_512_Update(&state->u.ctx_512,data,bCnt-1); /* process all but the final byte    */
-                     Skein_512_Update(&state->u.ctx_512,&b  ,  1   ); /* process the (masked) partial byte */
-                     break;
-            case 1:  Skein_256_Update(&state->u.ctx_256,data,bCnt-1); /* process all but the final byte    */
-                     Skein_256_Update(&state->u.ctx_256,&b  ,  1   ); /* process the (masked) partial byte */
-                     break;
-            case 0:  Skein1024_Update(&state->u.ctx1024,data,bCnt-1); /* process all but the final byte    */
-                     Skein1024_Update(&state->u.ctx1024,&b  ,  1   ); /* process the (masked) partial byte */
-                     break;
-            default: return FAIL;
-            }
-        Skein_Set_Bit_Pad_Flag(state->u.h);                    /* set tweak flag for the final call */
-        
-        return SUCCESS;
-        }
-    }
-
-/*++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++*/
-/* finalize hash computation and output the result (hashbitlen bits) */
-HashReturn Final(hashState *state, BitSequence *hashval)
-    {
-    Skein_Assert(state->statebits % 256 == 0 && (state->statebits-256) < 1024,FAIL);
-    switch ((state->statebits >> 8) & 3)
-        {
-        case 2:  return Skein_512_Final(&state->u.ctx_512,hashval);
-        case 1:  return Skein_256_Final(&state->u.ctx_256,hashval);
-        case 0:  return Skein1024_Final(&state->u.ctx1024,hashval);
-        default: return FAIL;
-        }
-    }
-
-/*++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++*/
-/* all-in-one hash function */
-HashReturn Hash(int hashbitlen, const BitSequence *data, /* all-in-one call */
-                DataLength databitlen,BitSequence *hashval)
-    {
-    hashState  state;
-    HashReturn r = Init(&state,hashbitlen);
-    if (r == SUCCESS)
-        { /* these calls do not fail when called properly */
-        r = Update(&state,data,databitlen);
-        Final(&state,hashval);
-#ifdef SKEIN_DEBUG
-        if (r == SUCCESS && getenv("SKEIN_DEEP_DUMP"))
-            {
-            int i;
-            printf("==== Hashbitlen = %d, DataBitLen = %llu, Data:\n%s\n==== Hash:\n",
-                hashbitlen, (long long unsigned)databitlen, (const char*)data);
-            for (i = 0; i < hashbitlen / 8; i++)
-                printf("%02X", hashval[i]);
-            printf("\n");
-            }
-#endif
-        }
-    return r;
-    }