This repository has been archived by the owner on Sep 24, 2019. It is now read-only.
/
CryptoNight.txt
364 lines (305 loc) · 17.1 KB
/
CryptoNight.txt
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
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
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
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
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
CRYPTONOTE STANDARD 008 Seigen
Category: Main Track Max Jameson
Tuomo Nieminen
Neocortex
Antonio M. Juarez
CryptoNote
March 2013
CryptoNight Hash Function
Abstract
This document is part of the CryptoNote Standards describing a peer-
to-peer anonymous payment system. It defines the CryptoNote's default
proof-of-work hash function, CryptoNight.
Copyright and License Notice
Copyright (c) 2013 CryptoNote. This document is available under the
Creative Commons Attribution 3.0 License (international). To view a
copy of the license visit http://creativecommons.org/licenses/by/3.0/
Table of Contents
1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . . 2
2. Definitions . . . . . . . . . . . . . . . . . . . . . . . . . . 2
3. Scratchpad Initialization . . . . . . . . . . . . . . . . . . . 2
4. Memory-Hard Loop . . . . . . . . . . . . . . . . . . . . . . . 4
5. Result Calculation . . . . . . . . . . . . . . . . . . . . . . 6
6. References . . . . . . . . . . . . . . . . . . . . . . . . . . 8
1. Introduction
CryptoNight is a memory-hard hash function. It is designed to be
inefficiently computable on GPU, FPGA and ASIC architectures. The
CryptoNight algorithm's first step is initializing large scratchpad
with pseudo-random data. The next step is numerous read/write
operations at pseudo-random addresses contained in the scratchpad.
The final step is hashing the entire scratchpad to produce the
resulting value.
2. Definitions
hash function: an efficiently computable function which maps data of
arbitrary size to data of fixed size and behaves similarly to a
random function
scratchpad: a large area of memory used to store intermediate values
during the evaluation of a memory-hard function
3. Scratchpad Initialization
First, the input is hashed using Keccak [KECCAK] with parameters b =
1600 and c = 512. The bytes 0..31 of the Keccak final state are
interpreted as an AES-256 key [AES] and expanded to 10 round keys. A
scratchpad of 2097152 bytes (2 MiB) is allocated. The bytes 64..191
are extracted from the Keccak final state and split into 8 blocks of
16 bytes each. Each block is encrypted using the following procedure:
for i = 0..9 do:
block = aes_round(block, round_keys[i])
Where aes_round function performs a round of AES encryption, which
means that SubBytes, ShiftRows and MixColumns steps are performed on
the block, and the result is XORed with the round key. Note that
unlike in the AES encryption algorithm, the first and the last rounds
are not special. The resulting blocks are written into the first 128
bytes of the scratchpad. Then, these blocks are encrypted again in
the same way, and the result is written into the second 128 bytes of
the scratchpad. Each time 128 bytes are written, they represent the
result of the encryption of the previously written 128 bytes. The
process is repeated until the scratchpad is fully initialized.
This diagram illustrates scratchpad initialization:
+-----+
|Input|
+-----+
|
V
+--------+
| Keccak |
+--------+
|
V
+-------------------------------------------------------------+
| Final state |
+-------------+--------------+---------------+----------------+
| Bytes 0..31 | Bytes 32..63 | Bytes 64..191 | Bytes 192..199 |
+-------------+--------------+---------------+----------------+
| |
V |
+-------------+ V
| Round key 0 |------------+---+->+-----+
+-------------+ | | | |
| . | | | | |
| . | | | | AES |
| . | | | | |
+-------------+ | | | |
| Round key 9 |----------+-|-+-|->+-----+ +---+
+-------------+ | | | | | | |
| | | | +------------------->| |
| | | | | | |
| | | | V | |
| | | +->+-----+ | |
| | | | | | S |
| | | | | | |
| | | | AES | | c |
| | | | | | |
| | | | | | r |
| | +--->+-----+ | |
| | | | a |
| | +------------------->| |
| | . | t |
| | . | |
| | . | c |
| | +------------------->| |
| | | | h |
| | V | |
| +----->+-----+ | p |
| | | | |
| | | | a |
| | AES | | |
| | | | d |
| | | | |
+------->+-----+ | |
| | |
+------------------->| |
| |
+---+
Figure 3: Scratchpad initialization diagram
4. Memory-Hard Loop
Prior to the main loop, bytes 0..31 and 32..63 of the Keccak state
are XORed, and the resulting 32 bytes are used to initialize
variables a and b, 16 bytes each. These variables are used in the
main loop. The main loop is iterated 524,288 times. When a 16-byte
value needs to be converted into an address in the scratchpad, it is
interpreted as a little-endian integer, and the 21 low-order bits are
used as a byte index. However, the 4 low-order bits of the index are
cleared to ensure the 16-byte alignment. The data is read from and
written to the scratchpad in 16-byte blocks. Each iteration can be
expressed with the following pseudo-code:
scratchpad_address = to_scratchpad_address(a)
scratchpad[scratchpad_address] = aes_round(scratchpad
[scratchpad_address], a)
b, scratchpad[scratchpad_address] = scratchpad[scratchpad_address],
b xor scratchpad[scratchpad_address]
scratchpad_address = to_scratchpad_address(b)
a = 8byte_add(a, 8byte_mul(b, scratchpad[scratchpad_address]))
a, scratchpad[scratchpad_address] = a xor
scratchpad[scratchpad_address], a
Where, the 8byte_add function represents each of the arguments as a
pair of 64-bit little-endian values and adds them together,
component-wise, modulo 2^64. The result is converted back into 16
bytes.
The 8byte_mul function, however, uses only the first 8 bytes of each
argument, which are interpreted as unsigned 64-bit little-endian
integers and multiplied together. The result is converted into 16
bytes, and finally the two 8-byte halves of the result are swapped.
This diagram illustrates the memory-hard loop:
+-------------------------------------------------------------+
| Final state |
+-------------+--------------+---------------+----------------+
| Bytes 0..31 | Bytes 32..63 | Bytes 64..191 | Bytes 192..199 |
+-------------+--------------+---------------+----------------+
| |
| +-----+ |
+-->| XOR |<--+
+-----+
| |
+----+ +----+
| |
V V
+---+ +---+
| a | | b |
+---+ +---+
| |
--------------------- REPEAT 524288 TIMES ---------------------
| | address +---+
+-------------|----------------------------------->| |
| +-----+ | read | |
+-->| AES |<--|------------------------------------| |
| +-----+ V | |
| | +-----+ | S |
| +-->| XOR | | |
| | +-----+ write | c |
| | | +------------------------------>| |
| | +----+ address | r |
| +------------------------------------------>| |
| | +-----------+ read | a |
| +->| 8byte_mul |<--+------------------------| |
| | +-----------+ | | t |
| | | | | |
| | V | | c |
| | +-----------+ | | |
+------|->| 8byte_add | | | h |
| +-----------+ | | |
| | | write | p |
| +---------|----------------------->| |
| | | | a |
| V | | |
| +-----+ | | d |
| | XOR |<-----+ | |
| +-----+ | |
+------+ | | |
+-------------|-+ | |
| | +---+
-------------------------- END REPEAT -------------------------
| |
Figure 4: Memory-hard loop diagram
5. Result Calculation
After the memory-hard part, bytes 32..63 from the Keccak state are
expanded into 10 AES round keys in the same manner as in the first
part.
Bytes 64..191 are extracted from the Keccak state and XORed with the
first 128 bytes of the scratchpad. Then the result is encrypted in
the same manner as in the first part, but using the new keys. The
result is XORed with the second 128 bytes from the scratchpad,
encrypted again, and so on.
After XORing with the last 128 bytes of the scratchpad, the result is
encrypted the last time, and then the bytes 64..191 in the Keccak
state are replaced with the result. Then, the Keccak state is passed
through Keccak-f (the Keccak permutation) with b = 1600.
Then, the 2 low-order bits of the first byte of the state are used to
select a hash function: 0=BLAKE-256 [BLAKE], 1=Groestl-256 [GROESTL],
2=JH-256 [JH], and 3=Skein-256 [SKEIN]. The chosen hash function is
then applied to the Keccak state, and the resulting hash is the
output of CryptoNight.
The diagram below illustrates the result calculation:
+-------------------------------------------------------------+
| Final state |
+-------------+--------------+---------------+----------------+
| Bytes 0..31 | Bytes 32..63 | Bytes 64..191 | Bytes 192..199 |
+-------------+--------------+---------------+----------------+
| | | |
| +--------+ | |
| V | | |
|+-------------+ | | |
|| Round key 0 |-|---+---+ | |
|+-------------+ | | | | |
|| . | | | | | |
|| . | | | | | |
|| . | | | | | |
|+-------------+ | | | | |
+---+ || Round key 9 |-|-+-|-+ | V |
| | |+-------------+ | | | | | +-----+ |
| |-|----------------|-|-|-|-|->| XOR | |
| | | | | | | | +-----+ |
| S | | | | | | | | |
| | | | | | | | V |
| c | | | | | | +->+-----+ |
| | | | | | | | | |
| r | | | | | | | | |
| | | | | | | | AES | |
| a | | | | | | | | |
| | | | | | | | | |
| t | | | | | +--->+-----+ |
| | | | | | | |
| c | | | | | V |
| | | | | | +-----+ |
| h |-|----------------|-|-|----->| XOR | |
| | | | | | +-----+ |
| p | | | | | | |
| | | | | | . |
| a | | | | | . |
| | | | | | . |
| d | | | | | | |
| | | | | | V |
| | | | | | +-----+ |
| |-|----------------|-|-|----->| XOR | |
| | | | | | +-----+ |
+---+ | | | | | |
| | | | V |
| | | +----->+-----+ |
| | | | | |
| | | | | |
| | | | AES | |
| | | | | |
| | | | | |
| | +------->+-----+ |
| | | |
V V V V
+-------------+--------------+---------------+----------------+
| Bytes 0..31 | Bytes 32..63 | Bytes 64..191 | Bytes 192..199 |
+-------------+--------------+---------------+----------------+
| Modified state |
+-------------------------------------------------------------+
|
V
+----------+
| Keccak-f |
+----------+
| |
+-----------+ |
| |
V V
+-------------+ +-------------+
| Select hash |->| Chosen hash |
+-------------+ +-------------+
|
V
+--------------+
| Final result |
+--------------+
Figure 5: Result calculation diagram
Hash examples:
Empty string:
eb14e8a833fac6fe9a43b57b336789c46ffe93f2868452240720607b14387e11.
"This is a test":
a084f01d1437a09c6985401b60d43554ae105802c5f5d8a9b3253649c0be6605.
6. References
[AES] "Announcing the ADVANCED ENCRYPTION STANDARD", FIPS 197, 2001.
[BLAKE] Aumasson, J.-P., Henzen, L., Meier, W., and R. C.-W. Phan,
"SHA-3 proposal BLAKE", 2010.
[GROESTL] Gauravaram, P., Knudsen, L., Matusiewicz, K., Mendel, F.,
Rechberger, C., Schlaffer, M., and S. Thomsen, "Groestl - a SHA-3
candidate", 2011.
[JH] Wu, H., "The Hash Function JH", 2011.
[KECCAK] Bertoni, G., Daemen, J., Peeters, M., and G. Van Assche,
"The Keccak reference", 2011.
[SKEIN] Ferguson, N., Lucks, S., Schneier, B., Whiting, D., Bellare,
M., Kohno, T., Callas, J., and J. Walker, "The Skein Hash Function
Family", 2008.