sha1.c 5.33 KB
Newer Older
Niels Möller's avatar
Niels Möller committed
1
/* sha1.c
Niels Möller's avatar
Niels Möller committed
2 3
 *
 * The sha1 hash function.
4
 * Defined by http://www.itl.nist.gov/fipspubs/fip180-1.htm.
Niels Möller's avatar
Niels Möller committed
5 6 7 8 9 10 11 12 13 14 15
 */

/* nettle, low-level cryptographics library
 *
 * Copyright (C) 2001 Peter Gutmann, Andrew Kuchling, Niels Mller
 *  
 * The nettle library is free software; you can redistribute it and/or modify
 * it under the terms of the GNU Lesser General Public License as published by
 * the Free Software Foundation; either version 2.1 of the License, or (at your
 * option) any later version.
 * 
Niels Möller's avatar
Niels Möller committed
16
 * The nettle library is distributed in the hope that it will be useful, but
Niels Möller's avatar
Niels Möller committed
17 18 19 20 21
 * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
 * or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU Lesser General Public
 * License for more details.
 * 
 * You should have received a copy of the GNU Lesser General Public License
Niels Möller's avatar
Niels Möller committed
22
 * along with the nettle library; see the file COPYING.LIB.  If not, write to
Niels Möller's avatar
Niels Möller committed
23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38
 * the Free Software Foundation, Inc., 59 Temple Place - Suite 330, Boston,
 * MA 02111-1307, USA.
 */

/* Here's the first paragraph of Peter Gutmann's posting,
 * <30ajo5$oe8@ccu2.auckland.ac.nz>: 
 *
 * The following is my SHA (FIPS 180) code updated to allow use of the "fixed"
 * SHA, thanks to Jim Gillogly and an anonymous contributor for the information on
 * what's changed in the new version.  The fix is a simple change which involves
 * adding a single rotate in the initial expansion function.  It is unknown
 * whether this is an optimal solution to the problem which was discovered in the
 * SHA or whether it's simply a bandaid which fixes the problem with a minimum of
 * effort (for example the reengineering of a great many Capstone chips).
 */

39 40 41
#if HAVE_CONFIG_H
# include "config.h"
#endif
Niels Möller's avatar
Niels Möller committed
42 43

#include <assert.h>
Niels Möller's avatar
Niels Möller committed
44
#include <stdlib.h>
Niels Möller's avatar
Niels Möller committed
45 46
#include <string.h>

47 48 49 50
#include "sha.h"

#include "macros.h"

Niels Möller's avatar
Niels Möller committed
51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80
/* A block, treated as a sequence of 32-bit words. */
#define SHA1_DATA_LENGTH 16

/* SHA initial values */

#define h0init  0x67452301L
#define h1init  0xEFCDAB89L
#define h2init  0x98BADCFEL
#define h3init  0x10325476L
#define h4init  0xC3D2E1F0L

/* Initialize the SHA values */

void
sha1_init(struct sha1_ctx *ctx)
{
  /* Set the h-vars to their initial values */
  ctx->digest[ 0 ] = h0init;
  ctx->digest[ 1 ] = h1init;
  ctx->digest[ 2 ] = h2init;
  ctx->digest[ 3 ] = h3init;
  ctx->digest[ 4 ] = h4init;

  /* Initialize bit count */
  ctx->count_low = ctx->count_high = 0;
  
  /* Initialize buffer */
  ctx->index = 0;
}

81
#define SHA1_INCR(ctx) ((ctx)->count_high += !++(ctx)->count_low)
Niels Möller's avatar
Niels Möller committed
82 83 84

void
sha1_update(struct sha1_ctx *ctx,
85
	    unsigned length, const uint8_t *buffer)
Niels Möller's avatar
Niels Möller committed
86 87 88 89 90 91 92 93 94 95 96 97 98
{
  if (ctx->index)
    { /* Try to fill partial block */
      unsigned left = SHA1_DATA_SIZE - ctx->index;
      if (length < left)
	{
	  memcpy(ctx->block + ctx->index, buffer, length);
	  ctx->index += length;
	  return; /* Finished */
	}
      else
	{
	  memcpy(ctx->block + ctx->index, buffer, left);
99 100 101 102

	  _nettle_sha1_compress(ctx->digest, ctx->block);
	  SHA1_INCR(ctx);

Niels Möller's avatar
Niels Möller committed
103 104 105 106 107 108
	  buffer += left;
	  length -= left;
	}
    }
  while (length >= SHA1_DATA_SIZE)
    {
109 110 111
      _nettle_sha1_compress(ctx->digest, buffer);
      SHA1_INCR(ctx);

Niels Möller's avatar
Niels Möller committed
112 113 114 115 116 117 118 119 120 121 122
      buffer += SHA1_DATA_SIZE;
      length -= SHA1_DATA_SIZE;
    }
  if ((ctx->index = length))     /* This assignment is intended */
    /* Buffer leftovers */
    memcpy(ctx->block, buffer, length);
}
	  
/* Final wrapup - pad to SHA1_DATA_SIZE-byte boundary with the bit pattern
   1 0* (64-bit count of bits processed, MSB-first) */

123
static void
Niels Möller's avatar
Niels Möller committed
124 125
sha1_final(struct sha1_ctx *ctx)
{
126 127 128 129
  uint32_t bitcount_high;
  uint32_t bitcount_low;
  unsigned i;
  
Niels Möller's avatar
Niels Möller committed
130 131 132 133 134 135 136 137
  i = ctx->index;
  
  /* Set the first char of padding to 0x80.  This is safe since there is
     always at least one byte free */

  assert(i < SHA1_DATA_SIZE);
  ctx->block[i++] = 0x80;

138
  if (i > (SHA1_DATA_SIZE - 8))
Niels Möller's avatar
Niels Möller committed
139
    { /* No room for length in this block. Process it and
140 141 142
	 pad with another one */
      memset(ctx->block + i, 0, SHA1_DATA_SIZE - i);
      
143
      _nettle_sha1_compress(ctx->digest, ctx->block);
144
      i = 0;
Niels Möller's avatar
Niels Möller committed
145
    }
146 147 148
  if (i < (SHA1_DATA_SIZE - 8))
    memset(ctx->block + i, 0, (SHA1_DATA_SIZE - 8) - i);

149 150 151 152
  /* There are 512 = 2^9 bits in one block */  
  bitcount_high = (ctx->count_high << 9) | (ctx->count_low >> 23);
  bitcount_low = (ctx->count_low << 9) | (ctx->index << 3);

153 154 155 156 157 158
  /* This is slightly inefficient, as the numbers are converted to
     big-endian format, and will be converted back by the compression
     function. It's probably not worth the effort to fix this. */
  WRITE_UINT32(ctx->block + (SHA1_DATA_SIZE - 8), bitcount_high);
  WRITE_UINT32(ctx->block + (SHA1_DATA_SIZE - 4), bitcount_low);

159
  _nettle_sha1_compress(ctx->digest, ctx->block);
Niels Möller's avatar
Niels Möller committed
160 161 162
}

void
163
sha1_digest(struct sha1_ctx *ctx,
Niels Möller's avatar
Niels Möller committed
164 165 166 167 168 169 170 171 172
	    unsigned length,
	    uint8_t *digest)
{
  unsigned i;
  unsigned words;
  unsigned leftover;
  
  assert(length <= SHA1_DIGEST_SIZE);

173 174
  sha1_final(ctx);
  
Niels Möller's avatar
Niels Möller committed
175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203
  words = length / 4;
  leftover = length % 4;

  for (i = 0; i < words; i++, digest += 4)
    WRITE_UINT32(digest, ctx->digest[i]);

  if (leftover)
    {
      uint32_t word;
      unsigned j = leftover;
      
      assert(i < _SHA1_DIGEST_LENGTH);
      
      word = ctx->digest[i];
      
      switch (leftover)
	{
	default:
	  abort();
	case 3:
	  digest[--j] = (word >> 8) & 0xff;
	  /* Fall through */
	case 2:
	  digest[--j] = (word >> 16) & 0xff;
	  /* Fall through */
	case 1:
	  digest[--j] = (word >> 24) & 0xff;
	}
    }
204
  sha1_init(ctx);
Niels Möller's avatar
Niels Möller committed
205
}