2 * Copyright 2009 Colin Percival, 2011 ArtForz, 2011 pooler, 2013 Balthazar
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
14 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
15 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
16 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
17 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
18 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
19 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
20 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
21 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
22 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
23 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
26 * This file was originally written by Colin Percival as part of the Tarsnap
27 * online backup system.
33 #define INLINE __inline
38 // Generic scrypt_core implementation
40 static INLINE void xor_salsa8(uint32_t B[16], const uint32_t Bx[16])
42 uint32_t x00,x01,x02,x03,x04,x05,x06,x07,x08,x09,x10,x11,x12,x13,x14,x15;
45 x00 = (B[0] ^= Bx[0]);
46 x01 = (B[1] ^= Bx[1]);
47 x02 = (B[2] ^= Bx[2]);
48 x03 = (B[3] ^= Bx[3]);
49 x04 = (B[4] ^= Bx[4]);
50 x05 = (B[5] ^= Bx[5]);
51 x06 = (B[6] ^= Bx[6]);
52 x07 = (B[7] ^= Bx[7]);
53 x08 = (B[8] ^= Bx[8]);
54 x09 = (B[9] ^= Bx[9]);
55 x10 = (B[10] ^= Bx[10]);
56 x11 = (B[11] ^= Bx[11]);
57 x12 = (B[12] ^= Bx[12]);
58 x13 = (B[13] ^= Bx[13]);
59 x14 = (B[14] ^= Bx[14]);
60 x15 = (B[15] ^= Bx[15]);
61 for (i = 0; i < 8; i += 2) {
62 #define R(a, b) (((a) << (b)) | ((a) >> (32 - (b))))
63 /* Operate on columns. */
64 x04 ^= R(x00+x12, 7); x09 ^= R(x05+x01, 7);
65 x14 ^= R(x10+x06, 7); x03 ^= R(x15+x11, 7);
67 x08 ^= R(x04+x00, 9); x13 ^= R(x09+x05, 9);
68 x02 ^= R(x14+x10, 9); x07 ^= R(x03+x15, 9);
70 x12 ^= R(x08+x04,13); x01 ^= R(x13+x09,13);
71 x06 ^= R(x02+x14,13); x11 ^= R(x07+x03,13);
73 x00 ^= R(x12+x08,18); x05 ^= R(x01+x13,18);
74 x10 ^= R(x06+x02,18); x15 ^= R(x11+x07,18);
76 /* Operate on rows. */
77 x01 ^= R(x00+x03, 7); x06 ^= R(x05+x04, 7);
78 x11 ^= R(x10+x09, 7); x12 ^= R(x15+x14, 7);
80 x02 ^= R(x01+x00, 9); x07 ^= R(x06+x05, 9);
81 x08 ^= R(x11+x10, 9); x13 ^= R(x12+x15, 9);
83 x03 ^= R(x02+x01,13); x04 ^= R(x07+x06,13);
84 x09 ^= R(x08+x11,13); x14 ^= R(x13+x12,13);
86 x00 ^= R(x03+x02,18); x05 ^= R(x04+x07,18);
87 x10 ^= R(x09+x08,18); x15 ^= R(x14+x13,18);
108 /* cpu and memory intensive function to transform a 80 byte buffer into a 32 byte output
109 scratchpad size needs to be at least 63 + (128 * r * p) + (256 * r + 64) + (128 * r * N) bytes
110 r = 1, p = 1, N = 1024
112 uint256 scrypt_blockhash(const uint8_t* input)
114 uint8_t scratchpad[SCRYPT_BUFFER_SIZE];
118 uint32_t *V = (uint32_t *)(((uintptr_t)(scratchpad) + 63) & ~ (uintptr_t)(63));
120 PKCS5_PBKDF2_HMAC((const char*)input, 80, input, 80, 1, EVP_sha256(), 128, (unsigned char *)X);
123 for (i = 0; i < 1024; i++) {
124 memcpy(&V[i * 32], X, 128);
125 xor_salsa8(&X[0], &X[16]);
126 xor_salsa8(&X[16], &X[0]);
128 for (i = 0; i < 1024; i++) {
129 j = 32 * (X[16] & 1023);
130 for (k = 0; k < 32; k++)
132 xor_salsa8(&X[0], &X[16]);
133 xor_salsa8(&X[16], &X[0]);
136 PKCS5_PBKDF2_HMAC((const char*)input, 80, (const unsigned char*)X, 128, 1, EVP_sha256(), 32, (unsigned char*)&result);