Browse Source

Import Aaron D. Gifford's fast sha256 implementation.

nfactor-troky
Con Kolivas 11 years ago
parent
commit
78d78b1063
  1. 16
      cgminer.c
  2. 4
      driver-ztex.c
  3. 1147
      sha2.c
  4. 150
      sha2.h

16
cgminer.c

@ -1522,12 +1522,12 @@ static void calc_midstate(struct work *work) @@ -1522,12 +1522,12 @@ static void calc_midstate(struct work *work)
{
unsigned char data[64];
uint32_t *data32 = (uint32_t *)data;
sha2_context ctx;
sha256_ctx ctx;
flip64(data32, work->data);
sha2_starts(&ctx);
sha2_update(&ctx, data, 64);
memcpy(work->midstate, ctx.state, 32);
sha256_init(&ctx);
sha256_update(&ctx, data, 64);
memcpy(work->midstate, ctx.h, 32);
endian_flip32(work->midstate, work->midstate);
}
@ -3366,8 +3366,8 @@ static void regen_hash(struct work *work) @@ -3366,8 +3366,8 @@ static void regen_hash(struct work *work)
unsigned char hash1[32];
flip80(swap32, data32);
sha2(swap, 80, hash1);
sha2(hash1, 32, (unsigned char *)(work->hash));
sha256(swap, 80, hash1);
sha256(hash1, 32, (unsigned char *)(work->hash));
}
static void rebuild_hash(struct work *work)
@ -5543,8 +5543,8 @@ static void gen_hash(unsigned char *data, unsigned char *hash, int len) @@ -5543,8 +5543,8 @@ static void gen_hash(unsigned char *data, unsigned char *hash, int len)
{
unsigned char hash1[32];
sha2(data, len, hash1);
sha2(hash1, 32, hash);
sha256(data, len, hash1);
sha256(hash1, 32, hash);
}
/* Diff 1 is a 256 bit unsigned integer of

4
driver-ztex.c

@ -162,8 +162,8 @@ static uint32_t ztex_checkNonce(struct work *work, uint32_t nonce) @@ -162,8 +162,8 @@ static uint32_t ztex_checkNonce(struct work *work, uint32_t nonce)
for (i = 0; i < 76 / 4; i++)
swap32[i] = swab32(data32[i]);
sha2(swap, 80, hash1);
sha2(hash1, 32, hash2);
sha256(swap, 80, hash1);
sha256(hash1, 32, hash2);
return htonl(hash2_32[7]);
}

1147
sha2.c

File diff suppressed because it is too large Load Diff

150
sha2.h

@ -1,87 +1,105 @@ @@ -1,87 +1,105 @@
/**
* \file sha2.h
*
* Copyright (C) 2011, Con Kolivas <kernel@kolivas.org>
* Copyright (C) 2006-2010, Brainspark B.V.
*
* This file is part of PolarSSL (http://www.polarssl.org)
* Lead Maintainer: Paul Bakker <polarssl_maintainer at polarssl.org>
/*
* FIPS 180-2 SHA-224/256/384/512 implementation
* Last update: 02/02/2007
* Issue date: 04/30/2005
*
* Copyright (C) 2013, Con Kolivas <kernel@kolivas.org>
* Copyright (C) 2005, 2007 Olivier Gay <olivier.gay@a3.epfl.ch>
* All rights reserved.
*
* 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.
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. 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.
* 3. Neither the name of the project nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* 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.,
* 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
* THIS SOFTWARE IS PROVIDED BY THE PROJECT 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 PROJECT 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.
*/
#ifndef POLARSSL_SHA2_H
#define POLARSSL_SHA2_H
#include <stdint.h>
#include "config.h"
#include "miner.h"
/**
* \brief SHA-256 context structure
*/
typedef struct
{
uint32_t total[2]; /*!< number of bytes processed */
uint32_t state[8]; /*!< intermediate digest state */
unsigned char buffer[64]; /*!< data block being processed */
#ifndef SHA2_H
#define SHA2_H
unsigned char ipad[64]; /*!< HMAC: inner padding */
unsigned char opad[64]; /*!< HMAC: outer padding */
}
sha2_context;
#define SHA224_DIGEST_SIZE ( 224 / 8)
#define SHA256_DIGEST_SIZE ( 256 / 8)
#define SHA384_DIGEST_SIZE ( 384 / 8)
#define SHA512_DIGEST_SIZE ( 512 / 8)
#define SHA256_BLOCK_SIZE ( 512 / 8)
#define SHA512_BLOCK_SIZE (1024 / 8)
#define SHA384_BLOCK_SIZE SHA512_BLOCK_SIZE
#define SHA224_BLOCK_SIZE SHA256_BLOCK_SIZE
#ifdef __cplusplus
extern "C" {
#endif
/**
* \brief SHA-256 context setup
*
* \param ctx context to be initialized
*/
void sha2_starts( sha2_context *ctx);
typedef struct {
unsigned int tot_len;
unsigned int len;
unsigned char block[2 * SHA256_BLOCK_SIZE];
uint32_t h[8];
} sha256_ctx;
/**
* \brief SHA-256 process buffer
*
* \param ctx SHA-256 context
* \param input buffer holding the data
* \param ilen length of the input data
*/
void sha2_update( sha2_context *ctx, const unsigned char *input, int ilen );
typedef struct {
unsigned int tot_len;
unsigned int len;
unsigned char block[2 * SHA512_BLOCK_SIZE];
uint64_t h[8];
} sha512_ctx;
/**
* \brief SHA-256 final digest
*
* \param ctx SHA-256 context
* \param output SHA-256 checksum result
*/
void sha2_finish( sha2_context *ctx, unsigned char output[32] );
typedef sha512_ctx sha384_ctx;
typedef sha256_ctx sha224_ctx;
/**
* \brief Output = SHA-256( input buffer )
*
* \param input buffer holding the data
* \param ilen length of the input data
* \param output SHA-256 checksum result
*/
void sha2( const unsigned char *input, int ilen,
unsigned char output[32]);
void sha224_init(sha224_ctx *ctx);
void sha224_update(sha224_ctx *ctx, const unsigned char *message,
unsigned int len);
void sha224_final(sha224_ctx *ctx, unsigned char *digest);
void sha224(const unsigned char *message, unsigned int len,
unsigned char *digest);
void sha256_init(sha256_ctx * ctx);
void sha256_update(sha256_ctx *ctx, const unsigned char *message,
unsigned int len);
void sha256_final(sha256_ctx *ctx, unsigned char *digest);
void sha256(const unsigned char *message, unsigned int len,
unsigned char *digest);
void sha384_init(sha384_ctx *ctx);
void sha384_update(sha384_ctx *ctx, const unsigned char *message,
unsigned int len);
void sha384_final(sha384_ctx *ctx, unsigned char *digest);
void sha384(const unsigned char *message, unsigned int len,
unsigned char *digest);
void sha512_init(sha512_ctx *ctx);
void sha512_update(sha512_ctx *ctx, const unsigned char *message,
unsigned int len);
void sha512_final(sha512_ctx *ctx, unsigned char *digest);
void sha512(const unsigned char *message, unsigned int len,
unsigned char *digest);
#ifdef __cplusplus
}
#endif
#endif /* sha2.h */
#endif /* !SHA2_H */

Loading…
Cancel
Save