1
0
mirror of https://github.com/hashcat/hashcat.git synced 2024-11-23 00:28:11 +00:00
hashcat/OpenCL/inc_cipher_rc4.cl

270 lines
7.0 KiB
Common Lisp

#include "inc_vendor.h"
#include "inc_types.h"
#include "inc_platform.h"
#include "inc_common.h"
#include "inc_cipher_rc4.h"
#ifdef IS_CPU
// Pattern linear
DECLSPEC u8 GET_KEY8 (LOCAL_AS u32 *S, const u8 k)
{
LOCAL_AS u8 *S8 = (LOCAL_AS u8 *) S;
return S8[k];
}
DECLSPEC void SET_KEY8 (LOCAL_AS u32 *S, const u8 k, const u8 v)
{
LOCAL_AS u8 *S8 = (LOCAL_AS u8 *) S;
S8[k] = v;
}
DECLSPEC void SET_KEY32 (LOCAL_AS u32 *S, const u8 k, const u32 v)
{
S[k] = v;
}
#else
// The goal of this pattern is to have the minimum shared memory bank conflicts as possible.
// Bank conflicts force the device to serialize the bank access and this results in performance drops.
//
// Good to know:
// NV and AMD GPU both have exactly 32 shared memory banks (at least on all modern GPU).
// These banks can't be addressed directly, but indirectly.
// Each of the 32 banks add some space to the total LOCAL buffer.
// But this space is not simply appended, but in chunks of 4 bytes:
// Bank 0 provides bytes 0..3, Bank 1 provides bytes 4..7, Bank 2 provides 8..11, and so on..
//
// We design the memory structure that each thread ID aligns with the corresponding bank ID.
// If a thread always access the same bank, then there are no bank conflicts and we reach our goal.
//
// Since we have 32 banks, we ideally operate on 32 threads.
// For NV GPU this aligns perfectly, because native threads = 32.
// For AMD GPU it does not, because native threads = 64. But we can reduce it to only 1 bank conflict per thread.
//
// The size for the S[] buffer for each thread is 256 byte, basically just the RC4 sbox.
// We want to assign 1 thread to 1 bank, so for 32 banks the total size is 8192 bytes (256 * 32 = 8192):
// LOCAL_VK u32 S[64 * FIXED_LOCAL_SIZE];
// Note that sizeof (u32) * 64 = 256 and then multiplied with the thread count.
//
// Addressing:
//
// This is the first major offset and is relevant for thread ID >= 32 (AMD or non-native thread count on NV):
// (t / 32) * 8192
// The first 8192 bytes of S[] are accessed from threads 0..31 and the next 8192 bytes from threads 32..63
// We could also use more than 64 threads but we need to make sure it's a multiple of 32.
//
// Inside this window of 8192 bytes we select the bank id from the thread id:
// (t & 31) * 4
// We need to do the * 4 because of the 4 byte chunks (see top)
//
// Because of the indirect bank ID addressing we can't write from left to right, we write from top to bottom.
// To ensure each thread stays to its assigned bank id from the previous calculation we could simply do k * 128,
// because 128 = 4 (bank chunk size) * 32 (banks).
//
// However, it's not that easy. We need to find a way to enforce a chunk size of 4.
// (k / 4) * 128
//
// Finally we can select the actual target byte from (1 out of 4) from this chunk:
// (k & 3)
#define KEY8(t,k) (((k) & 3) + (((k) / 4) * 128) + (((t) & 31) * 4) + (((t) / 32) * 8192))
DECLSPEC u8 GET_KEY8 (LOCAL_AS u32 *S, const u8 k)
{
const u64 lid = get_local_id (0);
LOCAL_AS u8 *S8 = (LOCAL_AS u8 *) S;
return S8[KEY8 (lid, k)];
}
DECLSPEC void SET_KEY8 (LOCAL_AS u32 *S, const u8 k, const u8 v)
{
const u64 lid = get_local_id (0);
LOCAL_AS u8 *S8 = (LOCAL_AS u8 *) S;
S8[KEY8 (lid, k)] = v;
}
#define KEY32(t,k) (((k) * 32) + ((t) & 31) + (((t) / 32) * 2048))
DECLSPEC void SET_KEY32 (LOCAL_AS u32 *S, const u8 k, const u32 v)
{
const u64 lid = get_local_id (0);
S[KEY32 (lid, k)] = v;
}
#undef KEY8
#undef KEY32
#endif
DECLSPEC void rc4_init_40 (LOCAL_AS u32 *S, const u32 *key)
{
u32 v = 0x03020100;
u32 a = 0x04040404;
#ifdef _unroll
#pragma unroll
#endif
for (u8 i = 0; i < 64; i++)
{
SET_KEY32 (S, i, v); v += a;
}
const u8 d0 = v8a_from_v32_S (key[0]);
const u8 d1 = v8b_from_v32_S (key[0]);
const u8 d2 = v8c_from_v32_S (key[0]);
const u8 d3 = v8d_from_v32_S (key[0]);
const u8 d4 = v8a_from_v32_S (key[1]);
u8 j = 0;
#ifdef _unroll
#pragma unroll
#endif
for (u32 i = 0; i < 255; i += 5)
{
j += GET_KEY8 (S, i + 0) + d0; rc4_swap (S, i + 0, j);
j += GET_KEY8 (S, i + 1) + d1; rc4_swap (S, i + 1, j);
j += GET_KEY8 (S, i + 2) + d2; rc4_swap (S, i + 2, j);
j += GET_KEY8 (S, i + 3) + d3; rc4_swap (S, i + 3, j);
j += GET_KEY8 (S, i + 4) + d4; rc4_swap (S, i + 4, j);
}
j += GET_KEY8 (S, 255) + d0; rc4_swap (S, 255, j);
}
DECLSPEC void rc4_init_128 (LOCAL_AS u32 *S, const u32 *key)
{
u32 v = 0x03020100;
u32 a = 0x04040404;
#ifdef _unroll
#pragma unroll
#endif
for (u8 i = 0; i < 64; i++)
{
SET_KEY32 (S, i, v); v += a;
}
u8 j = 0;
for (u32 i = 0; i < 16; i++)
{
u8 idx = i * 16;
u32 v;
v = key[0];
j += GET_KEY8 (S, idx) + v8a_from_v32_S (v); rc4_swap (S, idx, j); idx++;
j += GET_KEY8 (S, idx) + v8b_from_v32_S (v); rc4_swap (S, idx, j); idx++;
j += GET_KEY8 (S, idx) + v8c_from_v32_S (v); rc4_swap (S, idx, j); idx++;
j += GET_KEY8 (S, idx) + v8d_from_v32_S (v); rc4_swap (S, idx, j); idx++;
v = key[1];
j += GET_KEY8 (S, idx) + v8a_from_v32_S (v); rc4_swap (S, idx, j); idx++;
j += GET_KEY8 (S, idx) + v8b_from_v32_S (v); rc4_swap (S, idx, j); idx++;
j += GET_KEY8 (S, idx) + v8c_from_v32_S (v); rc4_swap (S, idx, j); idx++;
j += GET_KEY8 (S, idx) + v8d_from_v32_S (v); rc4_swap (S, idx, j); idx++;
v = key[2];
j += GET_KEY8 (S, idx) + v8a_from_v32_S (v); rc4_swap (S, idx, j); idx++;
j += GET_KEY8 (S, idx) + v8b_from_v32_S (v); rc4_swap (S, idx, j); idx++;
j += GET_KEY8 (S, idx) + v8c_from_v32_S (v); rc4_swap (S, idx, j); idx++;
j += GET_KEY8 (S, idx) + v8d_from_v32_S (v); rc4_swap (S, idx, j); idx++;
v = key[3];
j += GET_KEY8 (S, idx) + v8a_from_v32_S (v); rc4_swap (S, idx, j); idx++;
j += GET_KEY8 (S, idx) + v8b_from_v32_S (v); rc4_swap (S, idx, j); idx++;
j += GET_KEY8 (S, idx) + v8c_from_v32_S (v); rc4_swap (S, idx, j); idx++;
j += GET_KEY8 (S, idx) + v8d_from_v32_S (v); rc4_swap (S, idx, j); idx++;
}
}
DECLSPEC void rc4_swap (LOCAL_AS u32 *S, const u8 i, const u8 j)
{
u8 tmp;
tmp = GET_KEY8 (S, i);
SET_KEY8 (S, i, GET_KEY8 (S, j));
SET_KEY8 (S, j, tmp);
}
DECLSPEC u8 rc4_next_16 (LOCAL_AS u32 *S, const u8 i, const u8 j, const u32 *in, u32 *out)
{
u8 a = i;
u8 b = j;
#ifdef _unroll
#pragma unroll
#endif
for (int k = 0; k < 4; k++)
{
u32 xor4 = 0;
u32 tmp;
u8 idx;
a += 1;
b += GET_KEY8 (S, a);
rc4_swap (S, a, b);
idx = GET_KEY8 (S, a) + GET_KEY8 (S, b);
tmp = GET_KEY8 (S, idx);
xor4 |= tmp << 0;
a += 1;
b += GET_KEY8 (S, a);
rc4_swap (S, a, b);
idx = GET_KEY8 (S, a) + GET_KEY8 (S, b);
tmp = GET_KEY8 (S, idx);
xor4 |= tmp << 8;
a += 1;
b += GET_KEY8 (S, a);
rc4_swap (S, a, b);
idx = GET_KEY8 (S, a) + GET_KEY8 (S, b);
tmp = GET_KEY8 (S, idx);
xor4 |= tmp << 16;
a += 1;
b += GET_KEY8 (S, a);
rc4_swap (S, a, b);
idx = GET_KEY8 (S, a) + GET_KEY8 (S, b);
tmp = GET_KEY8 (S, idx);
xor4 |= tmp << 24;
out[k] = in[k] ^ xor4;
}
return b;
}