-
Notifications
You must be signed in to change notification settings - Fork 22
/
Blake2b.java
2091 lines (1903 loc) · 64.6 KB
/
Blake2b.java
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
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/* !!! Doost !!! */
/*
A Java implementation of BLAKE2B cryptographic digest algorithm.
Joubin Mohammad Houshyar <[email protected]>
bushwick, nyc
02-14-2014
--
To the extent possible under law, the author(s) have dedicated all copyright
and related and neighboring rights to this software to the public domain
worldwide. This software is distributed without any warranty.
You should have received a copy of the CC0 Public Domain Dedication along with
this software. If not, see <http://creativecommons.org/publicdomain/zero/1.0/>.
*/
package ove.crypto.digest;
import java.io.PrintStream;
import java.io.Serializable;
import java.security.Key;
import java.security.spec.AlgorithmParameterSpec; // JCE not supported / anticipated ..
import java.util.Arrays;
import static ove.crypto.digest.Blake2b.Engine.Assert.*;
import static ove.crypto.digest.Blake2b.Engine.LittleEndian.*;
/** */
public interface Blake2b {
// ---------------------------------------------------------------------
// Specification
// ---------------------------------------------------------------------
public interface Spec {
/** pblock size of blake2b */
int param_bytes = 64;
/** pblock size of blake2b */
int block_bytes = 128;
/** maximum digest size */
int max_digest_bytes = 64;
/** maximum key sie */
int max_key_bytes = 64;
/** maximum salt size */
int max_salt_bytes = 16;
/** maximum personalization string size */
int max_personalization_bytes = 16;
/** length of h space vector array */
int state_space_len = 8;
/** max tree fanout value */
int max_tree_fantout = 0xFF;
/** max tree depth value */
int max_tree_depth = 0xFF;
/** max tree leaf length value.Note that this has uint32 semantics
and thus 0xFFFFFFFF is used as max value limit. */
int max_tree_leaf_length = 0xFFFFFFFF;
/** max node offset value. Note that this has uint64 semantics
and thus 0xFFFFFFFFFFFFFFFFL is used as max value limit. */
long max_node_offset = 0xFFFFFFFFFFFFFFFFL;
/** max tree inner length value */
int max_tree_inner_length = 0xFF;
/** initialization values map ref-Spec IV[i] -> slice iv[i*8:i*8+7] */
long[] IV = {
0x6a09e667f3bcc908L,
0xbb67ae8584caa73bL,
0x3c6ef372fe94f82bL,
0xa54ff53a5f1d36f1L,
0x510e527fade682d1L,
0x9b05688c2b3e6c1fL,
0x1f83d9abfb41bd6bL,
0x5be0cd19137e2179L
};
}
// ---------------------------------------------------------------------
// API
// ---------------------------------------------------------------------
// TODO add ByteBuffer variants
/**
* A serializable / JSON-izable object usable for pausing a hash-in-process
* which can then be resumed with the same Parameter the original digest
* was constructed with, and fed additional bytes to conclude the hash.
*/
public static final class ResumeHandle implements Serializable {
/** per spec */
public long[] h = new long [ 8 ];
/** per spec */
public long[] t = new long [ 2 ];
/** per spec */
public long[] f = new long [ 2 ];
/** per spec (tree) */
public boolean last_node = false;
/** pulled up 2b optimal */
public long[] m = new long [16];
/** pulled up 2b optimal */
public long[] v = new long [16];
/** compressor cache buffer */
public byte[] buffer;
/** compressor cache buffer offset/cached data length */
public int buflen;
/** digest length from init param - copied here on init */
public int outlen;
public int type;
/**
* Create a reconstituted Black2b digest from
*
* @param param
* @return
*/
public Blake2b resume(Param param) {
assert this.buffer != null && this.buffer.length == Spec.block_bytes;
assert this.h != null && this.h.length == 8
&& this.t != null && this.t.length == 2
&& this.f != null && this.f.length == 2
&& this.m != null && this.m.length == 16
&& this.v != null && this.v.length == 16 : "Data is corrupted";
assert this.outlen == param.getDigestLength() : "Not originally initialized from this param";
assert this.type == 1 || this.type == 2 : "Unknown type " + this.type;
Engine.State state = new Engine.State(outlen, this.type == 1);
System.arraycopy(this.h, 0, state.h, 0, state.h.length);
System.arraycopy(this.t, 0, state.t, 0, state.t.length);
System.arraycopy(this.f, 0, state.f, 0, state.f.length);
System.arraycopy(this.m, 0, m, 0, m.length);
System.arraycopy(this.v, 0, v, 0, v.length);
System.arraycopy(this.buffer, 0, state.buffer, 0, state.buffer.length);
state.buflen = buflen;
return type == 1 ? new Mac(param, state) : new Digest(param, state);
}
}
/** */
void update (byte[] input) ;
/** */
void update (byte input) ;
/** */
void update (byte[] input, int offset, int len) ;
/** */
byte[] digest () ;
/** */
byte[] digest (byte[] input) ;
/** */
void digest (byte[] output, int offset, int len) ;
/** */
void reset () ;
ResumeHandle state();
// ---------------------------------------------------------------------
// Blake2b Message Digest
// ---------------------------------------------------------------------
/** Generalized Blake2b digest. */
public static class Digest extends Engine implements Blake2b {
private Digest (final Param p) { super (p); }
private Digest () { super (); }
private Digest(Param p, State state) {
super(state, p);
}
public static Digest newInstance () {
return new Digest ();
}
public static Digest newInstance (final int digestLength) {
return new Digest (new Param().setDigestLength(digestLength));
}
public static Digest newInstance (Param p) {
return new Digest (p);
}
public static Digest newInstance (Param p, State state) {
return new Digest(p, state);
}
}
// ---------------------------------------------------------------------
// Blake2b Message Authentication Code
// ---------------------------------------------------------------------
/** Message Authentication Code (MAC) digest. */
public static class Mac extends Engine implements Blake2b {
private Mac (final Param p, State state) { super (state, p); }
private Mac (final Param p) { super (p); }
private Mac () { super (); }
/** Blake2b.MAC 512 - using default Blake2b.Spec settings with given key */
public static Mac newInstance (final byte[] key) {
return new Mac (new Param().setKey(key));
}
/** Blake2b.MAC - using default Blake2b.Spec settings with given key, with given digest length */
public static Mac newInstance (final byte[] key, final int digestLength) {
return new Mac (new Param().setKey(key).setDigestLength(digestLength));
}
/** Blake2b.MAC - using default Blake2b.Spec settings with given java.security.Key, with given digest length */
public static Mac newInstance (final Key key, final int digestLength) {
return new Mac (new Param().setKey(key).setDigestLength(digestLength));
}
/** Blake2b.MAC - using the specified Parameters.
* @param p asserted valid configured Param with key */
public static Mac newInstance (Param p) {
assert p != null : "Param (p) is null";
assert p.hasKey() : "Param (p) not configured with a key";
return new Mac (p);
}
}
// ---------------------------------------------------------------------
// Blake2b Incremental Message Digest (Tree)
// ---------------------------------------------------------------------
/**
* Note that Tree is just a convenience class; incremental hash (tree)
* can be done directly with the Digest class.
* <br>
* Further node, that tree does NOT accumulate the leaf hashes --
* you need to do that
*/
public static class Tree {
final int depth;
final int fanout;
final int leaf_length;
final int inner_length;
final int digest_length;
/**
*
* @param fanout
* @param depth
* @param leaf_length size of data input for leaf nodes.
* @param inner_length note this is used also as digest-length for non-root nodes.
* @param digest_length final hash out digest-length for the tree
*/
public Tree (
final int depth,
final int fanout,
final int leaf_length,
final int inner_length,
final int digest_length
) {
this.fanout = fanout;
this.depth = depth;
this.leaf_length = leaf_length;
this.inner_length = inner_length;
this.digest_length = digest_length;
}
private Param treeParam() {
return new Param().
setDepth(depth).setFanout(fanout).setLeafLength(leaf_length).setInnerLength(inner_length);
}
/** returns the Digest for tree node @ (depth, offset) */
public final Digest getNode (final int depth, final int offset) {
final Param nodeParam = treeParam().setNodeDepth(depth).setNodeOffset(offset).setDigestLength(inner_length);
return Digest.newInstance(nodeParam);
}
/** returns the Digest for root node */
public final Digest getRoot () {
final int depth = this.depth - 1;
final Param rootParam = treeParam().setNodeDepth(depth).setNodeOffset(0L).setDigestLength(digest_length);
return Digest.newInstance(rootParam);
}
}
// ---------------------------------------------------------------------
// Engine
// ---------------------------------------------------------------------
static class Engine implements Blake2b {
// ---------------------------------------------------------------------
// Blake2b State(+) per reference implementation
// ---------------------------------------------------------------------
// REVU: address last_node TODO part of the Tree/incremental
static final class State {
/** per spec */
private final long[] h = new long [ 8 ];
/** per spec */
private final long[] t = new long [ 2 ];
/** per spec */
private final long[] f = new long [ 2 ];
/** per spec (tree) */
private boolean last_node = false;
/** pulled up 2b optimal */
private final long[] m = new long [16];
/** pulled up 2b optimal */
private final long[] v = new long [16];
/** compressor cache buffer */
private final byte[] buffer;
/** compressor cache buffer offset/cached data length */
private int buflen;
/** digest length from init param - copied here on init */
private final int outlen;
private final int digestType;
State(int digestLength, boolean isMac) {
this.buffer = new byte [ Spec.block_bytes ];
this.outlen = digestLength;
// do not use zero, so we can detect serialization errors
this.digestType = isMac ? 1 : 2;
}
public ResumeHandle toResumableForm() {
ResumeHandle state = new ResumeHandle();
state.h = h;
state.t = t;
state.f = f;
state.last_node = last_node;
state.m = m;
state.v = v;
state.buffer = buffer;
state.buflen = buflen;
state.outlen = outlen;
state.type = digestType;
return state;
}
}
private State state;
/** configuration params */
private final Param param;
/** read only */
private static byte[] zeropad = new byte [ Spec.block_bytes ];
/** a little bit of semantics */
interface flag {
int last_block = 0;
int last_node = 1;
}
/** to support update(byte) */
private final byte[] oneByte = new byte[1];
// ---------------------------------------------------------------------
// Ctor & Initialization
// ---------------------------------------------------------------------
/** Basic use constructor pending (TODO) JCA/JCE compliance */
Engine () {
this( new Param() );
}
Engine(State state, Param param) {
assert state != null : "state is null";
assert param != null : "param is null";
this.state = state;
this.param = param;
}
/** User provided Param for custom configurations */
Engine (final Param param) {
assert param != null : "param is null";
this.param = param;
state = new State(param.getDigestLength(), this instanceof Mac);
if ( param.getDepth() > Param.Default.depth ) {
final int ndepth = param.getNodeDepth();
final long nxoff = param.getNodeOffset();
if (ndepth == param.getDepth() - 1) {
state.last_node = true;
assert nxoff == 0 : "root must have offset of zero";
} else if ( nxoff == param.getFanout() - 1) {
this.state.last_node = true;
}
}
initialize();
}
public ResumeHandle state() {
return state.toResumableForm();
}
private void initialize () {
// state vector h - copy values to address reset() requests
System.arraycopy( param.initialized_H(), 0, this.state.h, 0, Spec.state_space_len);
// if we have a key update initial block
// Note param has zero padded key_bytes to Spec.max_key_bytes
if(param.hasKey){
this.update (param.key_bytes, 0, Spec.block_bytes);
}
}
public static void main(String... args) {
Blake2b mac = Blake2b.Mac.newInstance("LOVE".getBytes());
final byte[] hash = mac.digest("Salaam!".getBytes());
// Debug.dumpBuffer(System.out, "-- mac hash --", hash);
}
// ---------------------------------------------------------------------
// interface: Blake2b API
// ---------------------------------------------------------------------
/** {@inheritDoc} */
@Override final public void reset () {
// reset cache
this.state.buflen = 0;
for(int i=0; i < state.buffer.length; i++){
state.buffer[ i ] = (byte) 0;
}
// reset flags
this.state.f[ 0 ] = 0L;
this.state.f[ 1 ] = 0L;
// reset counters
this.state.t[ 0 ] = 0L;
this.state.t[ 1 ] = 0L;
// reset state vector
// NOTE: keep as last stmt as init calls update0 for MACs.
initialize();
}
/** {@inheritDoc} */
@Override final public void update (final byte[] b, int off, int len) {
if (b == null) {
throw new IllegalArgumentException("input buffer (b) is null");
}
/* zero or more calls to compress */
final long[] t = state.t;
final byte[] buffer = state.buffer;
while (len > 0) {
if ( state.buflen == 0) {
/* try compressing direct from input ? */
while ( len > Spec.block_bytes ) {
t[0] += Spec.block_bytes;
t[1] += (t[0] < 0 && state.buflen > -t[0]) ? 1 : 0;
compress( b, off);
len -= Spec.block_bytes;
off += Spec.block_bytes;
}
} else if ( state.buflen == Spec.block_bytes ) {
/* flush */
t[0] += Spec.block_bytes;
t[1] += t[0] == 0 ? 1 : 0;
compress( buffer, 0 );
state.buflen = 0;
continue;
}
// "are we there yet?"
if( len == 0 ) return;
final int cap = Spec.block_bytes - state.buflen;
final int fill = len > cap ? cap : len;
System.arraycopy( b, off, buffer, state.buflen, fill );
state.buflen += fill;
len -= fill;
off += fill;
}
}
/** {@inheritDoc} */
@Override final public void update (byte b) {
oneByte[0] = b;
update (oneByte, 0, 1);
}
/** {@inheritDoc} */
@Override final public void update(byte[] input) {
update (input, 0, input.length);
}
/** {@inheritDoc} */
@Override final public void digest(byte[] output, int off, int len) {
// zero pad last block; set last block flags; and compress
System.arraycopy( zeropad, 0, state.buffer, state.buflen, Spec.block_bytes - state.buflen);
if(state.buflen > 0) {
this.state.t[0] += state.buflen;
this.state.t[1] += this.state.t[0] == 0 ? 1 : 0;
}
this.state.f[ flag.last_block ] = 0xFFFFFFFFFFFFFFFFL;
this.state.f[ flag.last_node ] = this.state.last_node ? 0xFFFFFFFFFFFFFFFFL : 0x0L;
// compres and write final out (truncated to len) to output
compress( state.buffer, 0 );
hashout( output, off, len );
reset();
}
/** {@inheritDoc} */
@Override final public byte[] digest () throws IllegalArgumentException {
final byte[] out = new byte [state.outlen];
digest ( out, 0, state.outlen );
return out;
}
/** {@inheritDoc} */
@Override final public byte[] digest (byte[] input) {
update(input, 0, input.length);
return digest();
}
// ---------------------------------------------------------------------
// Internal Ops
// ---------------------------------------------------------------------
/**
* write out the digest output from the 'h' registers.
* truncate full output if necessary.
*/
private void hashout (final byte[] out, final int offset, final int hashlen) {
// write max number of whole longs
final int lcnt = hashlen >>> 3;
long v = 0;
int i = offset;
final long[] h = state.h;
for (int w = 0; w < lcnt; w++) {
v = h [ w ];
out [ i ] = (byte) v; v >>>= 8;
out [ i+1 ] = (byte) v; v >>>= 8;
out [ i+2 ] = (byte) v; v >>>= 8;
out [ i+3 ] = (byte) v; v >>>= 8;
out [ i+4 ] = (byte) v; v >>>= 8;
out [ i+5 ] = (byte) v; v >>>= 8;
out [ i+6 ] = (byte) v; v >>>= 8;
out [ i+7 ] = (byte) v;
i+=8;
}
// basta?
if( hashlen == Spec.max_digest_bytes) return;
// write the remaining bytes of a partial long value
v = h [ lcnt ];
i = lcnt << 3;
while( i < hashlen ) {
out [ offset + i ] = (byte) v; v >>>= 8; ++i;
}
}
////////////////////////////////////////////////////////////////////////
/// Compression Kernel /////////////////////////////////////////// BEGIN
////////////////////////////////////////////////////////////////////////
/** compress Spec.block_bytes data from b, from offset */
private void compress (final byte[] b, final int offset) {
// set m registers
final long[] m = state.m;
m[ 0] = LittleEndian.readLong(b, offset);
m[ 1] = LittleEndian.readLong(b, offset + 8);
m[ 2] = LittleEndian.readLong(b, offset + 16);
m[ 3] = LittleEndian.readLong(b, offset + 24);
m[ 4] = LittleEndian.readLong(b, offset + 32);
m[ 5] = LittleEndian.readLong(b, offset + 40);
m[ 6] = LittleEndian.readLong(b, offset + 48);
m[ 7] = LittleEndian.readLong(b, offset + 56);
m[ 8] = LittleEndian.readLong(b, offset + 64);
m[ 9] = LittleEndian.readLong(b, offset + 72);
m[10] = LittleEndian.readLong(b, offset + 80);
m[11] = LittleEndian.readLong(b, offset + 88);
m[12] = LittleEndian.readLong(b, offset + 96);
m[13] = LittleEndian.readLong(b, offset + 104);
m[14] = LittleEndian.readLong(b, offset + 112);
m[15] = LittleEndian.readLong(b, offset + 120);
// set v registers
final long[] v = state.v;
final long[] h = state.h;
final long[] t = state.t;
final long[] f = state.f;
v[ 0] = h[0];
v[ 1] = h[1];
v[ 2] = h[2];
v[ 3] = h[3];
v[ 4] = h[4];
v[ 5] = h[5];
v[ 6] = h[6];
v[ 7] = h[7];
v[ 8] = 0x6a09e667f3bcc908L;
v[ 9] = 0xbb67ae8584caa73bL;
v[10] = 0x3c6ef372fe94f82bL;
v[11] = 0xa54ff53a5f1d36f1L;
v[12] = t [0] ^ 0x510e527fade682d1L;
v[13] = t [1] ^ 0x9b05688c2b3e6c1fL;
v[14] = f [0] ^ 0x1f83d9abfb41bd6bL;
v[15] = f [1] ^ 0x5be0cd19137e2179L;
// do the rounds
round_0(v, m);
round_1(v, m);
round_2(v, m);
round_3(v, m);
round_4(v, m);
round_5(v, m);
round_6(v, m);
round_7(v, m);
round_8(v, m);
round_9(v, m);
round_0(v, m); // round 10 is identical to round 0
round_1(v, m); // round 11 is identical to round 1
// Update state vector h
h[0] ^= v[0] ^ v[8];
h[1] ^= v[1] ^ v[9];
h[2] ^= v[2] ^ v[10];
h[3] ^= v[3] ^ v[11];
h[4] ^= v[4] ^ v[12];
h[5] ^= v[5] ^ v[13];
h[6] ^= v[6] ^ v[14];
h[7] ^= v[7] ^ v[15];
/* kaamil */
}
private void round_0(final long[] v, final long[] m) {
v[ 0] = v[ 0] + v[ 4] + m[0];
v[12] ^= v[ 0];
v[12] = ( v[12] << 32 ) | ( v[12] >>> 32 );
v[ 8] = v[ 8] + v[12];
v[ 4] ^= v[ 8];
v[ 4] = ( v[ 4] >>> 24 ) | ( v[ 4] << 40 );
v[ 0] = v[ 0] + v[ 4] + m [1];
v[12] ^= v[ 0];
v[12] = ( v[12] >>> 16 ) | ( v[12] << 48 );
v[ 8] = v[ 8] + v[12];
v[ 4] ^= v[ 8];
v[ 4] = ( v[ 4] << 1 ) | ( v[ 4] >>> 63 );
v[ 1] = v[ 1] + v[ 5] + m[2];
v[13] ^= v[ 1];
v[13] = ( v[13] << 32 ) | ( v[13] >>> 32 );
v[ 9] = v[ 9] + v[13];
v[ 5] ^= v[ 9];
v[ 5] = ( v[ 5] >>> 24 ) | ( v[ 5] << 40 );
v[ 1] = v[ 1] + v[ 5] + m[3];
v[13] ^= v[ 1];
v[13] = ( v[13] >>> 16 ) | ( v[13] << 48 );
v[ 9] = v[ 9] + v[13];
v[ 5] ^= v[ 9];
v[ 5] = ( v[ 5] << 1 ) | ( v[ 5] >>> 63 );
v[ 2] = v[ 2] + v[ 6] + m[4];
v[14] ^= v[ 2];
v[14] = ( v[14] << 32 ) | ( v[14] >>> 32 );
v[10] = v[10] + v[14];
v[ 6] ^= v[10];
v[ 6] = ( v[ 6] >>> 24 ) | ( v[ 6] << 40 );
v[ 2] = v[ 2] + v[ 6] + m[5];
v[14] ^= v[ 2];
v[14] = ( v[14] >>> 16 ) | ( v[14] << 48 );
v[10] = v[10] + v[14];
v[ 6] ^= v[10];
v[ 6] = ( v[ 6] << 1 ) | ( v[ 6] >>> 63 );
v[ 3] = v[ 3] + v[ 7] + m[6];
v[15] ^= v[ 3];
v[15] = ( v[15] << 32 ) | ( v[15] >>> 32 );
v[11] = v[11] + v[15];
v[ 7] ^= v[11];
v[ 7] = ( v[ 7] >>> 24 ) | ( v[ 7] << 40 );
v[ 3] = v[ 3] + v[ 7] + m[7];
v[15] ^= v[ 3];
v[15] = ( v[15] >>> 16 ) | ( v[15] << 48 );
v[11] = v[11] + v[15];
v[ 7] ^= v[11];
v[ 7] = ( v[ 7] << 1 ) | ( v[ 7] >>> 63 );
v[ 0] = v[ 0] + v[ 5] + m[8];
v[15] ^= v[ 0];
v[15] = ( v[15] << 32 ) | ( v[15] >>> 32 );
v[10] = v[10] + v[15];
v[ 5] ^= v[10];
v[ 5] = ( v[ 5] >>> 24 ) | ( v[ 5] << 40 );
v[ 0] = v[ 0] + v[ 5] + m[9];
v[15] ^= v[ 0];
v[15] = ( v[15] >>> 16 ) | ( v[15] << 48 );
v[10] = v[10] + v[15];
v[ 5] ^= v[10];
v[ 5] = ( v[ 5] << 1 ) | ( v[ 5] >>> 63 );
v[ 1] = v[ 1] + v[ 6] + m[10];
v[12] ^= v[ 1];
v[12] = ( v[12] << 32 ) | ( v[12] >>> 32 );
v[11] = v[11] + v[12];
v[ 6] ^= v[11];
v[ 6] = ( v[ 6] >>> 24 ) | ( v[ 6] << 40 );
v[ 1] = v[ 1] + v[ 6] + + m[11];
v[12] ^= v[ 1];
v[12] = ( v[12] >>> 16 ) | ( v[12] << 48 );
v[11] = v[11] + v[12];
v[ 6] ^= v[11];
v[ 6] = ( v[ 6] << 1 ) | ( v[ 6] >>> 63 );
v[ 2] = v[ 2] + v[ 7] + m[12];
v[13] ^= v[ 2];
v[13] = ( v[13] << 32 ) | ( v[13] >>> 32 );
v[ 8] = v[ 8] + v[13];
v[ 7] ^= v[ 8];
v[ 7] = ( v[ 7] >>> 24 ) | ( v[ 7] << 40 );
v[ 2] = v[ 2] + v[ 7] + m[13];
v[13] ^= v[ 2];
v[13] = ( v[13] >>> 16 ) | ( v[13] << 48 );
v[ 8] = v[ 8] + v[13];
v[ 7] ^= v[ 8];
v[ 7] = ( v[ 7] << 1 ) | ( v[ 7] >>> 63 );
v[ 3] = v[ 3] + v[ 4] + m[14];
v[14] ^= v[ 3];
v[14] = ( v[14] << 32 ) | ( v[14] >>> 32 );
v[ 9] = v[ 9] + v[14];
v[ 4] ^= v[ 9];
v[ 4] = ( v[ 4] >>> 24 ) | ( v[ 4] << 40 );
v[ 3] = v[ 3] + v[ 4] + m[15];
v[14] ^= v[ 3];
v[14] = ( v[14] >>> 16 ) | ( v[14] << 48 );
v[ 9] = v[ 9] + v[14];
v[ 4] ^= v[ 9];
v[ 4] = ( v[ 4] << 1 ) | ( v[ 4] >>> 63 );
}
private void round_1(final long[] v, final long[] m) {
v[ 0] = v[ 0] + v[ 4] + m[14];
v[12] ^= v[ 0];
v[12] = ( v[12] << 32 ) | ( v[12] >>> 32 );
v[ 8] = v[ 8] + v[12];
v[ 4] ^= v[ 8];
v[ 4] = ( v[ 4] >>> 24 ) | ( v[ 4] << 40 );
v[ 0] = v[ 0] + v[ 4] + m [10];
v[12] ^= v[ 0];
v[12] = ( v[12] >>> 16 ) | ( v[12] << 48 );
v[ 8] = v[ 8] + v[12];
v[ 4] ^= v[ 8];
v[ 4] = ( v[ 4] << 1 ) | ( v[ 4] >>> 63 );
v[ 1] = v[ 1] + v[ 5] + m[4];
v[13] ^= v[ 1];
v[13] = ( v[13] << 32 ) | ( v[13] >>> 32 );
v[ 9] = v[ 9] + v[13];
v[ 5] ^= v[ 9];
v[ 5] = ( v[ 5] >>> 24 ) | ( v[ 5] << 40 );
v[ 1] = v[ 1] + v[ 5] + m[8];
v[13] ^= v[ 1];
v[13] = ( v[13] >>> 16 ) | ( v[13] << 48 );
v[ 9] = v[ 9] + v[13];
v[ 5] ^= v[ 9];
v[ 5] = ( v[ 5] << 1 ) | ( v[ 5] >>> 63 );
v[ 2] = v[ 2] + v[ 6] + m[9];
v[14] ^= v[ 2];
v[14] = ( v[14] << 32 ) | ( v[14] >>> 32 );
v[10] = v[10] + v[14];
v[ 6] ^= v[10];
v[ 6] = ( v[ 6] >>> 24 ) | ( v[ 6] << 40 );
v[ 2] = v[ 2] + v[ 6] + m[15];
v[14] ^= v[ 2];
v[14] = ( v[14] >>> 16 ) | ( v[14] << 48 );
v[10] = v[10] + v[14];
v[ 6] ^= v[10];
v[ 6] = ( v[ 6] << 1 ) | ( v[ 6] >>> 63 );
v[ 3] = v[ 3] + v[ 7] + m[13];
v[15] ^= v[ 3];
v[15] = ( v[15] << 32 ) | ( v[15] >>> 32 );
v[11] = v[11] + v[15];
v[ 7] ^= v[11];
v[ 7] = ( v[ 7] >>> 24 ) | ( v[ 7] << 40 );
v[ 3] = v[ 3] + v[ 7] + m[6];
v[15] ^= v[ 3];
v[15] = ( v[15] >>> 16 ) | ( v[15] << 48 );
v[11] = v[11] + v[15];
v[ 7] ^= v[11];
v[ 7] = ( v[ 7] << 1 ) | ( v[ 7] >>> 63 );
v[ 0] = v[ 0] + v[ 5] + m[1];
v[15] ^= v[ 0];
v[15] = ( v[15] << 32 ) | ( v[15] >>> 32 );
v[10] = v[10] + v[15];
v[ 5] ^= v[10];
v[ 5] = ( v[ 5] >>> 24 ) | ( v[ 5] << 40 );
v[ 0] = v[ 0] + v[ 5] + m[12];
v[15] ^= v[ 0];
v[15] = ( v[15] >>> 16 ) | ( v[15] << 48 );
v[10] = v[10] + v[15];
v[ 5] ^= v[10];
v[ 5] = ( v[ 5] << 1 ) | ( v[ 5] >>> 63 );
v[ 1] = v[ 1] + v[ 6] + m[0];
v[12] ^= v[ 1];
v[12] = ( v[12] << 32 ) | ( v[12] >>> 32 );
v[11] = v[11] + v[12];
v[ 6] ^= v[11];
v[ 6] = ( v[ 6] >>> 24 ) | ( v[ 6] << 40 );
v[ 1] = v[ 1] + v[ 6] + + m[2];
v[12] ^= v[ 1];
v[12] = ( v[12] >>> 16 ) | ( v[12] << 48 );
v[11] = v[11] + v[12];
v[ 6] ^= v[11];
v[ 6] = ( v[ 6] << 1 ) | ( v[ 6] >>> 63 );
v[ 2] = v[ 2] + v[ 7] + m[11];
v[13] ^= v[ 2];
v[13] = ( v[13] << 32 ) | ( v[13] >>> 32 );
v[ 8] = v[ 8] + v[13];
v[ 7] ^= v[ 8];
v[ 7] = ( v[ 7] >>> 24 ) | ( v[ 7] << 40 );
v[ 2] = v[ 2] + v[ 7] + m[7];
v[13] ^= v[ 2];
v[13] = ( v[13] >>> 16 ) | ( v[13] << 48 );
v[ 8] = v[ 8] + v[13];
v[ 7] ^= v[ 8];
v[ 7] = ( v[ 7] << 1 ) | ( v[ 7] >>> 63 );
v[ 3] = v[ 3] + v[ 4] + m[5];
v[14] ^= v[ 3];
v[14] = ( v[14] << 32 ) | ( v[14] >>> 32 );
v[ 9] = v[ 9] + v[14];
v[ 4] ^= v[ 9];
v[ 4] = ( v[ 4] >>> 24 ) | ( v[ 4] << 40 );
v[ 3] = v[ 3] + v[ 4] + m[3];
v[14] ^= v[ 3];
v[14] = ( v[14] >>> 16 ) | ( v[14] << 48 );
v[ 9] = v[ 9] + v[14];
v[ 4] ^= v[ 9];
v[ 4] = ( v[ 4] << 1 ) | ( v[ 4] >>> 63 );
}
private void round_2(final long[] v, final long[] m) {
v[ 0] = v[ 0] + v[ 4] + m[11];
v[12] ^= v[ 0];
v[12] = ( v[12] << 32 ) | ( v[12] >>> 32 );
v[ 8] = v[ 8] + v[12];
v[ 4] ^= v[ 8];
v[ 4] = ( v[ 4] >>> 24 ) | ( v[ 4] << 40 );
v[ 0] = v[ 0] + v[ 4] + m [8];
v[12] ^= v[ 0];
v[12] = ( v[12] >>> 16 ) | ( v[12] << 48 );
v[ 8] = v[ 8] + v[12];
v[ 4] ^= v[ 8];
v[ 4] = ( v[ 4] << 1 ) | ( v[ 4] >>> 63 );
v[ 1] = v[ 1] + v[ 5] + m[12];
v[13] ^= v[ 1];
v[13] = ( v[13] << 32 ) | ( v[13] >>> 32 );
v[ 9] = v[ 9] + v[13];
v[ 5] ^= v[ 9];
v[ 5] = ( v[ 5] >>> 24 ) | ( v[ 5] << 40 );
v[ 1] = v[ 1] + v[ 5] + m[0];
v[13] ^= v[ 1];
v[13] = ( v[13] >>> 16 ) | ( v[13] << 48 );
v[ 9] = v[ 9] + v[13];
v[ 5] ^= v[ 9];
v[ 5] = ( v[ 5] << 1 ) | ( v[ 5] >>> 63 );
v[ 2] = v[ 2] + v[ 6] + m[5];
v[14] ^= v[ 2];
v[14] = ( v[14] << 32 ) | ( v[14] >>> 32 );
v[10] = v[10] + v[14];
v[ 6] ^= v[10];
v[ 6] = ( v[ 6] >>> 24 ) | ( v[ 6] << 40 );
v[ 2] = v[ 2] + v[ 6] + m[2];
v[14] ^= v[ 2];
v[14] = ( v[14] >>> 16 ) | ( v[14] << 48 );
v[10] = v[10] + v[14];
v[ 6] ^= v[10];
v[ 6] = ( v[ 6] << 1 ) | ( v[ 6] >>> 63 );
v[ 3] = v[ 3] + v[ 7] + m[15];
v[15] ^= v[ 3];
v[15] = ( v[15] << 32 ) | ( v[15] >>> 32 );
v[11] = v[11] + v[15];
v[ 7] ^= v[11];
v[ 7] = ( v[ 7] >>> 24 ) | ( v[ 7] << 40 );
v[ 3] = v[ 3] + v[ 7] + m[13];
v[15] ^= v[ 3];
v[15] = ( v[15] >>> 16 ) | ( v[15] << 48 );
v[11] = v[11] + v[15];
v[ 7] ^= v[11];
v[ 7] = ( v[ 7] << 1 ) | ( v[ 7] >>> 63 );
v[ 0] = v[ 0] + v[ 5] + m[10];
v[15] ^= v[ 0];
v[15] = ( v[15] << 32 ) | ( v[15] >>> 32 );
v[10] = v[10] + v[15];
v[ 5] ^= v[10];
v[ 5] = ( v[ 5] >>> 24 ) | ( v[ 5] << 40 );
v[ 0] = v[ 0] + v[ 5] + m[14];
v[15] ^= v[ 0];
v[15] = ( v[15] >>> 16 ) | ( v[15] << 48 );
v[10] = v[10] + v[15];
v[ 5] ^= v[10];
v[ 5] = ( v[ 5] << 1 ) | ( v[ 5] >>> 63 );
v[ 1] = v[ 1] + v[ 6] + m[3];
v[12] ^= v[ 1];
v[12] = ( v[12] << 32 ) | ( v[12] >>> 32 );
v[11] = v[11] + v[12];
v[ 6] ^= v[11];
v[ 6] = ( v[ 6] >>> 24 ) | ( v[ 6] << 40 );
v[ 1] = v[ 1] + v[ 6] + + m[6];
v[12] ^= v[ 1];
v[12] = ( v[12] >>> 16 ) | ( v[12] << 48 );
v[11] = v[11] + v[12];
v[ 6] ^= v[11];
v[ 6] = ( v[ 6] << 1 ) | ( v[ 6] >>> 63 );
v[ 2] = v[ 2] + v[ 7] + m[7];
v[13] ^= v[ 2];
v[13] = ( v[13] << 32 ) | ( v[13] >>> 32 );
v[ 8] = v[ 8] + v[13];
v[ 7] ^= v[ 8];
v[ 7] = ( v[ 7] >>> 24 ) | ( v[ 7] << 40 );
v[ 2] = v[ 2] + v[ 7] + m[1];
v[13] ^= v[ 2];
v[13] = ( v[13] >>> 16 ) | ( v[13] << 48 );
v[ 8] = v[ 8] + v[13];
v[ 7] ^= v[ 8];
v[ 7] = ( v[ 7] << 1 ) | ( v[ 7] >>> 63 );
v[ 3] = v[ 3] + v[ 4] + m[9];
v[14] ^= v[ 3];
v[14] = ( v[14] << 32 ) | ( v[14] >>> 32 );
v[ 9] = v[ 9] + v[14];
v[ 4] ^= v[ 9];
v[ 4] = ( v[ 4] >>> 24 ) | ( v[ 4] << 40 );
v[ 3] = v[ 3] + v[ 4] + m[4];
v[14] ^= v[ 3];
v[14] = ( v[14] >>> 16 ) | ( v[14] << 48 );
v[ 9] = v[ 9] + v[14];
v[ 4] ^= v[ 9];
v[ 4] = ( v[ 4] << 1 ) | ( v[ 4] >>> 63 );
}
private void round_3(final long[] v, final long[] m) {
v[ 0] = v[ 0] + v[ 4] + m[7];
v[12] ^= v[ 0];
v[12] = ( v[12] << 32 ) | ( v[12] >>> 32 );
v[ 8] = v[ 8] + v[12];
v[ 4] ^= v[ 8];
v[ 4] = ( v[ 4] >>> 24 ) | ( v[ 4] << 40 );
v[ 0] = v[ 0] + v[ 4] + m [9];
v[12] ^= v[ 0];
v[12] = ( v[12] >>> 16 ) | ( v[12] << 48 );
v[ 8] = v[ 8] + v[12];
v[ 4] ^= v[ 8];
v[ 4] = ( v[ 4] << 1 ) | ( v[ 4] >>> 63 );
v[ 1] = v[ 1] + v[ 5] + m[3];
v[13] ^= v[ 1];
v[13] = ( v[13] << 32 ) | ( v[13] >>> 32 );
v[ 9] = v[ 9] + v[13];
v[ 5] ^= v[ 9];
v[ 5] = ( v[ 5] >>> 24 ) | ( v[ 5] << 40 );
v[ 1] = v[ 1] + v[ 5] + m[1];
v[13] ^= v[ 1];
v[13] = ( v[13] >>> 16 ) | ( v[13] << 48 );
v[ 9] = v[ 9] + v[13];
v[ 5] ^= v[ 9];
v[ 5] = ( v[ 5] << 1 ) | ( v[ 5] >>> 63 );
v[ 2] = v[ 2] + v[ 6] + m[13];
v[14] ^= v[ 2];
v[14] = ( v[14] << 32 ) | ( v[14] >>> 32 );
v[10] = v[10] + v[14];
v[ 6] ^= v[10];
v[ 6] = ( v[ 6] >>> 24 ) | ( v[ 6] << 40 );
v[ 2] = v[ 2] + v[ 6] + m[12];
v[14] ^= v[ 2];
v[14] = ( v[14] >>> 16 ) | ( v[14] << 48 );
v[10] = v[10] + v[14];
v[ 6] ^= v[10];
v[ 6] = ( v[ 6] << 1 ) | ( v[ 6] >>> 63 );
v[ 3] = v[ 3] + v[ 7] + m[11];
v[15] ^= v[ 3];
v[15] = ( v[15] << 32 ) | ( v[15] >>> 32 );
v[11] = v[11] + v[15];
v[ 7] ^= v[11];
v[ 7] = ( v[ 7] >>> 24 ) | ( v[ 7] << 40 );
v[ 3] = v[ 3] + v[ 7] + m[14];
v[15] ^= v[ 3];
v[15] = ( v[15] >>> 16 ) | ( v[15] << 48 );
v[11] = v[11] + v[15];
v[ 7] ^= v[11];
v[ 7] = ( v[ 7] << 1 ) | ( v[ 7] >>> 63 );
v[ 0] = v[ 0] + v[ 5] + m[2];