QuickMythril
/
Brooklyn
forked from Qortal/Brooklyn
1
0
Fork 0
Code Issues Pull Requests Projects Releases 1 Wiki Activity
QortalOS Brooklyn for Raspberry Pi 4
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.
381 Commits
1 Branch
23 Tags
720 MiB
 
 
 
 
 
 
Branch: main
Branches Tags
${ item.name }
Create tag ${ searchTerm }
Create branch ${ searchTerm }
from 'main'
${ noResults }
Brooklyn/crypto/SPH-java/GroestlSmallCore.java

657 lines
21 KiB
Raw Permalink Blame History

// $Id: GroestlSmallCore.java 256 2011-07-15 19:07:16Z tp $
package fr.cryptohash;
/**
* This class implements Groestl-224 and Groestl-256.
*
* <pre>
* ==========================(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)=============================
* </pre>
*
* @version $Revision: 256 $
* @author Thomas Pornin &lt;[email protected]&gt;
*/
abstract class GroestlSmallCore extends DigestEngine {
private long[] H, G, M;
/**
* Create the object.
*/
GroestlSmallCore()
{
}
private static final long[] T0 = {
0xc632f4a5f497a5c6L, 0xf86f978497eb84f8L,
0xee5eb099b0c799eeL, 0xf67a8c8d8cf78df6L,
0xffe8170d17e50dffL, 0xd60adcbddcb7bdd6L,
0xde16c8b1c8a7b1deL, 0x916dfc54fc395491L,
0x6090f050f0c05060L, 0x0207050305040302L,
0xce2ee0a9e087a9ceL, 0x56d1877d87ac7d56L,
0xe7cc2b192bd519e7L, 0xb513a662a67162b5L,
0x4d7c31e6319ae64dL, 0xec59b59ab5c39aecL,
0x8f40cf45cf05458fL, 0x1fa3bc9dbc3e9d1fL,
0x8949c040c0094089L, 0xfa68928792ef87faL,
0xefd03f153fc515efL, 0xb29426eb267febb2L,
0x8ece40c94007c98eL, 0xfbe61d0b1ded0bfbL,
0x416e2fec2f82ec41L, 0xb31aa967a97d67b3L,
0x5f431cfd1cbefd5fL, 0x456025ea258aea45L,
0x23f9dabfda46bf23L, 0x535102f702a6f753L,
0xe445a196a1d396e4L, 0x9b76ed5bed2d5b9bL,
0x75285dc25deac275L, 0xe1c5241c24d91ce1L,
0x3dd4e9aee97aae3dL, 0x4cf2be6abe986a4cL,
0x6c82ee5aeed85a6cL, 0x7ebdc341c3fc417eL,
0xf5f3060206f102f5L, 0x8352d14fd11d4f83L,
0x688ce45ce4d05c68L, 0x515607f407a2f451L,
0xd18d5c345cb934d1L, 0xf9e1180818e908f9L,
0xe24cae93aedf93e2L, 0xab3e9573954d73abL,
0x6297f553f5c45362L, 0x2a6b413f41543f2aL,
0x081c140c14100c08L, 0x9563f652f6315295L,
0x46e9af65af8c6546L, 0x9d7fe25ee2215e9dL,
0x3048782878602830L, 0x37cff8a1f86ea137L,
0x0a1b110f11140f0aL, 0x2febc4b5c45eb52fL,
0x0e151b091b1c090eL, 0x247e5a365a483624L,
0x1badb69bb6369b1bL, 0xdf98473d47a53ddfL,
0xcda76a266a8126cdL, 0x4ef5bb69bb9c694eL,
0x7f334ccd4cfecd7fL, 0xea50ba9fbacf9feaL,
0x123f2d1b2d241b12L, 0x1da4b99eb93a9e1dL,
0x58c49c749cb07458L, 0x3446722e72682e34L,
0x3641772d776c2d36L, 0xdc11cdb2cda3b2dcL,
0xb49d29ee2973eeb4L, 0x5b4d16fb16b6fb5bL,
0xa4a501f60153f6a4L, 0x76a1d74dd7ec4d76L,
0xb714a361a37561b7L, 0x7d3449ce49face7dL,
0x52df8d7b8da47b52L, 0xdd9f423e42a13eddL,
0x5ecd937193bc715eL, 0x13b1a297a2269713L,
0xa6a204f50457f5a6L, 0xb901b868b86968b9L,
0x0000000000000000L, 0xc1b5742c74992cc1L,
0x40e0a060a0806040L, 0xe3c2211f21dd1fe3L,
0x793a43c843f2c879L, 0xb69a2ced2c77edb6L,
0xd40dd9bed9b3bed4L, 0x8d47ca46ca01468dL,
0x671770d970ced967L, 0x72afdd4bdde44b72L,
0x94ed79de7933de94L, 0x98ff67d4672bd498L,
0xb09323e8237be8b0L, 0x855bde4ade114a85L,
0xbb06bd6bbd6d6bbbL, 0xc5bb7e2a7e912ac5L,
0x4f7b34e5349ee54fL, 0xedd73a163ac116edL,
0x86d254c55417c586L, 0x9af862d7622fd79aL,
0x6699ff55ffcc5566L, 0x11b6a794a7229411L,
0x8ac04acf4a0fcf8aL, 0xe9d9301030c910e9L,
0x040e0a060a080604L, 0xfe66988198e781feL,
0xa0ab0bf00b5bf0a0L, 0x78b4cc44ccf04478L,
0x25f0d5bad54aba25L, 0x4b753ee33e96e34bL,
0xa2ac0ef30e5ff3a2L, 0x5d4419fe19bafe5dL,
0x80db5bc05b1bc080L, 0x0580858a850a8a05L,
0x3fd3ecadec7ead3fL, 0x21fedfbcdf42bc21L,
0x70a8d848d8e04870L, 0xf1fd0c040cf904f1L,
0x63197adf7ac6df63L, 0x772f58c158eec177L,
0xaf309f759f4575afL, 0x42e7a563a5846342L,
0x2070503050403020L, 0xe5cb2e1a2ed11ae5L,
0xfdef120e12e10efdL, 0xbf08b76db7656dbfL,
0x8155d44cd4194c81L, 0x18243c143c301418L,
0x26795f355f4c3526L, 0xc3b2712f719d2fc3L,
0xbe8638e13867e1beL, 0x35c8fda2fd6aa235L,
0x88c74fcc4f0bcc88L, 0x2e654b394b5c392eL,
0x936af957f93d5793L, 0x55580df20daaf255L,
0xfc619d829de382fcL, 0x7ab3c947c9f4477aL,
0xc827efacef8bacc8L, 0xba8832e7326fe7baL,
0x324f7d2b7d642b32L, 0xe642a495a4d795e6L,
0xc03bfba0fb9ba0c0L, 0x19aab398b3329819L,
0x9ef668d16827d19eL, 0xa322817f815d7fa3L,
0x44eeaa66aa886644L, 0x54d6827e82a87e54L,
0x3bdde6abe676ab3bL, 0x0b959e839e16830bL,
0x8cc945ca4503ca8cL, 0xc7bc7b297b9529c7L,
0x6b056ed36ed6d36bL, 0x286c443c44503c28L,
0xa72c8b798b5579a7L, 0xbc813de23d63e2bcL,
0x1631271d272c1d16L, 0xad379a769a4176adL,
0xdb964d3b4dad3bdbL, 0x649efa56fac85664L,
0x74a6d24ed2e84e74L, 0x1436221e22281e14L,
0x92e476db763fdb92L, 0x0c121e0a1e180a0cL,
0x48fcb46cb4906c48L, 0xb88f37e4376be4b8L,
0x9f78e75de7255d9fL, 0xbd0fb26eb2616ebdL,
0x43692aef2a86ef43L, 0xc435f1a6f193a6c4L,
0x39dae3a8e372a839L, 0x31c6f7a4f762a431L,
0xd38a593759bd37d3L, 0xf274868b86ff8bf2L,
0xd583563256b132d5L, 0x8b4ec543c50d438bL,
0x6e85eb59ebdc596eL, 0xda18c2b7c2afb7daL,
0x018e8f8c8f028c01L, 0xb11dac64ac7964b1L,
0x9cf16dd26d23d29cL, 0x49723be03b92e049L,
0xd81fc7b4c7abb4d8L, 0xacb915fa1543faacL,
0xf3fa090709fd07f3L, 0xcfa06f256f8525cfL,
0xca20eaafea8fafcaL, 0xf47d898e89f38ef4L,
0x476720e9208ee947L, 0x1038281828201810L,
0x6f0b64d564ded56fL, 0xf073838883fb88f0L,
0x4afbb16fb1946f4aL, 0x5cca967296b8725cL,
0x38546c246c702438L, 0x575f08f108aef157L,
0x732152c752e6c773L, 0x9764f351f3355197L,
0xcbae6523658d23cbL, 0xa125847c84597ca1L,
0xe857bf9cbfcb9ce8L, 0x3e5d6321637c213eL,
0x96ea7cdd7c37dd96L, 0x611e7fdc7fc2dc61L,
0x0d9c9186911a860dL, 0x0f9b9485941e850fL,
0xe04bab90abdb90e0L, 0x7cbac642c6f8427cL,
0x712657c457e2c471L, 0xcc29e5aae583aaccL,
0x90e373d8733bd890L, 0x06090f050f0c0506L,
0xf7f4030103f501f7L, 0x1c2a36123638121cL,
0xc23cfea3fe9fa3c2L, 0x6a8be15fe1d45f6aL,
0xaebe10f91047f9aeL, 0x69026bd06bd2d069L,
0x17bfa891a82e9117L, 0x9971e858e8295899L,
0x3a5369276974273aL, 0x27f7d0b9d04eb927L,
0xd991483848a938d9L, 0xebde351335cd13ebL,
0x2be5ceb3ce56b32bL, 0x2277553355443322L,
0xd204d6bbd6bfbbd2L, 0xa9399070904970a9L,
0x07878089800e8907L, 0x33c1f2a7f266a733L,
0x2decc1b6c15ab62dL, 0x3c5a66226678223cL,
0x15b8ad92ad2a9215L, 0xc9a96020608920c9L,
0x875cdb49db154987L, 0xaab01aff1a4fffaaL,
0x50d8887888a07850L, 0xa52b8e7a8e517aa5L,
0x03898a8f8a068f03L, 0x594a13f813b2f859L,
0x09929b809b128009L, 0x1a2339173934171aL,
0x651075da75cada65L, 0xd784533153b531d7L,
0x84d551c65113c684L, 0xd003d3b8d3bbb8d0L,
0x82dc5ec35e1fc382L, 0x29e2cbb0cb52b029L,
0x5ac3997799b4775aL, 0x1e2d3311333c111eL,
0x7b3d46cb46f6cb7bL, 0xa8b71ffc1f4bfca8L,
0x6d0c61d661dad66dL, 0x2c624e3a4e583a2cL
};
private static final long[] T1 = new long[T0.length];
private static final long[] T2 = new long[T0.length];
private static final long[] T3 = new long[T0.length];
private static final long[] T4 = new long[T0.length];
private static final long[] T5 = new long[T0.length];
private static final long[] T6 = new long[T0.length];
private static final long[] T7 = new long[T0.length];
static {
for (int i = 0; i < T0.length; i ++) {
long v = T0[i];
T1[i] = circularLeft(v, 56);
T2[i] = circularLeft(v, 48);
T3[i] = circularLeft(v, 40);
T4[i] = circularLeft(v, 32);
T5[i] = circularLeft(v, 24);
T6[i] = circularLeft(v, 16);
T7[i] = circularLeft(v, 8);
}
}
/* obsolete
private static final long[] CP = {
0x0000000000000000L, 0x0100000000000000L,
0x0200000000000000L, 0x0300000000000000L,
0x0400000000000000L, 0x0500000000000000L,
0x0600000000000000L, 0x0700000000000000L,
0x0800000000000000L, 0x0900000000000000L,
0x0A00000000000000L, 0x0B00000000000000L,
0x0C00000000000000L, 0x0D00000000000000L
};
private static final long[] CQ = {
0x00000000000000FFL, 0x00000000000000FEL,
0x00000000000000FDL, 0x00000000000000FCL,
0x00000000000000FBL, 0x00000000000000FAL,
0x00000000000000F9L, 0x00000000000000F8L,
0x00000000000000F7L, 0x00000000000000F6L,
0x00000000000000F5L, 0x00000000000000F4L,
0x00000000000000F3L, 0x00000000000000F2L
};
*/
/** @see Digest */
public int getBlockLength()
{
return 64;
}
/** @see DigestEngine */
protected Digest copyState(GroestlSmallCore dst)
{
System.arraycopy(H, 0, dst.H, 0, H.length);
return super.copyState(dst);
}
/** @see DigestEngine */
protected void engineReset()
{
for (int i = 0; i < 7; i ++)
H[i] = 0L;
H[7] = (long)(getDigestLength() << 3);
}
/** @see DigestEngine */
protected void doPadding(byte[] output, int outputOffset)
{
byte[] buf = getBlockBuffer();
int ptr = flush();
buf[ptr ++] = (byte)0x80;
long count = getBlockCount();
if (ptr <= 56) {
for (int i = ptr; i < 56; i ++)
buf[i] = 0;
count ++;
} else {
for (int i = ptr; i < 64; i ++)
buf[i] = 0;
processBlock(buf);
for (int i = 0; i < 56; i ++)
buf[i] = 0;
count += 2;
}
encodeBELong(count, buf, 56);
processBlock(buf);
System.arraycopy(H, 0, G, 0, H.length);
doPermP(G);
for (int i = 0; i < 4; i ++)
encodeBELong(H[i + 4] ^ G[i + 4], buf, 8 * i);
int outLen = getDigestLength();
System.arraycopy(buf, 32 - outLen,
output, outputOffset, outLen);
}
/** @see DigestEngine */
protected void doInit()
{
H = new long[8];
G = new long[8];
M = new long[8];
engineReset();
}
/**
* Encode the 64-bit word {@code val} into the array
* {@code buf} at offset {@code off}, in big-endian
* convention (most significant byte first).
*
* @param val the value to encode
* @param buf the destination buffer
* @param off the destination offset
*/
private static final void encodeBELong(long val, byte[] buf, int off)
{
buf[off + 0] = (byte)(val >>> 56);
buf[off + 1] = (byte)(val >>> 48);
buf[off + 2] = (byte)(val >>> 40);
buf[off + 3] = (byte)(val >>> 32);
buf[off + 4] = (byte)(val >>> 24);
buf[off + 5] = (byte)(val >>> 16);
buf[off + 6] = (byte)(val >>> 8);
buf[off + 7] = (byte)val;
}
/**
* Decode a 64-bit big-endian word from the array {@code buf}
* at offset {@code off}.
*
* @param buf the source buffer
* @param off the source offset
* @return the decoded value
*/
private static final long decodeBELong(byte[] buf, int off)
{
return ((long)(buf[off] & 0xFF) << 56)
| ((long)(buf[off + 1] & 0xFF) << 48)
| ((long)(buf[off + 2] & 0xFF) << 40)
| ((long)(buf[off + 3] & 0xFF) << 32)
| ((long)(buf[off + 4] & 0xFF) << 24)
| ((long)(buf[off + 5] & 0xFF) << 16)
| ((long)(buf[off + 6] & 0xFF) << 8)
| (long)(buf[off + 7] & 0xFF);
}
/**
* Perform a circular rotation by {@code n} to the left
* of the 64-bit word {@code x}. The {@code n} parameter
* must lie between 1 and 63 (inclusive).
*
* @param x the value to rotate
* @param n the rotation count (between 1 and 63)
* @return the rotated value
*/
static private long circularLeft(long x, int n)
{
return (x << n) | (x >>> (64 - n));
}
private void doPermP(long[] x)
{
for (int r = 0; r < 10; r += 2) {
x[0] ^= (long)(r) << 56;
x[1] ^= (long)(0x10 + r) << 56;
x[2] ^= (long)(0x20 + r) << 56;
x[3] ^= (long)(0x30 + r) << 56;
x[4] ^= (long)(0x40 + r) << 56;
x[5] ^= (long)(0x50 + r) << 56;
x[6] ^= (long)(0x60 + r) << 56;
x[7] ^= (long)(0x70 + r) << 56;
long t0 = T0[(int)(x[0] >>> 56)]
^ T1[(int)(x[1] >>> 48) & 0xFF]
^ T2[(int)(x[2] >>> 40) & 0xFF]
^ T3[(int)(x[3] >>> 32) & 0xFF]
^ T4[((int)x[4] >>> 24)]
^ T5[((int)x[5] >>> 16) & 0xFF]
^ T6[((int)x[6] >>> 8) & 0xFF]
^ T7[(int)x[7] & 0xFF];
long t1 = T0[(int)(x[1] >>> 56)]
^ T1[(int)(x[2] >>> 48) & 0xFF]
^ T2[(int)(x[3] >>> 40) & 0xFF]
^ T3[(int)(x[4] >>> 32) & 0xFF]
^ T4[((int)x[5] >>> 24)]
^ T5[((int)x[6] >>> 16) & 0xFF]
^ T6[((int)x[7] >>> 8) & 0xFF]
^ T7[(int)x[0] & 0xFF];
long t2 = T0[(int)(x[2] >>> 56)]
^ T1[(int)(x[3] >>> 48) & 0xFF]
^ T2[(int)(x[4] >>> 40) & 0xFF]
^ T3[(int)(x[5] >>> 32) & 0xFF]
^ T4[((int)x[6] >>> 24)]
^ T5[((int)x[7] >>> 16) & 0xFF]
^ T6[((int)x[0] >>> 8) & 0xFF]
^ T7[(int)x[1] & 0xFF];
long t3 = T0[(int)(x[3] >>> 56)]
^ T1[(int)(x[4] >>> 48) & 0xFF]
^ T2[(int)(x[5] >>> 40) & 0xFF]
^ T3[(int)(x[6] >>> 32) & 0xFF]
^ T4[((int)x[7] >>> 24)]
^ T5[((int)x[0] >>> 16) & 0xFF]
^ T6[((int)x[1] >>> 8) & 0xFF]
^ T7[(int)x[2] & 0xFF];
long t4 = T0[(int)(x[4] >>> 56)]
^ T1[(int)(x[5] >>> 48) & 0xFF]
^ T2[(int)(x[6] >>> 40) & 0xFF]
^ T3[(int)(x[7] >>> 32) & 0xFF]
^ T4[((int)x[0] >>> 24)]
^ T5[((int)x[1] >>> 16) & 0xFF]
^ T6[((int)x[2] >>> 8) & 0xFF]
^ T7[(int)x[3] & 0xFF];
long t5 = T0[(int)(x[5] >>> 56)]
^ T1[(int)(x[6] >>> 48) & 0xFF]
^ T2[(int)(x[7] >>> 40) & 0xFF]
^ T3[(int)(x[0] >>> 32) & 0xFF]
^ T4[((int)x[1] >>> 24)]
^ T5[((int)x[2] >>> 16) & 0xFF]
^ T6[((int)x[3] >>> 8) & 0xFF]
^ T7[(int)x[4] & 0xFF];
long t6 = T0[(int)(x[6] >>> 56)]
^ T1[(int)(x[7] >>> 48) & 0xFF]
^ T2[(int)(x[0] >>> 40) & 0xFF]
^ T3[(int)(x[1] >>> 32) & 0xFF]
^ T4[((int)x[2] >>> 24)]
^ T5[((int)x[3] >>> 16) & 0xFF]
^ T6[((int)x[4] >>> 8) & 0xFF]
^ T7[(int)x[5] & 0xFF];
long t7 = T0[(int)(x[7] >>> 56)]
^ T1[(int)(x[0] >>> 48) & 0xFF]
^ T2[(int)(x[1] >>> 40) & 0xFF]
^ T3[(int)(x[2] >>> 32) & 0xFF]
^ T4[((int)x[3] >>> 24)]
^ T5[((int)x[4] >>> 16) & 0xFF]
^ T6[((int)x[5] >>> 8) & 0xFF]
^ T7[(int)x[6] & 0xFF];
t0 ^= (long)(r + 1) << 56;
t1 ^= (long)(0x10 + (r + 1)) << 56;
t2 ^= (long)(0x20 + (r + 1)) << 56;
t3 ^= (long)(0x30 + (r + 1)) << 56;
t4 ^= (long)(0x40 + (r + 1)) << 56;
t5 ^= (long)(0x50 + (r + 1)) << 56;
t6 ^= (long)(0x60 + (r + 1)) << 56;
t7 ^= (long)(0x70 + (r + 1)) << 56;
x[0] = T0[(int)(t0 >>> 56)]
^ T1[(int)(t1 >>> 48) & 0xFF]
^ T2[(int)(t2 >>> 40) & 0xFF]
^ T3[(int)(t3 >>> 32) & 0xFF]
^ T4[((int)t4 >>> 24)]
^ T5[((int)t5 >>> 16) & 0xFF]
^ T6[((int)t6 >>> 8) & 0xFF]
^ T7[(int)t7 & 0xFF];
x[1] = T0[(int)(t1 >>> 56)]
^ T1[(int)(t2 >>> 48) & 0xFF]
^ T2[(int)(t3 >>> 40) & 0xFF]
^ T3[(int)(t4 >>> 32) & 0xFF]
^ T4[((int)t5 >>> 24)]
^ T5[((int)t6 >>> 16) & 0xFF]
^ T6[((int)t7 >>> 8) & 0xFF]
^ T7[(int)t0 & 0xFF];
x[2] = T0[(int)(t2 >>> 56)]
^ T1[(int)(t3 >>> 48) & 0xFF]
^ T2[(int)(t4 >>> 40) & 0xFF]
^ T3[(int)(t5 >>> 32) & 0xFF]
^ T4[((int)t6 >>> 24)]
^ T5[((int)t7 >>> 16) & 0xFF]
^ T6[((int)t0 >>> 8) & 0xFF]
^ T7[(int)t1 & 0xFF];
x[3] = T0[(int)(t3 >>> 56)]
^ T1[(int)(t4 >>> 48) & 0xFF]
^ T2[(int)(t5 >>> 40) & 0xFF]
^ T3[(int)(t6 >>> 32) & 0xFF]
^ T4[((int)t7 >>> 24)]
^ T5[((int)t0 >>> 16) & 0xFF]
^ T6[((int)t1 >>> 8) & 0xFF]
^ T7[(int)t2 & 0xFF];
x[4] = T0[(int)(t4 >>> 56)]
^ T1[(int)(t5 >>> 48) & 0xFF]
^ T2[(int)(t6 >>> 40) & 0xFF]
^ T3[(int)(t7 >>> 32) & 0xFF]
^ T4[((int)t0 >>> 24)]
^ T5[((int)t1 >>> 16) & 0xFF]
^ T6[((int)t2 >>> 8) & 0xFF]
^ T7[(int)t3 & 0xFF];
x[5] = T0[(int)(t5 >>> 56)]
^ T1[(int)(t6 >>> 48) & 0xFF]
^ T2[(int)(t7 >>> 40) & 0xFF]
^ T3[(int)(t0 >>> 32) & 0xFF]
^ T4[((int)t1 >>> 24)]
^ T5[((int)t2 >>> 16) & 0xFF]
^ T6[((int)t3 >>> 8) & 0xFF]
^ T7[(int)t4 & 0xFF];
x[6] = T0[(int)(t6 >>> 56)]
^ T1[(int)(t7 >>> 48) & 0xFF]
^ T2[(int)(t0 >>> 40) & 0xFF]
^ T3[(int)(t1 >>> 32) & 0xFF]
^ T4[((int)t2 >>> 24)]
^ T5[((int)t3 >>> 16) & 0xFF]
^ T6[((int)t4 >>> 8) & 0xFF]
^ T7[(int)t5 & 0xFF];
x[7] = T0[(int)(t7 >>> 56)]
^ T1[(int)(t0 >>> 48) & 0xFF]
^ T2[(int)(t1 >>> 40) & 0xFF]
^ T3[(int)(t2 >>> 32) & 0xFF]
^ T4[((int)t3 >>> 24)]
^ T5[((int)t4 >>> 16) & 0xFF]
^ T6[((int)t5 >>> 8) & 0xFF]
^ T7[(int)t6 & 0xFF];
}
}
private void doPermQ(long[] x)
{
for (int r = 0; r < 10; r += 2) {
x[0] ^= (long)r ^ -0x01L;
x[1] ^= (long)r ^ -0x11L;
x[2] ^= (long)r ^ -0x21L;
x[3] ^= (long)r ^ -0x31L;
x[4] ^= (long)r ^ -0x41L;
x[5] ^= (long)r ^ -0x51L;
x[6] ^= (long)r ^ -0x61L;
x[7] ^= (long)r ^ -0x71L;
long t0 = T0[(int)(x[1] >>> 56)]
^ T1[(int)(x[3] >>> 48) & 0xFF]
^ T2[(int)(x[5] >>> 40) & 0xFF]
^ T3[(int)(x[7] >>> 32) & 0xFF]
^ T4[((int)x[0] >>> 24)]
^ T5[((int)x[2] >>> 16) & 0xFF]
^ T6[((int)x[4] >>> 8) & 0xFF]
^ T7[(int)x[6] & 0xFF];
long t1 = T0[(int)(x[2] >>> 56)]
^ T1[(int)(x[4] >>> 48) & 0xFF]
^ T2[(int)(x[6] >>> 40) & 0xFF]
^ T3[(int)(x[0] >>> 32) & 0xFF]
^ T4[((int)x[1] >>> 24)]
^ T5[((int)x[3] >>> 16) & 0xFF]
^ T6[((int)x[5] >>> 8) & 0xFF]
^ T7[(int)x[7] & 0xFF];
long t2 = T0[(int)(x[3] >>> 56)]
^ T1[(int)(x[5] >>> 48) & 0xFF]
^ T2[(int)(x[7] >>> 40) & 0xFF]
^ T3[(int)(x[1] >>> 32) & 0xFF]
^ T4[((int)x[2] >>> 24)]
^ T5[((int)x[4] >>> 16) & 0xFF]
^ T6[((int)x[6] >>> 8) & 0xFF]
^ T7[(int)x[0] & 0xFF];
long t3 = T0[(int)(x[4] >>> 56)]
^ T1[(int)(x[6] >>> 48) & 0xFF]
^ T2[(int)(x[0] >>> 40) & 0xFF]
^ T3[(int)(x[2] >>> 32) & 0xFF]
^ T4[((int)x[3] >>> 24)]
^ T5[((int)x[5] >>> 16) & 0xFF]
^ T6[((int)x[7] >>> 8) & 0xFF]
^ T7[(int)x[1] & 0xFF];
long t4 = T0[(int)(x[5] >>> 56)]
^ T1[(int)(x[7] >>> 48) & 0xFF]
^ T2[(int)(x[1] >>> 40) & 0xFF]
^ T3[(int)(x[3] >>> 32) & 0xFF]
^ T4[((int)x[4] >>> 24)]
^ T5[((int)x[6] >>> 16) & 0xFF]
^ T6[((int)x[0] >>> 8) & 0xFF]
^ T7[(int)x[2] & 0xFF];
long t5 = T0[(int)(x[6] >>> 56)]
^ T1[(int)(x[0] >>> 48) & 0xFF]
^ T2[(int)(x[2] >>> 40) & 0xFF]
^ T3[(int)(x[4] >>> 32) & 0xFF]
^ T4[((int)x[5] >>> 24)]
^ T5[((int)x[7] >>> 16) & 0xFF]
^ T6[((int)x[1] >>> 8) & 0xFF]
^ T7[(int)x[3] & 0xFF];
long t6 = T0[(int)(x[7] >>> 56)]
^ T1[(int)(x[1] >>> 48) & 0xFF]
^ T2[(int)(x[3] >>> 40) & 0xFF]
^ T3[(int)(x[5] >>> 32) & 0xFF]
^ T4[((int)x[6] >>> 24)]
^ T5[((int)x[0] >>> 16) & 0xFF]
^ T6[((int)x[2] >>> 8) & 0xFF]
^ T7[(int)x[4] & 0xFF];
long t7 = T0[(int)(x[0] >>> 56)]
^ T1[(int)(x[2] >>> 48) & 0xFF]
^ T2[(int)(x[4] >>> 40) & 0xFF]
^ T3[(int)(x[6] >>> 32) & 0xFF]
^ T4[((int)x[7] >>> 24)]
^ T5[((int)x[1] >>> 16) & 0xFF]
^ T6[((int)x[3] >>> 8) & 0xFF]
^ T7[(int)x[5] & 0xFF];
t0 ^= (long)(r + 1) ^ -0x01L;
t1 ^= (long)(r + 1) ^ -0x11L;
t2 ^= (long)(r + 1) ^ -0x21L;
t3 ^= (long)(r + 1) ^ -0x31L;
t4 ^= (long)(r + 1) ^ -0x41L;
t5 ^= (long)(r + 1) ^ -0x51L;
t6 ^= (long)(r + 1) ^ -0x61L;
t7 ^= (long)(r + 1) ^ -0x71L;
x[0] = T0[(int)(t1 >>> 56)]
^ T1[(int)(t3 >>> 48) & 0xFF]
^ T2[(int)(t5 >>> 40) & 0xFF]
^ T3[(int)(t7 >>> 32) & 0xFF]
^ T4[((int)t0 >>> 24)]
^ T5[((int)t2 >>> 16) & 0xFF]
^ T6[((int)t4 >>> 8) & 0xFF]
^ T7[(int)t6 & 0xFF];
x[1] = T0[(int)(t2 >>> 56)]
^ T1[(int)(t4 >>> 48) & 0xFF]
^ T2[(int)(t6 >>> 40) & 0xFF]
^ T3[(int)(t0 >>> 32) & 0xFF]
^ T4[((int)t1 >>> 24)]
^ T5[((int)t3 >>> 16) & 0xFF]
^ T6[((int)t5 >>> 8) & 0xFF]
^ T7[(int)t7 & 0xFF];
x[2] = T0[(int)(t3 >>> 56)]
^ T1[(int)(t5 >>> 48) & 0xFF]
^ T2[(int)(t7 >>> 40) & 0xFF]
^ T3[(int)(t1 >>> 32) & 0xFF]
^ T4[((int)t2 >>> 24)]
^ T5[((int)t4 >>> 16) & 0xFF]
^ T6[((int)t6 >>> 8) & 0xFF]
^ T7[(int)t0 & 0xFF];
x[3] = T0[(int)(t4 >>> 56)]
^ T1[(int)(t6 >>> 48) & 0xFF]
^ T2[(int)(t0 >>> 40) & 0xFF]
^ T3[(int)(t2 >>> 32) & 0xFF]
^ T4[((int)t3 >>> 24)]
^ T5[((int)t5 >>> 16) & 0xFF]
^ T6[((int)t7 >>> 8) & 0xFF]
^ T7[(int)t1 & 0xFF];
x[4] = T0[(int)(t5 >>> 56)]
^ T1[(int)(t7 >>> 48) & 0xFF]
^ T2[(int)(t1 >>> 40) & 0xFF]
^ T3[(int)(t3 >>> 32) & 0xFF]
^ T4[((int)t4 >>> 24)]
^ T5[((int)t6 >>> 16) & 0xFF]
^ T6[((int)t0 >>> 8) & 0xFF]
^ T7[(int)t2 & 0xFF];
x[5] = T0[(int)(t6 >>> 56)]
^ T1[(int)(t0 >>> 48) & 0xFF]
^ T2[(int)(t2 >>> 40) & 0xFF]
^ T3[(int)(t4 >>> 32) & 0xFF]
^ T4[((int)t5 >>> 24)]
^ T5[((int)t7 >>> 16) & 0xFF]
^ T6[((int)t1 >>> 8) & 0xFF]
^ T7[(int)t3 & 0xFF];
x[6] = T0[(int)(t7 >>> 56)]
^ T1[(int)(t1 >>> 48) & 0xFF]
^ T2[(int)(t3 >>> 40) & 0xFF]
^ T3[(int)(t5 >>> 32) & 0xFF]
^ T4[((int)t6 >>> 24)]
^ T5[((int)t0 >>> 16) & 0xFF]
^ T6[((int)t2 >>> 8) & 0xFF]
^ T7[(int)t4 & 0xFF];
x[7] = T0[(int)(t0 >>> 56)]
^ T1[(int)(t2 >>> 48) & 0xFF]
^ T2[(int)(t4 >>> 40) & 0xFF]
^ T3[(int)(t6 >>> 32) & 0xFF]
^ T4[((int)t7 >>> 24)]
^ T5[((int)t1 >>> 16) & 0xFF]
^ T6[((int)t3 >>> 8) & 0xFF]
^ T7[(int)t5 & 0xFF];
}
}
/** @see DigestEngine */
protected void processBlock(byte[] data)
{
for (int i = 0; i < 8; i ++) {
M[i] = decodeBELong(data, i * 8);
G[i] = M[i] ^ H[i];
}
doPermP(G);
doPermQ(M);
for (int i = 0; i < 8; i ++)
H[i] ^= G[i] ^ M[i];
}
/** @see Digest */
public String toString()
{
return "Groestl-" + (getDigestLength() << 3);
}
}