mirror of https://github.com/GOSTSec/ccminer
You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
88 lines
2.9 KiB
88 lines
2.9 KiB
/** |
|
* Header file for Blake2b's internal permutation in the form of a sponge. |
|
* This code is based on the original Blake2b's implementation provided by |
|
* Samuel Neves (https://blake2.net/) |
|
* |
|
* Author: The Lyra PHC team (http://www.lyra-kdf.net/) -- 2014. |
|
* |
|
* This software is hereby placed in the public domain. |
|
* |
|
* THIS SOFTWARE IS PROVIDED BY THE AUTHORS ''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 AUTHORS 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 SPONGE_H_ |
|
#define SPONGE_H_ |
|
|
|
#include <stdint.h> |
|
|
|
/* Blake2b IV Array */ |
|
static const uint64_t blake2b_IV[8] = |
|
{ |
|
0x6a09e667f3bcc908ULL, 0xbb67ae8584caa73bULL, |
|
0x3c6ef372fe94f82bULL, 0xa54ff53a5f1d36f1ULL, |
|
0x510e527fade682d1ULL, 0x9b05688c2b3e6c1fULL, |
|
0x1f83d9abfb41bd6bULL, 0x5be0cd19137e2179ULL |
|
}; |
|
|
|
/* Blake2b's rotation */ |
|
static __inline uint64_t rotr64(const uint64_t w, const unsigned c) { |
|
#ifdef _MSC_VER |
|
return _rotr64(w, c); |
|
#else |
|
return ( w >> c ) | ( w << ( 64 - c ) ); |
|
#endif |
|
} |
|
|
|
/* Blake2b's G function */ |
|
#define G(r,i,a,b,c,d) do { \ |
|
a = a + b; \ |
|
d = rotr64(d ^ a, 32); \ |
|
c = c + d; \ |
|
b = rotr64(b ^ c, 24); \ |
|
a = a + b; \ |
|
d = rotr64(d ^ a, 16); \ |
|
c = c + d; \ |
|
b = rotr64(b ^ c, 63); \ |
|
} while(0) |
|
|
|
|
|
/*One Round of the Blake2b's compression function*/ |
|
#define ROUND_LYRA(r) \ |
|
G(r,0,v[ 0],v[ 4],v[ 8],v[12]); \ |
|
G(r,1,v[ 1],v[ 5],v[ 9],v[13]); \ |
|
G(r,2,v[ 2],v[ 6],v[10],v[14]); \ |
|
G(r,3,v[ 3],v[ 7],v[11],v[15]); \ |
|
G(r,4,v[ 0],v[ 5],v[10],v[15]); \ |
|
G(r,5,v[ 1],v[ 6],v[11],v[12]); \ |
|
G(r,6,v[ 2],v[ 7],v[ 8],v[13]); \ |
|
G(r,7,v[ 3],v[ 4],v[ 9],v[14]); |
|
|
|
//---- Housekeeping |
|
void initState(uint64_t state[/*16*/]); |
|
|
|
//---- Squeezes |
|
void squeeze(uint64_t *state, unsigned char *out, unsigned int len); |
|
void reducedSqueezeRow0(uint64_t* state, uint64_t* row, const uint32_t nCols); |
|
|
|
//---- Absorbs |
|
void absorbBlock(uint64_t *state, const uint64_t *in); |
|
void absorbBlockBlake2Safe(uint64_t *state, const uint64_t *in); |
|
|
|
//---- Duplexes |
|
void reducedDuplexRow1(uint64_t *state, uint64_t *rowIn, uint64_t *rowOut, const uint32_t nCols); |
|
void reducedDuplexRowSetup(uint64_t *state, uint64_t *rowIn, uint64_t *rowInOut, uint64_t *rowOut, const uint32_t nCols); |
|
void reducedDuplexRow(uint64_t *state, uint64_t *rowIn, uint64_t *rowInOut, uint64_t *rowOut, const uint32_t nCols); |
|
|
|
//---- Misc |
|
void printArray(unsigned char *array, unsigned int size, char *name); |
|
|
|
#endif /* SPONGE_H_ */
|
|
|