mirror of https://github.com/GOSTSec/sgminer
bitbandi
8 years ago
committed by
GitHub
12 changed files with 5584 additions and 2 deletions
@ -0,0 +1,215 @@
@@ -0,0 +1,215 @@
|
||||
/*-
|
||||
* Copyright 2009 Colin Percival, 2011 ArtForz |
||||
* All rights reserved. |
||||
* |
||||
* 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. |
||||
* |
||||
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR 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 AUTHOR 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. |
||||
* |
||||
* This file was originally written by Colin Percival as part of the Tarsnap |
||||
* online backup system. |
||||
*/ |
||||
|
||||
#include "config.h" |
||||
#include "miner.h" |
||||
|
||||
#include <stdlib.h> |
||||
#include <stdint.h> |
||||
#include <string.h> |
||||
|
||||
|
||||
#include "sph/sph_blake.h" |
||||
#include "sph/sph_bmw.h" |
||||
#include "sph/sph_groestl.h" |
||||
#include "sph/sph_jh.h" |
||||
#include "sph/sph_keccak.h" |
||||
#include "sph/sph_skein.h" |
||||
#include "sph/sph_luffa.h" |
||||
#include "sph/sph_cubehash.h" |
||||
#include "sph/sph_shavite.h" |
||||
#include "sph/sph_simd.h" |
||||
#include "sph/sph_echo.h" |
||||
#include "sph/sph_gost.h" |
||||
|
||||
/* Move init out of loop, so init once externally, and then use one single memcpy with that bigger memory block */ |
||||
typedef struct { |
||||
sph_blake512_context blake1; |
||||
sph_bmw512_context bmw1; |
||||
sph_groestl512_context groestl1; |
||||
sph_skein512_context skein1; |
||||
sph_jh512_context jh1; |
||||
sph_keccak512_context keccak1; |
||||
sph_gost512_context gost1; |
||||
sph_luffa512_context luffa1; |
||||
sph_cubehash512_context cubehash1; |
||||
sph_shavite512_context shavite1; |
||||
sph_simd512_context simd1; |
||||
sph_echo512_context echo1; |
||||
} Xhash_context_holder; |
||||
|
||||
static Xhash_context_holder base_contexts; |
||||
|
||||
|
||||
static void init_Xhash_contexts() |
||||
{ |
||||
sph_blake512_init(&base_contexts.blake1); |
||||
sph_bmw512_init(&base_contexts.bmw1); |
||||
sph_groestl512_init(&base_contexts.groestl1); |
||||
sph_skein512_init(&base_contexts.skein1); |
||||
sph_jh512_init(&base_contexts.jh1); |
||||
sph_keccak512_init(&base_contexts.keccak1); |
||||
sph_gost512_init(&base_contexts.gost1); |
||||
sph_luffa512_init(&base_contexts.luffa1); |
||||
sph_cubehash512_init(&base_contexts.cubehash1); |
||||
sph_shavite512_init(&base_contexts.shavite1); |
||||
sph_simd512_init(&base_contexts.simd1); |
||||
sph_echo512_init(&base_contexts.echo1); |
||||
} |
||||
|
||||
|
||||
static inline void xhash(void *state, const void *input) |
||||
{ |
||||
init_Xhash_contexts(); |
||||
|
||||
Xhash_context_holder ctx; |
||||
|
||||
uint32_t hashA[16], hashB[16]; |
||||
//blake-bmw-groestl-sken-jh-meccak-luffa-cubehash-shivite-simd-echo
|
||||
memcpy(&ctx, &base_contexts, sizeof(base_contexts)); |
||||
|
||||
sph_blake512 (&ctx.blake1, input, 80); |
||||
sph_blake512_close (&ctx.blake1, hashA); |
||||
|
||||
sph_bmw512 (&ctx.bmw1, hashA, 64); |
||||
sph_bmw512_close(&ctx.bmw1, hashB); |
||||
|
||||
sph_groestl512 (&ctx.groestl1, hashB, 64); |
||||
sph_groestl512_close(&ctx.groestl1, hashA); |
||||
|
||||
sph_skein512 (&ctx.skein1, hashA, 64); |
||||
sph_skein512_close(&ctx.skein1, hashB); |
||||
|
||||
sph_jh512 (&ctx.jh1, hashB, 64); |
||||
sph_jh512_close(&ctx.jh1, hashA); |
||||
|
||||
sph_keccak512 (&ctx.keccak1, hashA, 64); |
||||
sph_keccak512_close(&ctx.keccak1, hashB); |
||||
|
||||
sph_gost512 (&ctx.gost1, hashB, 64); |
||||
sph_gost512_close(&ctx.gost1, hashA); |
||||
|
||||
sph_luffa512 (&ctx.luffa1, hashA, 64); |
||||
sph_luffa512_close (&ctx.luffa1, hashB); |
||||
|
||||
sph_cubehash512 (&ctx.cubehash1, hashB, 64); |
||||
sph_cubehash512_close(&ctx.cubehash1, hashA); |
||||
|
||||
sph_shavite512 (&ctx.shavite1, hashA, 64); |
||||
sph_shavite512_close(&ctx.shavite1, hashB); |
||||
|
||||
sph_simd512 (&ctx.simd1, hashB, 64); |
||||
sph_simd512_close(&ctx.simd1, hashA); |
||||
|
||||
sph_echo512 (&ctx.echo1, hashA, 64); |
||||
sph_echo512_close(&ctx.echo1, hashB); |
||||
|
||||
memcpy(state, hashB, 32); |
||||
|
||||
} |
||||
|
||||
static const uint32_t diff1targ = 0x0000ffff; |
||||
|
||||
|
||||
/* Used externally as confirmation of correct OCL code */ |
||||
int sibcoin_test(unsigned char *pdata, const unsigned char *ptarget, uint32_t nonce) |
||||
{ |
||||
uint32_t tmp_hash7, Htarg = le32toh(((const uint32_t *)ptarget)[7]); |
||||
uint32_t data[20], ohash[8]; |
||||
|
||||
be32enc_vect(data, (const uint32_t *)pdata, 19); |
||||
data[19] = htobe32(nonce); |
||||
xhash(ohash, data); |
||||
tmp_hash7 = be32toh(ohash[7]); |
||||
|
||||
applog(LOG_DEBUG, "htarget %08lx diff1 %08lx hash %08lx", |
||||
(long unsigned int)Htarg, |
||||
(long unsigned int)diff1targ, |
||||
(long unsigned int)tmp_hash7); |
||||
if (tmp_hash7 > diff1targ) |
||||
return -1; |
||||
if (tmp_hash7 > Htarg) |
||||
return 0; |
||||
return 1; |
||||
} |
||||
|
||||
void sibcoin_regenhash(struct work *work) |
||||
{ |
||||
uint32_t data[20]; |
||||
uint32_t *nonce = (uint32_t *)(work->data + 76); |
||||
uint32_t *ohash = (uint32_t *)(work->hash); |
||||
|
||||
be32enc_vect(data, (const uint32_t *)work->data, 19); |
||||
data[19] = htobe32(*nonce); |
||||
xhash(ohash, data); |
||||
} |
||||
|
||||
bool scanhash_sibcoin(struct thr_info *thr, const unsigned char __maybe_unused *pmidstate, |
||||
unsigned char *pdata, unsigned char __maybe_unused *phash1, |
||||
unsigned char __maybe_unused *phash, const unsigned char *ptarget, |
||||
uint32_t max_nonce, uint32_t *last_nonce, uint32_t n) |
||||
{ |
||||
uint32_t *nonce = (uint32_t *)(pdata + 76); |
||||
uint32_t data[20]; |
||||
uint32_t tmp_hash7; |
||||
uint32_t Htarg = le32toh(((const uint32_t *)ptarget)[7]); |
||||
bool ret = false; |
||||
|
||||
be32enc_vect(data, (const uint32_t *)pdata, 19); |
||||
|
||||
while(1) { |
||||
uint32_t ostate[8]; |
||||
|
||||
*nonce = ++n; |
||||
data[19] = (n); |
||||
xhash(ostate, data); |
||||
tmp_hash7 = (ostate[7]); |
||||
|
||||
applog(LOG_INFO, "data7 %08lx", |
||||
(long unsigned int)data[7]); |
||||
|
||||
if (unlikely(tmp_hash7 <= Htarg)) { |
||||
((uint32_t *)pdata)[19] = htobe32(n); |
||||
*last_nonce = n; |
||||
ret = true; |
||||
break; |
||||
} |
||||
|
||||
if (unlikely((n >= max_nonce) || thr->work_restart)) { |
||||
*last_nonce = n; |
||||
break; |
||||
} |
||||
} |
||||
|
||||
return ret; |
||||
} |
||||
|
||||
|
||||
|
||||
|
||||
@ -0,0 +1,10 @@
@@ -0,0 +1,10 @@
|
||||
#ifndef SIBCOIN_H |
||||
#define SIBCOIN_H |
||||
|
||||
#include "miner.h" |
||||
|
||||
extern int sibcoin_test(unsigned char *pdata, const unsigned char *ptarget, |
||||
uint32_t nonce); |
||||
extern void sibcoin_regenhash(struct work *work); |
||||
|
||||
#endif /* SIBCOIN_H */ |
||||
@ -0,0 +1,759 @@
@@ -0,0 +1,759 @@
|
||||
/* |
||||
* GOST К 34.11-2012 kernel implementation. |
||||
* |
||||
* ==========================(LICENSE BEGIN)============================ |
||||
* |
||||
* Copyright (c) 2015 ivansib |
||||
* |
||||
* Permission is hereby granted, free of charge, to any person obtaining |
||||
* a copy of this software and associated documentation files (the |
||||
* "Software"), to deal in the Software without restriction, including |
||||
* without limitation the rights to use, copy, modify, merge, publish, |
||||
* distribute, sublicense, and/or sell copies of the Software, and to |
||||
* permit persons to whom the Software is furnished to do so, subject to |
||||
* the following conditions: |
||||
* |
||||
* The above copyright notice and this permission notice shall be |
||||
* included in all copies or substantial portions of the Software. |
||||
* |
||||
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, |
||||
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF |
||||
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. |
||||
* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY |
||||
* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, |
||||
* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE |
||||
* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. |
||||
* |
||||
* ===========================(LICENSE END)============================= |
||||
* |
||||
* @author Ivan <ivansib@users.noreply.github.com> |
||||
*/ |
||||
|
||||
#ifndef SIBCOIN_CL |
||||
#define SIBCOIN_CL |
||||
|
||||
#if __ENDIAN_LITTLE__ |
||||
#define SPH_LITTLE_ENDIAN 1 |
||||
#else |
||||
#define SPH_BIG_ENDIAN 1 |
||||
#endif |
||||
|
||||
#define SPH_UPTR sph_u64 |
||||
|
||||
typedef unsigned int sph_u32; |
||||
typedef int sph_s32; |
||||
#ifndef __OPENCL_VERSION__ |
||||
typedef unsigned long long sph_u64; |
||||
typedef long long sph_s64; |
||||
#else |
||||
typedef unsigned long sph_u64; |
||||
typedef long sph_s64; |
||||
#endif |
||||
|
||||
#define SPH_64 1 |
||||
#define SPH_64_TRUE 1 |
||||
|
||||
#define SPH_C32(x) ((sph_u32)(x ## U)) |
||||
#define SPH_T32(x) ((x) & SPH_C32(0xFFFFFFFF)) |
||||
#define SPH_ROTL32(x, n) SPH_T32(((x) << (n)) | ((x) >> (32 - (n)))) |
||||
#define SPH_ROTR32(x, n) SPH_ROTL32(x, (32 - (n))) |
||||
|
||||
#define SPH_C64(x) ((sph_u64)(x ## UL)) |
||||
#define SPH_T64(x) ((x) & SPH_C64(0xFFFFFFFFFFFFFFFF)) |
||||
#define SPH_ROTL64(x, n) SPH_T64(((x) << (n)) | ((x) >> (64 - (n)))) |
||||
#define SPH_ROTR64(x, n) SPH_ROTL64(x, (64 - (n))) |
||||
|
||||
#define SPH_ECHO_64 1 |
||||
#define SPH_KECCAK_64 1 |
||||
#define SPH_JH_64 1 |
||||
#define SPH_SIMD_NOCOPY 0 |
||||
#define SPH_KECCAK_NOCOPY 0 |
||||
#define SPH_SMALL_FOOTPRINT_GROESTL 0 |
||||
#define SPH_GROESTL_BIG_ENDIAN 0 |
||||
#define SPH_CUBEHASH_UNROLL 0 |
||||
#define SPH_COMPACT_BLAKE_64 0 |
||||
#define SPH_LUFFA_PARALLEL 0 |
||||
#define SPH_KECCAK_UNROLL 0 |
||||
|
||||
#include "blake.cl" |
||||
#include "bmw.cl" |
||||
#include "groestl.cl" |
||||
#include "jh.cl" |
||||
#include "keccak.cl" |
||||
#include "skein.cl" |
||||
#include "luffa.cl" |
||||
#include "cubehash.cl" |
||||
#include "shavite.cl" |
||||
#include "simd.cl" |
||||
#include "echo.cl" |
||||
#include "gost.cl" |
||||
|
||||
#define SWAP4(x) as_uint(as_uchar4(x).wzyx) |
||||
#define SWAP8(x) as_ulong(as_uchar8(x).s76543210) |
||||
|
||||
#if SPH_BIG_ENDIAN |
||||
#define DEC64E(x) (x) |
||||
#define DEC64BE(x) (*(const __global sph_u64 *) (x)); |
||||
#else |
||||
#define DEC64E(x) SWAP8(x) |
||||
#define DEC64BE(x) SWAP8(*(const __global sph_u64 *) (x)); |
||||
#endif |
||||
|
||||
__attribute__((reqd_work_group_size(WORKSIZE, 1, 1))) |
||||
__kernel void search(__global unsigned char* block, volatile __global uint* output, const ulong target) |
||||
{ |
||||
uint gid = get_global_id(0); |
||||
union { |
||||
unsigned char h1[64]; |
||||
uint h4[16]; |
||||
ulong h8[8]; |
||||
} hash; |
||||
|
||||
__local sph_u32 AES0[256], AES1[256], AES2[256], AES3[256]; |
||||
int init = get_local_id(0); |
||||
int step = get_local_size(0); |
||||
for (int i = init; i < 256; i += step) |
||||
{ |
||||
AES0[i] = AES0_C[i]; |
||||
AES1[i] = AES1_C[i]; |
||||
AES2[i] = AES2_C[i]; |
||||
AES3[i] = AES3_C[i]; |
||||
} |
||||
barrier(CLK_LOCAL_MEM_FENCE); |
||||
|
||||
// blake |
||||
{ |
||||
sph_u64 H0 = SPH_C64(0x6A09E667F3BCC908), H1 = SPH_C64(0xBB67AE8584CAA73B); |
||||
sph_u64 H2 = SPH_C64(0x3C6EF372FE94F82B), H3 = SPH_C64(0xA54FF53A5F1D36F1); |
||||
sph_u64 H4 = SPH_C64(0x510E527FADE682D1), H5 = SPH_C64(0x9B05688C2B3E6C1F); |
||||
sph_u64 H6 = SPH_C64(0x1F83D9ABFB41BD6B), H7 = SPH_C64(0x5BE0CD19137E2179); |
||||
sph_u64 S0 = 0, S1 = 0, S2 = 0, S3 = 0; |
||||
sph_u64 T0 = SPH_C64(0xFFFFFFFFFFFFFC00) + (80 << 3), T1 = 0xFFFFFFFFFFFFFFFF;; |
||||
|
||||
if ((T0 = SPH_T64(T0 + 1024)) < 1024) |
||||
{ |
||||
T1 = SPH_T64(T1 + 1); |
||||
} |
||||
sph_u64 M0, M1, M2, M3, M4, M5, M6, M7; |
||||
sph_u64 M8, M9, MA, MB, MC, MD, ME, MF; |
||||
sph_u64 V0, V1, V2, V3, V4, V5, V6, V7; |
||||
sph_u64 V8, V9, VA, VB, VC, VD, VE, VF; |
||||
M0 = DEC64BE(block + 0); |
||||
M1 = DEC64BE(block + 8); |
||||
M2 = DEC64BE(block + 16); |
||||
M3 = DEC64BE(block + 24); |
||||
M4 = DEC64BE(block + 32); |
||||
M5 = DEC64BE(block + 40); |
||||
M6 = DEC64BE(block + 48); |
||||
M7 = DEC64BE(block + 56); |
||||
M8 = DEC64BE(block + 64); |
||||
M9 = DEC64BE(block + 72); |
||||
M9 &= 0xFFFFFFFF00000000; |
||||
M9 ^= SWAP4(gid); |
||||
MA = 0x8000000000000000; |
||||
MB = 0; |
||||
MC = 0; |
||||
MD = 1; |
||||
ME = 0; |
||||
MF = 0x280; |
||||
|
||||
COMPRESS64; |
||||
|
||||
hash.h8[0] = H0; |
||||
hash.h8[1] = H1; |
||||
hash.h8[2] = H2; |
||||
hash.h8[3] = H3; |
||||
hash.h8[4] = H4; |
||||
hash.h8[5] = H5; |
||||
hash.h8[6] = H6; |
||||
hash.h8[7] = H7; |
||||
} |
||||
// bmw |
||||
{ |
||||
sph_u64 BMW_H[16]; |
||||
for(unsigned u = 0; u < 16; u++) |
||||
BMW_H[u] = BMW_IV512[u]; |
||||
|
||||
sph_u64 BMW_h1[16], BMW_h2[16]; |
||||
sph_u64 mv[16]; |
||||
|
||||
mv[ 0] = SWAP8(hash.h8[0]); |
||||
mv[ 1] = SWAP8(hash.h8[1]); |
||||
mv[ 2] = SWAP8(hash.h8[2]); |
||||
mv[ 3] = SWAP8(hash.h8[3]); |
||||
mv[ 4] = SWAP8(hash.h8[4]); |
||||
mv[ 5] = SWAP8(hash.h8[5]); |
||||
mv[ 6] = SWAP8(hash.h8[6]); |
||||
mv[ 7] = SWAP8(hash.h8[7]); |
||||
mv[ 8] = 0x80; |
||||
mv[ 9] = 0; |
||||
mv[10] = 0; |
||||
mv[11] = 0; |
||||
mv[12] = 0; |
||||
mv[13] = 0; |
||||
mv[14] = 0; |
||||
mv[15] = 0x200; |
||||
#define M(x) (mv[x]) |
||||
#define H(x) (BMW_H[x]) |
||||
#define dH(x) (BMW_h2[x]) |
||||
|
||||
FOLDb; |
||||
|
||||
#undef M |
||||
#undef H |
||||
#undef dH |
||||
|
||||
#define M(x) (BMW_h2[x]) |
||||
#define H(x) (final_b[x]) |
||||
#define dH(x) (BMW_h1[x]) |
||||
|
||||
FOLDb; |
||||
|
||||
#undef M |
||||
#undef H |
||||
#undef dH |
||||
|
||||
hash.h8[0] = SWAP8(BMW_h1[8]); |
||||
hash.h8[1] = SWAP8(BMW_h1[9]); |
||||
hash.h8[2] = SWAP8(BMW_h1[10]); |
||||
hash.h8[3] = SWAP8(BMW_h1[11]); |
||||
hash.h8[4] = SWAP8(BMW_h1[12]); |
||||
hash.h8[5] = SWAP8(BMW_h1[13]); |
||||
hash.h8[6] = SWAP8(BMW_h1[14]); |
||||
hash.h8[7] = SWAP8(BMW_h1[15]); |
||||
} |
||||
|
||||
// groestl |
||||
{ |
||||
sph_u64 H[16]; |
||||
for (unsigned int u = 0; u < 15; u ++) |
||||
H[u] = 0; |
||||
#if USE_LE |
||||
H[15] = ((sph_u64)(512 & 0xFF) << 56) | ((sph_u64)(512 & 0xFF00) << 40); |
||||
#else |
||||
H[15] = (sph_u64)512; |
||||
#endif |
||||
|
||||
sph_u64 g[16], m[16]; |
||||
m[0] = DEC64E(hash.h8[0]); |
||||
m[1] = DEC64E(hash.h8[1]); |
||||
m[2] = DEC64E(hash.h8[2]); |
||||
m[3] = DEC64E(hash.h8[3]); |
||||
m[4] = DEC64E(hash.h8[4]); |
||||
m[5] = DEC64E(hash.h8[5]); |
||||
m[6] = DEC64E(hash.h8[6]); |
||||
m[7] = DEC64E(hash.h8[7]); |
||||
for (unsigned int u = 0; u < 16; u ++) |
||||
g[u] = m[u] ^ H[u]; |
||||
m[8] = 0x80; g[8] = m[8] ^ H[8]; |
||||
m[9] = 0; g[9] = m[9] ^ H[9]; |
||||
m[10] = 0; g[10] = m[10] ^ H[10]; |
||||
m[11] = 0; g[11] = m[11] ^ H[11]; |
||||
m[12] = 0; g[12] = m[12] ^ H[12]; |
||||
m[13] = 0; g[13] = m[13] ^ H[13]; |
||||
m[14] = 0; g[14] = m[14] ^ H[14]; |
||||
m[15] = 0x100000000000000; g[15] = m[15] ^ H[15]; |
||||
PERM_BIG_P(g); |
||||
PERM_BIG_Q(m); |
||||
for (unsigned int u = 0; u < 16; u ++) |
||||
H[u] ^= g[u] ^ m[u]; |
||||
sph_u64 xH[16]; |
||||
for (unsigned int u = 0; u < 16; u ++) |
||||
xH[u] = H[u]; |
||||
PERM_BIG_P(xH); |
||||
for (unsigned int u = 0; u < 16; u ++) |
||||
H[u] ^= xH[u]; |
||||
for (unsigned int u = 0; u < 8; u ++) |
||||
hash.h8[u] = DEC64E(H[u + 8]); |
||||
} |
||||
|
||||
// skein |
||||
{ |
||||
sph_u64 h0 = SPH_C64(0x4903ADFF749C51CE), h1 = SPH_C64(0x0D95DE399746DF03), h2 = SPH_C64(0x8FD1934127C79BCE), h3 = SPH_C64(0x9A255629FF352CB1), h4 = SPH_C64(0x5DB62599DF6CA7B0), h5 = SPH_C64(0xEABE394CA9D5C3F4), h6 = SPH_C64(0x991112C71A75B523), h7 = SPH_C64(0xAE18A40B660FCC33); |
||||
sph_u64 m0, m1, m2, m3, m4, m5, m6, m7; |
||||
sph_u64 bcount = 0; |
||||
|
||||
m0 = SWAP8(hash.h8[0]); |
||||
m1 = SWAP8(hash.h8[1]); |
||||
m2 = SWAP8(hash.h8[2]); |
||||
m3 = SWAP8(hash.h8[3]); |
||||
m4 = SWAP8(hash.h8[4]); |
||||
m5 = SWAP8(hash.h8[5]); |
||||
m6 = SWAP8(hash.h8[6]); |
||||
m7 = SWAP8(hash.h8[7]); |
||||
UBI_BIG(480, 64); |
||||
bcount = 0; |
||||
m0 = m1 = m2 = m3 = m4 = m5 = m6 = m7 = 0; |
||||
UBI_BIG(510, 8); |
||||
hash.h8[0] = SWAP8(h0); |
||||
hash.h8[1] = SWAP8(h1); |
||||
hash.h8[2] = SWAP8(h2); |
||||
hash.h8[3] = SWAP8(h3); |
||||
hash.h8[4] = SWAP8(h4); |
||||
hash.h8[5] = SWAP8(h5); |
||||
hash.h8[6] = SWAP8(h6); |
||||
hash.h8[7] = SWAP8(h7); |
||||
} |
||||
|
||||
// jh |
||||
{ |
||||
sph_u64 h0h = C64e(0x6fd14b963e00aa17), h0l = C64e(0x636a2e057a15d543), h1h = C64e(0x8a225e8d0c97ef0b), h1l = C64e(0xe9341259f2b3c361), h2h = C64e(0x891da0c1536f801e), h2l = C64e(0x2aa9056bea2b6d80), h3h = C64e(0x588eccdb2075baa6), h3l = C64e(0xa90f3a76baf83bf7); |
||||
sph_u64 h4h = C64e(0x0169e60541e34a69), h4l = C64e(0x46b58a8e2e6fe65a), h5h = C64e(0x1047a7d0c1843c24), h5l = C64e(0x3b6e71b12d5ac199), h6h = C64e(0xcf57f6ec9db1f856), h6l = C64e(0xa706887c5716b156), h7h = C64e(0xe3c2fcdfe68517fb), h7l = C64e(0x545a4678cc8cdd4b); |
||||
sph_u64 tmp; |
||||
|
||||
for(int i = 0; i < 2; i++) |
||||
{ |
||||
if (i == 0) { |
||||
h0h ^= DEC64E(hash.h8[0]); |
||||
h0l ^= DEC64E(hash.h8[1]); |
||||
h1h ^= DEC64E(hash.h8[2]); |
||||
h1l ^= DEC64E(hash.h8[3]); |
||||
h2h ^= DEC64E(hash.h8[4]); |
||||
h2l ^= DEC64E(hash.h8[5]); |
||||
h3h ^= DEC64E(hash.h8[6]); |
||||
h3l ^= DEC64E(hash.h8[7]); |
||||
} else if(i == 1) { |
||||
h4h ^= DEC64E(hash.h8[0]); |
||||
h4l ^= DEC64E(hash.h8[1]); |
||||
h5h ^= DEC64E(hash.h8[2]); |
||||
h5l ^= DEC64E(hash.h8[3]); |
||||
h6h ^= DEC64E(hash.h8[4]); |
||||
h6l ^= DEC64E(hash.h8[5]); |
||||
h7h ^= DEC64E(hash.h8[6]); |
||||
h7l ^= DEC64E(hash.h8[7]); |
||||
|
||||
h0h ^= 0x80; |
||||
h3l ^= 0x2000000000000; |
||||
} |
||||
E8; |
||||
} |
||||
h4h ^= 0x80; |
||||
h7l ^= 0x2000000000000; |
||||
|
||||
hash.h8[0] = DEC64E(h4h); |
||||
hash.h8[1] = DEC64E(h4l); |
||||
hash.h8[2] = DEC64E(h5h); |
||||
hash.h8[3] = DEC64E(h5l); |
||||
hash.h8[4] = DEC64E(h6h); |
||||
hash.h8[5] = DEC64E(h6l); |
||||
hash.h8[6] = DEC64E(h7h); |
||||
hash.h8[7] = DEC64E(h7l); |
||||
} |
||||
|
||||
// keccak |
||||
{ |
||||
sph_u64 a00 = 0, a01 = 0, a02 = 0, a03 = 0, a04 = 0; |
||||
sph_u64 a10 = 0, a11 = 0, a12 = 0, a13 = 0, a14 = 0; |
||||
sph_u64 a20 = 0, a21 = 0, a22 = 0, a23 = 0, a24 = 0; |
||||
sph_u64 a30 = 0, a31 = 0, a32 = 0, a33 = 0, a34 = 0; |
||||
sph_u64 a40 = 0, a41 = 0, a42 = 0, a43 = 0, a44 = 0; |
||||
|
||||
a10 = SPH_C64(0xFFFFFFFFFFFFFFFF); |
||||
a20 = SPH_C64(0xFFFFFFFFFFFFFFFF); |
||||
a31 = SPH_C64(0xFFFFFFFFFFFFFFFF); |
||||
a22 = SPH_C64(0xFFFFFFFFFFFFFFFF); |
||||
a23 = SPH_C64(0xFFFFFFFFFFFFFFFF); |
||||
a04 = SPH_C64(0xFFFFFFFFFFFFFFFF); |
||||
|
||||
a00 ^= SWAP8(hash.h8[0]); |
||||
a10 ^= SWAP8(hash.h8[1]); |
||||
a20 ^= SWAP8(hash.h8[2]); |
||||
a30 ^= SWAP8(hash.h8[3]); |
||||
a40 ^= SWAP8(hash.h8[4]); |
||||
a01 ^= SWAP8(hash.h8[5]); |
||||
a11 ^= SWAP8(hash.h8[6]); |
||||
a21 ^= SWAP8(hash.h8[7]); |
||||
a31 ^= 0x8000000000000001; |
||||
KECCAK_F_1600; |
||||
// Finalize the "lane complement" |
||||
a10 = ~a10; |
||||
a20 = ~a20; |
||||
|
||||
hash.h8[0] = SWAP8(a00); |
||||
hash.h8[1] = SWAP8(a10); |
||||
hash.h8[2] = SWAP8(a20); |
||||
hash.h8[3] = SWAP8(a30); |
||||
hash.h8[4] = SWAP8(a40); |
||||
hash.h8[5] = SWAP8(a01); |
||||
hash.h8[6] = SWAP8(a11); |
||||
hash.h8[7] = SWAP8(a21); |
||||
} |
||||
|
||||
// gost |
||||
{ |
||||
sph_u64 m[8], out[8]; |
||||
|
||||
m[0] = SWAP8(hash.h8[0]); |
||||
m[1] = SWAP8(hash.h8[1]); |
||||
m[2] = SWAP8(hash.h8[2]); |
||||
m[3] = SWAP8(hash.h8[3]); |
||||
m[4] = SWAP8(hash.h8[4]); |
||||
m[5] = SWAP8(hash.h8[5]); |
||||
m[6] = SWAP8(hash.h8[6]); |
||||
m[7] = SWAP8(hash.h8[7]); |
||||
|
||||
GOST_hash_512((const unsigned char*)m, 8*64, (unsigned char*)out); |
||||
|
||||
hash.h8[0] = SWAP8(out[0]); |
||||
hash.h8[1] = SWAP8(out[1]); |
||||
hash.h8[2] = SWAP8(out[2]); |
||||
hash.h8[3] = SWAP8(out[3]); |
||||
hash.h8[4] = SWAP8(out[4]); |
||||
hash.h8[5] = SWAP8(out[5]); |
||||
hash.h8[6] = SWAP8(out[6]); |
||||
hash.h8[7] = SWAP8(out[7]); |
||||
|
||||
} |
||||
|
||||
// luffa |
||||
{ |
||||
sph_u32 V00 = SPH_C32(0x6d251e69), V01 = SPH_C32(0x44b051e0), V02 = SPH_C32(0x4eaa6fb4), V03 = SPH_C32(0xdbf78465), V04 = SPH_C32(0x6e292011), V05 = SPH_C32(0x90152df4), V06 = SPH_C32(0xee058139), V07 = SPH_C32(0xdef610bb); |
||||
sph_u32 V10 = SPH_C32(0xc3b44b95), V11 = SPH_C32(0xd9d2f256), V12 = SPH_C32(0x70eee9a0), V13 = SPH_C32(0xde099fa3), V14 = SPH_C32(0x5d9b0557), V15 = SPH_C32(0x8fc944b3), V16 = SPH_C32(0xcf1ccf0e), V17 = SPH_C32(0x746cd581); |
||||
sph_u32 V20 = SPH_C32(0xf7efc89d), V21 = SPH_C32(0x5dba5781), V22 = SPH_C32(0x04016ce5), V23 = SPH_C32(0xad659c05), V24 = SPH_C32(0x0306194f), V25 = SPH_C32(0x666d1836), V26 = SPH_C32(0x24aa230a), V27 = SPH_C32(0x8b264ae7); |
||||
sph_u32 V30 = SPH_C32(0x858075d5), V31 = SPH_C32(0x36d79cce), V32 = SPH_C32(0xe571f7d7), V33 = SPH_C32(0x204b1f67), V34 = SPH_C32(0x35870c6a), V35 = SPH_C32(0x57e9e923), V36 = SPH_C32(0x14bcb808), V37 = SPH_C32(0x7cde72ce); |
||||
sph_u32 V40 = SPH_C32(0x6c68e9be), V41 = SPH_C32(0x5ec41e22), V42 = SPH_C32(0xc825b7c7), V43 = SPH_C32(0xaffb4363), V44 = SPH_C32(0xf5df3999), V45 = SPH_C32(0x0fc688f1), V46 = SPH_C32(0xb07224cc), V47 = SPH_C32(0x03e86cea); |
||||
|
||||
DECL_TMP8(M); |
||||
|
||||
M0 = hash.h4[1]; |
||||
M1 = hash.h4[0]; |
||||
M2 = hash.h4[3]; |
||||
M3 = hash.h4[2]; |
||||
M4 = hash.h4[5]; |
||||
M5 = hash.h4[4]; |
||||
M6 = hash.h4[7]; |
||||
M7 = hash.h4[6]; |
||||
|
||||
for(uint i = 0; i < 5; i++) |
||||
{ |
||||
MI5; |
||||
LUFFA_P5; |
||||
|
||||
if(i == 0) { |
||||
M0 = hash.h4[9]; |
||||
M1 = hash.h4[8]; |
||||
M2 = hash.h4[11]; |
||||
M3 = hash.h4[10]; |
||||
M4 = hash.h4[13]; |
||||
M5 = hash.h4[12]; |
||||
M6 = hash.h4[15]; |
||||
M7 = hash.h4[14]; |
||||
} else if(i == 1) { |
||||
M0 = 0x80000000; |
||||
M1 = M2 = M3 = M4 = M5 = M6 = M7 = 0; |
||||
} else if(i == 2) { |
||||
M0 = M1 = M2 = M3 = M4 = M5 = M6 = M7 = 0; |
||||
} else if(i == 3) { |
||||
hash.h4[1] = V00 ^ V10 ^ V20 ^ V30 ^ V40; |
||||
hash.h4[0] = V01 ^ V11 ^ V21 ^ V31 ^ V41; |
||||
hash.h4[3] = V02 ^ V12 ^ V22 ^ V32 ^ V42; |
||||
hash.h4[2] = V03 ^ V13 ^ V23 ^ V33 ^ V43; |
||||
hash.h4[5] = V04 ^ V14 ^ V24 ^ V34 ^ V44; |
||||
hash.h4[4] = V05 ^ V15 ^ V25 ^ V35 ^ V45; |
||||
hash.h4[7] = V06 ^ V16 ^ V26 ^ V36 ^ V46; |
||||
hash.h4[6] = V07 ^ V17 ^ V27 ^ V37 ^ V47; |
||||
} |
||||
} |
||||
hash.h4[9] = V00 ^ V10 ^ V20 ^ V30 ^ V40; |
||||
hash.h4[8] = V01 ^ V11 ^ V21 ^ V31 ^ V41; |
||||
hash.h4[11] = V02 ^ V12 ^ V22 ^ V32 ^ V42; |
||||
hash.h4[10] = V03 ^ V13 ^ V23 ^ V33 ^ V43; |
||||
hash.h4[13] = V04 ^ V14 ^ V24 ^ V34 ^ V44; |
||||
hash.h4[12] = V05 ^ V15 ^ V25 ^ V35 ^ V45; |
||||
hash.h4[15] = V06 ^ V16 ^ V26 ^ V36 ^ V46; |
||||
hash.h4[14] = V07 ^ V17 ^ V27 ^ V37 ^ V47; |
||||
} |
||||
|
||||
// cubehash.h1 |
||||
{ |
||||
sph_u32 x0 = SPH_C32(0x2AEA2A61), x1 = SPH_C32(0x50F494D4), x2 = SPH_C32(0x2D538B8B), x3 = SPH_C32(0x4167D83E); |
||||
sph_u32 x4 = SPH_C32(0x3FEE2313), x5 = SPH_C32(0xC701CF8C), x6 = SPH_C32(0xCC39968E), x7 = SPH_C32(0x50AC5695); |
||||
sph_u32 x8 = SPH_C32(0x4D42C787), x9 = SPH_C32(0xA647A8B3), xa = SPH_C32(0x97CF0BEF), xb = SPH_C32(0x825B4537); |
||||
sph_u32 xc = SPH_C32(0xEEF864D2), xd = SPH_C32(0xF22090C4), xe = SPH_C32(0xD0E5CD33), xf = SPH_C32(0xA23911AE); |
||||
sph_u32 xg = SPH_C32(0xFCD398D9), xh = SPH_C32(0x148FE485), xi = SPH_C32(0x1B017BEF), xj = SPH_C32(0xB6444532); |
||||
sph_u32 xk = SPH_C32(0x6A536159), xl = SPH_C32(0x2FF5781C), xm = SPH_C32(0x91FA7934), xn = SPH_C32(0x0DBADEA9); |
||||
sph_u32 xo = SPH_C32(0xD65C8A2B), xp = SPH_C32(0xA5A70E75), xq = SPH_C32(0xB1C62456), xr = SPH_C32(0xBC796576); |
||||
sph_u32 xs = SPH_C32(0x1921C8F7), xt = SPH_C32(0xE7989AF1), xu = SPH_C32(0x7795D246), xv = SPH_C32(0xD43E3B44); |
||||
|
||||
x0 ^= SWAP4(hash.h4[1]); |
||||
x1 ^= SWAP4(hash.h4[0]); |
||||
x2 ^= SWAP4(hash.h4[3]); |
||||
x3 ^= SWAP4(hash.h4[2]); |
||||
x4 ^= SWAP4(hash.h4[5]); |
||||
x5 ^= SWAP4(hash.h4[4]); |
||||
x6 ^= SWAP4(hash.h4[7]); |
||||
x7 ^= SWAP4(hash.h4[6]); |
||||
|
||||
for (int i = 0; i < 13; i ++) { |
||||
SIXTEEN_ROUNDS; |
||||
|
||||
if (i == 0) { |
||||
x0 ^= SWAP4(hash.h4[9]); |
||||
x1 ^= SWAP4(hash.h4[8]); |
||||
x2 ^= SWAP4(hash.h4[11]); |
||||
x3 ^= SWAP4(hash.h4[10]); |
||||
x4 ^= SWAP4(hash.h4[13]); |
||||
x5 ^= SWAP4(hash.h4[12]); |
||||
x6 ^= SWAP4(hash.h4[15]); |
||||
x7 ^= SWAP4(hash.h4[14]); |
||||
} else if(i == 1) { |
||||
x0 ^= 0x80; |
||||
} else if (i == 2) { |
||||
xv ^= SPH_C32(1); |
||||
} |
||||
} |
||||
|
||||
hash.h4[0] = x0; |
||||
hash.h4[1] = x1; |
||||
hash.h4[2] = x2; |
||||
hash.h4[3] = x3; |
||||
hash.h4[4] = x4; |
||||
hash.h4[5] = x5; |
||||
hash.h4[6] = x6; |
||||
hash.h4[7] = x7; |
||||
hash.h4[8] = x8; |
||||
hash.h4[9] = x9; |
||||
hash.h4[10] = xa; |
||||
hash.h4[11] = xb; |
||||
hash.h4[12] = xc; |
||||
hash.h4[13] = xd; |
||||
hash.h4[14] = xe; |
||||
hash.h4[15] = xf; |
||||
} |
||||
|
||||
// shavite |
||||
{ |
||||
// IV |
||||
sph_u32 h0 = SPH_C32(0x72FCCDD8), h1 = SPH_C32(0x79CA4727), h2 = SPH_C32(0x128A077B), h3 = SPH_C32(0x40D55AEC); |
||||
sph_u32 h4 = SPH_C32(0xD1901A06), h5 = SPH_C32(0x430AE307), h6 = SPH_C32(0xB29F5CD1), h7 = SPH_C32(0xDF07FBFC); |
||||
sph_u32 h8 = SPH_C32(0x8E45D73D), h9 = SPH_C32(0x681AB538), hA = SPH_C32(0xBDE86578), hB = SPH_C32(0xDD577E47); |
||||
sph_u32 hC = SPH_C32(0xE275EADE), hD = SPH_C32(0x502D9FCD), hE = SPH_C32(0xB9357178), hF = SPH_C32(0x022A4B9A); |
||||
|
||||
// state |
||||
sph_u32 rk00, rk01, rk02, rk03, rk04, rk05, rk06, rk07; |
||||
sph_u32 rk08, rk09, rk0A, rk0B, rk0C, rk0D, rk0E, rk0F; |
||||
sph_u32 rk10, rk11, rk12, rk13, rk14, rk15, rk16, rk17; |
||||
sph_u32 rk18, rk19, rk1A, rk1B, rk1C, rk1D, rk1E, rk1F; |
||||
|
||||
sph_u32 sc_count0 = (64 << 3), sc_count1 = 0, sc_count2 = 0, sc_count3 = 0; |
||||
|
||||
rk00 = hash.h4[0]; |
||||
rk01 = hash.h4[1]; |
||||
rk02 = hash.h4[2]; |
||||
rk03 = hash.h4[3]; |
||||
rk04 = hash.h4[4]; |
||||
rk05 = hash.h4[5]; |
||||
rk06 = hash.h4[6]; |
||||
rk07 = hash.h4[7]; |
||||
rk08 = hash.h4[8]; |
||||
rk09 = hash.h4[9]; |
||||
rk0A = hash.h4[10]; |
||||
rk0B = hash.h4[11]; |
||||
rk0C = hash.h4[12]; |
||||
rk0D = hash.h4[13]; |
||||
rk0E = hash.h4[14]; |
||||
rk0F = hash.h4[15]; |
||||
rk10 = 0x80; |
||||
rk11 = rk12 = rk13 = rk14 = rk15 = rk16 = rk17 = rk18 = rk19 = rk1A = 0; |
||||
rk1B = 0x2000000; |
||||
rk1C = rk1D = rk1E = 0; |
||||
rk1F = 0x2000000; |
||||
|
||||
c512(buf); |
||||
|
||||
hash.h4[0] = h0; |
||||
hash.h4[1] = h1; |
||||
hash.h4[2] = h2; |
||||
hash.h4[3] = h3; |
||||
hash.h4[4] = h4; |
||||
hash.h4[5] = h5; |
||||
hash.h4[6] = h6; |
||||
hash.h4[7] = h7; |
||||
hash.h4[8] = h8; |
||||
hash.h4[9] = h9; |
||||
hash.h4[10] = hA; |
||||
hash.h4[11] = hB; |
||||
hash.h4[12] = hC; |
||||
hash.h4[13] = hD; |
||||
hash.h4[14] = hE; |
||||
hash.h4[15] = hF; |
||||
} |
||||
|
||||
// simd |
||||
{ |
||||
s32 q[256]; |
||||
unsigned char x[128]; |
||||
for(unsigned int i = 0; i < 64; i++) |
||||
x[i] = hash.h1[i]; |
||||
for(unsigned int i = 64; i < 128; i++) |
||||
x[i] = 0; |
||||
|
||||
u32 A0 = C32(0x0BA16B95), A1 = C32(0x72F999AD), A2 = C32(0x9FECC2AE), A3 = C32(0xBA3264FC), A4 = C32(0x5E894929), A5 = C32(0x8E9F30E5), A6 = C32(0x2F1DAA37), A7 = C32(0xF0F2C558); |
||||
u32 B0 = C32(0xAC506643), B1 = C32(0xA90635A5), B2 = C32(0xE25B878B), B3 = C32(0xAAB7878F), B4 = C32(0x88817F7A), B5 = C32(0x0A02892B), B6 = C32(0x559A7550), B7 = C32(0x598F657E); |
||||
u32 C0 = C32(0x7EEF60A1), C1 = C32(0x6B70E3E8), C2 = C32(0x9C1714D1), C3 = C32(0xB958E2A8), C4 = C32(0xAB02675E), C5 = C32(0xED1C014F), C6 = C32(0xCD8D65BB), C7 = C32(0xFDB7A257); |
||||
u32 D0 = C32(0x09254899), D1 = C32(0xD699C7BC), D2 = C32(0x9019B6DC), D3 = C32(0x2B9022E4), D4 = C32(0x8FA14956), D5 = C32(0x21BF9BD3), D6 = C32(0xB94D0943), D7 = C32(0x6FFDDC22); |
||||
|
||||
FFT256(0, 1, 0, ll1); |
||||
for (int i = 0; i < 256; i ++) { |
||||
s32 tq; |
||||
|
||||
tq = q[i] + yoff_b_n[i]; |
||||
tq = REDS2(tq); |
||||
tq = REDS1(tq); |
||||
tq = REDS1(tq); |
||||
q[i] = (tq <= 128 ? tq : tq - 257); |
||||
} |
||||
|
||||
A0 ^= hash.h4[0]; |
||||
A1 ^= hash.h4[1]; |
||||
A2 ^= hash.h4[2]; |
||||
A3 ^= hash.h4[3]; |
||||
A4 ^= hash.h4[4]; |
||||
A5 ^= hash.h4[5]; |
||||
A6 ^= hash.h4[6]; |
||||
A7 ^= hash.h4[7]; |
||||
B0 ^= hash.h4[8]; |
||||
B1 ^= hash.h4[9]; |
||||
B2 ^= hash.h4[10]; |
||||
B3 ^= hash.h4[11]; |
||||
B4 ^= hash.h4[12]; |
||||
B5 ^= hash.h4[13]; |
||||
B6 ^= hash.h4[14]; |
||||
B7 ^= hash.h4[15]; |
||||
|
||||
ONE_ROUND_BIG(0_, 0, 3, 23, 17, 27); |
||||
ONE_ROUND_BIG(1_, 1, 28, 19, 22, 7); |
||||
ONE_ROUND_BIG(2_, 2, 29, 9, 15, 5); |
||||
ONE_ROUND_BIG(3_, 3, 4, 13, 10, 25); |
||||
|
||||
STEP_BIG( |
||||
C32(0x0BA16B95), C32(0x72F999AD), C32(0x9FECC2AE), C32(0xBA3264FC), |
||||
C32(0x5E894929), C32(0x8E9F30E5), C32(0x2F1DAA37), C32(0xF0F2C558), |
||||
IF, 4, 13, PP8_4_); |
||||
STEP_BIG( |
||||
C32(0xAC506643), C32(0xA90635A5), C32(0xE25B878B), C32(0xAAB7878F), |
||||
C32(0x88817F7A), C32(0x0A02892B), C32(0x559A7550), C32(0x598F657E), |
||||
IF, 13, 10, PP8_5_); |
||||
STEP_BIG( |
||||
C32(0x7EEF60A1), C32(0x6B70E3E8), C32(0x9C1714D1), C32(0xB958E2A8), |
||||
C32(0xAB02675E), C32(0xED1C014F), C32(0xCD8D65BB), C32(0xFDB7A257), |
||||
IF, 10, 25, PP8_6_); |
||||
STEP_BIG( |
||||
C32(0x09254899), C32(0xD699C7BC), C32(0x9019B6DC), C32(0x2B9022E4), |
||||
C32(0x8FA14956), C32(0x21BF9BD3), C32(0xB94D0943), C32(0x6FFDDC22), |
||||
IF, 25, 4, PP8_0_); |
||||
|
||||
u32 COPY_A0 = A0, COPY_A1 = A1, COPY_A2 = A2, COPY_A3 = A3, COPY_A4 = A4, COPY_A5 = A5, COPY_A6 = A6, COPY_A7 = A7; |
||||
u32 COPY_B0 = B0, COPY_B1 = B1, COPY_B2 = B2, COPY_B3 = B3, COPY_B4 = B4, COPY_B5 = B5, COPY_B6 = B6, COPY_B7 = B7; |
||||
u32 COPY_C0 = C0, COPY_C1 = C1, COPY_C2 = C2, COPY_C3 = C3, COPY_C4 = C4, COPY_C5 = C5, COPY_C6 = C6, COPY_C7 = C7; |
||||
u32 COPY_D0 = D0, COPY_D1 = D1, COPY_D2 = D2, COPY_D3 = D3, COPY_D4 = D4, COPY_D5 = D5, COPY_D6 = D6, COPY_D7 = D7; |
||||
|
||||
#define q SIMD_Q |
||||
|
||||
A0 ^= 0x200; |
||||
|
||||
ONE_ROUND_BIG(0_, 0, 3, 23, 17, 27); |
||||
ONE_ROUND_BIG(1_, 1, 28, 19, 22, 7); |
||||
ONE_ROUND_BIG(2_, 2, 29, 9, 15, 5); |
||||
ONE_ROUND_BIG(3_, 3, 4, 13, 10, 25); |
||||
STEP_BIG( |
||||
COPY_A0, COPY_A1, COPY_A2, COPY_A3, |
||||
COPY_A4, COPY_A5, COPY_A6, COPY_A7, |
||||
IF, 4, 13, PP8_4_); |
||||
STEP_BIG( |
||||
COPY_B0, COPY_B1, COPY_B2, COPY_B3, |
||||
COPY_B4, COPY_B5, COPY_B6, COPY_B7, |
||||
IF, 13, 10, PP8_5_); |
||||
STEP_BIG( |
||||
COPY_C0, COPY_C1, COPY_C2, COPY_C3, |
||||
COPY_C4, COPY_C5, COPY_C6, COPY_C7, |
||||
IF, 10, 25, PP8_6_); |
||||
STEP_BIG( |
||||
COPY_D0, COPY_D1, COPY_D2, COPY_D3, |
||||
COPY_D4, COPY_D5, COPY_D6, COPY_D7, |
||||
IF, 25, 4, PP8_0_); |
||||
#undef q |
||||
|
||||
hash.h4[0] = A0; |
||||
hash.h4[1] = A1; |
||||
hash.h4[2] = A2; |
||||
hash.h4[3] = A3; |
||||
hash.h4[4] = A4; |
||||
hash.h4[5] = A5; |
||||
hash.h4[6] = A6; |
||||
hash.h4[7] = A7; |
||||
hash.h4[8] = B0; |
||||
hash.h4[9] = B1; |
||||
hash.h4[10] = B2; |
||||
hash.h4[11] = B3; |
||||
hash.h4[12] = B4; |
||||
hash.h4[13] = B5; |
||||
hash.h4[14] = B6; |
||||
hash.h4[15] = B7; |
||||
} |
||||
|
||||
// echo |
||||
{ |
||||
sph_u64 W00, W01, W10, W11, W20, W21, W30, W31, W40, W41, W50, W51, W60, W61, W70, W71, W80, W81, W90, W91, WA0, WA1, WB0, WB1, WC0, WC1, WD0, WD1, WE0, WE1, WF0, WF1; |
||||
sph_u64 Vb00, Vb01, Vb10, Vb11, Vb20, Vb21, Vb30, Vb31, Vb40, Vb41, Vb50, Vb51, Vb60, Vb61, Vb70, Vb71; |
||||
Vb00 = Vb10 = Vb20 = Vb30 = Vb40 = Vb50 = Vb60 = Vb70 = 512UL; |
||||
Vb01 = Vb11 = Vb21 = Vb31 = Vb41 = Vb51 = Vb61 = Vb71 = 0; |
||||
|
||||
sph_u32 K0 = 512; |
||||
sph_u32 K1 = 0; |
||||
sph_u32 K2 = 0; |
||||
sph_u32 K3 = 0; |
||||
|
||||
W00 = Vb00; |
||||
W01 = Vb01; |
||||
W10 = Vb10; |
||||
W11 = Vb11; |
||||
W20 = Vb20; |
||||
W21 = Vb21; |
||||
W30 = Vb30; |
||||
W31 = Vb31; |
||||
W40 = Vb40; |
||||
W41 = Vb41; |
||||
W50 = Vb50; |
||||
W51 = Vb51; |
||||
W60 = Vb60; |
||||
W61 = Vb61; |
||||
W70 = Vb70; |
||||
W71 = Vb71; |
||||
W80 = hash.h8[0]; |
||||
W81 = hash.h8[1]; |
||||
W90 = hash.h8[2]; |
||||
W91 = hash.h8[3]; |
||||
WA0 = hash.h8[4]; |
||||
WA1 = hash.h8[5]; |
||||
WB0 = hash.h8[6]; |
||||
WB1 = hash.h8[7]; |
||||
WC0 = 0x80; |
||||
WC1 = 0; |
||||
WD0 = 0; |
||||
WD1 = 0; |
||||
WE0 = 0; |
||||
WE1 = 0x200000000000000; |
||||
WF0 = 0x200; |
||||
WF1 = 0; |
||||
|
||||
for (unsigned u = 0; u < 10; u ++) { |
||||
BIG_ROUND; |
||||
} |
||||
|
||||
Vb00 ^= hash.h8[0] ^ W00 ^ W80; |
||||
Vb01 ^= hash.h8[1] ^ W01 ^ W81; |
||||
Vb10 ^= hash.h8[2] ^ W10 ^ W90; |
||||
Vb11 ^= hash.h8[3] ^ W11 ^ W91; |
||||
Vb20 ^= hash.h8[4] ^ W20 ^ WA0; |
||||
Vb21 ^= hash.h8[5] ^ W21 ^ WA1; |
||||
Vb30 ^= hash.h8[6] ^ W30 ^ WB0; |
||||
Vb31 ^= hash.h8[7] ^ W31 ^ WB1; |
||||
|
||||
bool result = (Vb11 <= target); |
||||
if (result) |
||||
output[output[0xFF]++] = SWAP4(gid); |
||||
} |
||||
} |
||||
|
||||
#endif // SIBCOIN_CL |
||||
@ -1,3 +1,3 @@
@@ -1,3 +1,3 @@
|
||||
noinst_LIBRARIES = libsph.a |
||||
|
||||
libsph_a_SOURCES = bmw.c echo.c jh.c luffa.c simd.c blake.c cubehash.c groestl.c keccak.c shavite.c skein.c sha2.c sha2big.c fugue.c hamsi.c panama.c shabal.c whirlpool.c sha256_Y.c ripemd.c |
||||
libsph_a_SOURCES = bmw.c echo.c jh.c luffa.c gost.c simd.c blake.c cubehash.c groestl.c keccak.c shavite.c skein.c sha2.c sha2big.c fugue.c hamsi.c panama.c shabal.c whirlpool.c sha256_Y.c ripemd.c |
||||
|
||||
@ -0,0 +1,185 @@
@@ -0,0 +1,185 @@
|
||||
/* $Id: sph_gost.h 216 2010-06-08 09:46:57Z tp $ */ |
||||
/**
|
||||
* GOST interface. This is the interface for GOST R 12 with the |
||||
* recommended parameters for SHA-3, with output lengths 256 |
||||
* and 512 bits. |
||||
* |
||||
* ==========================(LICENSE BEGIN)============================ |
||||
* |
||||
* Copyright (c) 2007-2010 Projet RNRT SAPHIR |
||||
* |
||||
* Permission is hereby granted, free of charge, to any person obtaining |
||||
* a copy of this software and associated documentation files (the |
||||
* "Software"), to deal in the Software without restriction, including |
||||
* without limitation the rights to use, copy, modify, merge, publish, |
||||
* distribute, sublicense, and/or sell copies of the Software, and to |
||||
* permit persons to whom the Software is furnished to do so, subject to |
||||
* the following conditions: |
||||
* |
||||
* The above copyright notice and this permission notice shall be |
||||
* included in all copies or substantial portions of the Software. |
||||
* |
||||
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, |
||||
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF |
||||
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. |
||||
* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY |
||||
* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, |
||||
* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE |
||||
* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. |
||||
* |
||||
* ===========================(LICENSE END)============================= |
||||
* |
||||
* @file sph_gost.h |
||||
* @author Thomas Pornin <thomas.pornin@cryptolog.com> |
||||
*/ |
||||
|
||||
#ifndef SPH_GOST_H__ |
||||
#define SPH_GOST_H__ |
||||
|
||||
#ifdef __cplusplus |
||||
extern "C"{ |
||||
#endif |
||||
|
||||
#include <stddef.h> |
||||
#include "sph_types.h" |
||||
|
||||
/**
|
||||
* Output size (in bits) for GOST-256. |
||||
*/ |
||||
#define SPH_SIZE_gost256 256 |
||||
|
||||
/**
|
||||
* Output size (in bits) for GOST-512. |
||||
*/ |
||||
#define SPH_SIZE_gost512 512 |
||||
|
||||
/**
|
||||
* This structure is a context for Keccak computations: it contains the |
||||
* intermediate values and some data from the last entered block. Once a |
||||
* GOST computation has been performed, the context can be reused for |
||||
* another computation. |
||||
* |
||||
* The contents of this structure are private. A running GOST computation |
||||
* can be cloned by copying the context (e.g. with a simple |
||||
* <code>memcpy()</code>). |
||||
*/ |
||||
|
||||
/**
|
||||
* This structure is a context for Gost-256 computations. |
||||
*/ |
||||
|
||||
typedef struct { |
||||
#ifndef DOXYGEN_IGNORE |
||||
unsigned char buf[32]; /* first field, for alignment */ |
||||
size_t ptr; |
||||
sph_u32 V[3][8]; |
||||
#endif |
||||
} sph_gost256_context; |
||||
|
||||
/**
|
||||
* This structure is a context for Gost-512 computations. |
||||
*/ |
||||
typedef struct { |
||||
#ifndef DOXYGEN_IGNORE |
||||
unsigned char buf[64]; /* first field, for alignment */ |
||||
size_t ptr; |
||||
sph_u32 V[5][8]; |
||||
#endif |
||||
} sph_gost512_context; |
||||
|
||||
|
||||
/**
|
||||
* Initialize a GOST-256 context. This process performs no memory allocation. |
||||
* |
||||
* @param cc the GOST-256 context (pointer to a |
||||
* <code>sph_gost256_context</code>) |
||||
*/ |
||||
void sph_gost256_init(void *cc); |
||||
|
||||
/**
|
||||
* Process some data bytes. It is acceptable that <code>len</code> is zero |
||||
* (in which case this function does nothing). |
||||
* |
||||
* @param cc the Gost-256 context |
||||
* @param data the input data |
||||
* @param len the input data length (in bytes) |
||||
*/ |
||||
void sph_gost256(void *cc, const void *data, size_t len); |
||||
|
||||
/**
|
||||
* Terminate the current GOST-256 computation and output the result into |
||||
* the provided buffer. The destination buffer must be wide enough to |
||||
* accomodate the result (32 bytes). The context is automatically |
||||
* reinitialized. |
||||
* |
||||
* @param cc the GOST-256 context |
||||
* @param dst the destination buffer |
||||
*/ |
||||
void sph_gost256_close(void *cc, void *dst); |
||||
|
||||
/**
|
||||
* Add a few additional bits (0 to 7) to the current computation, then |
||||
* terminate it and output the result in the provided buffer, which must |
||||
* be wide enough to accomodate the result (32 bytes). If bit number i |
||||
* in <code>ub</code> has value 2^i, then the extra bits are those |
||||
* numbered 7 downto 8-n (this is the big-endian convention at the byte |
||||
* level). The context is automatically reinitialized. |
||||
* |
||||
* @param cc the GOST-256 context |
||||
* @param ub the extra bits |
||||
* @param n the number of extra bits (0 to 7) |
||||
* @param dst the destination buffer |
||||
*/ |
||||
void sph_gost256_addbits_and_close( |
||||
void *cc, unsigned ub, unsigned n, void *dst); |
||||
|
||||
/**
|
||||
* Initialize a Gost-512 context. This process performs no memory allocation. |
||||
* |
||||
* @param cc the GOST-512 context (pointer to a |
||||
* <code>sph_gost512_context</code>) |
||||
*/ |
||||
void sph_gost512_init(void *cc); |
||||
|
||||
/**
|
||||
* Process some data bytes. It is acceptable that <code>len</code> is zero |
||||
* (in which case this function does nothing). |
||||
* |
||||
* @param cc the GOST-512 context |
||||
* @param data the input data |
||||
* @param len the input data length (in bytes) |
||||
*/ |
||||
void sph_gost512(void *cc, const void *data, size_t len); |
||||
|
||||
/**
|
||||
* Terminate the current GOST-512 computation and output the result into |
||||
* the provided buffer. The destination buffer must be wide enough to |
||||
* accomodate the result (64 bytes). The context is automatically |
||||
* reinitialized. |
||||
* |
||||
* @param cc the GOST-512 context |
||||
* @param dst the destination buffer |
||||
*/ |
||||
void sph_gost512_close(void *cc, void *dst); |
||||
|
||||
/**
|
||||
* Add a few additional bits (0 to 7) to the current computation, then |
||||
* terminate it and output the result in the provided buffer, which must |
||||
* be wide enough to accomodate the result (64 bytes). If bit number i |
||||
* in <code>ub</code> has value 2^i, then the extra bits are those |
||||
* numbered 7 downto 8-n (this is the big-endian convention at the byte |
||||
* level). The context is automatically reinitialized. |
||||
* |
||||
* @param cc the GOST-512 context |
||||
* @param ub the extra bits |
||||
* @param n the number of extra bits (0 to 7) |
||||
* @param dst the destination buffer |
||||
*/ |
||||
void sph_gost512_addbits_and_close( |
||||
void *cc, unsigned ub, unsigned n, void *dst); |
||||
|
||||
#ifdef __cplusplus |
||||
} |
||||
#endif |
||||
|
||||
#endif |
||||
Loading…
Reference in new issue