public static void D_ENCRYPT(ref ulong LL, ulong R, int S, ulong[] s, ref ulong u, ref ulong t)
{
LOAD_DATA_tmp(R, S, s, ref u, ref t);
t = CryptUtil.ROTATE(t, 4);
LL ^=
DES_SPtrans[0, (u >> (int)2L) & 0x3f] ^
DES_SPtrans[2, (u >> (int)10L) & 0x3f] ^
DES_SPtrans[4, (u >> (int)18L) & 0x3f] ^
DES_SPtrans[6, (u >> (int)26L) & 0x3f] ^
DES_SPtrans[1, (t >> (int)2L) & 0x3f] ^
DES_SPtrans[3, (t >> (int)10L) & 0x3f] ^
DES_SPtrans[5, (t >> (int)18L) & 0x3f] ^
DES_SPtrans[7, (t >> (int)26L) & 0x3f];
}
public static void DES_encrypt1(ulong[] data, DES_key_schedule ks, int enc)
{
ulong l = 0, r = 0, t = 0, u = 0;
//int i = 0;
ulong[] s = null;
r = data[0];
l = data[1];
CryptUtil.IP(ref r, ref l);
/*
* Things have been modified so that the initial rotate is done outside
* the loop. This required the DES_SPtrans values in sp.h to be rotated
* 1 bit to the right. One perl script later and things have a 5% speed
* up on a sparc2. Thanks to Richard Outerbridge
* <*****@*****.**> for pointing this out.
*/
/* clear the top bits on machines with 8byte longs */
/* shift left by 2 */
r = CryptUtil.ROTATE(r, 29) & 0xffffffffL;
l = CryptUtil.ROTATE(l, 29) & 0xffffffffL;
//s = ks.ks[0].deslong;
/*
* I don't know if it is worth the effort of loop unrolling the inner
* loop
*/
if (enc != 0)
{
s = ks.ks[0].deslong;
D_ENCRYPT(ref l, r, 0, s, ref u, ref t); /* 1 */
s = ks.ks[1].deslong;
D_ENCRYPT(ref r, l, 2, s, ref u, ref t); /* 2 */
s = ks.ks[2].deslong;
D_ENCRYPT(ref l, r, 4, s, ref u, ref t); /* 3 */
s = ks.ks[3].deslong;
D_ENCRYPT(ref r, l, 6, s, ref u, ref t); /* 4 */
s = ks.ks[4].deslong;
D_ENCRYPT(ref l, r, 8, s, ref u, ref t); /* 5 */
s = ks.ks[5].deslong;
D_ENCRYPT(ref r, l, 10, s, ref u, ref t); /* 6 */
s = ks.ks[6].deslong;
D_ENCRYPT(ref l, r, 12, s, ref u, ref t); /* 7 */
s = ks.ks[7].deslong;
D_ENCRYPT(ref r, l, 14, s, ref u, ref t); /* 8 */
s = ks.ks[8].deslong;
D_ENCRYPT(ref l, r, 16, s, ref u, ref t); /* 9 */
s = ks.ks[9].deslong;
D_ENCRYPT(ref r, l, 18, s, ref u, ref t); /* 10 */
s = ks.ks[10].deslong;
D_ENCRYPT(ref l, r, 20, s, ref u, ref t); /* 11 */
s = ks.ks[11].deslong;
D_ENCRYPT(ref r, l, 22, s, ref u, ref t); /* 12 */
s = ks.ks[12].deslong;
D_ENCRYPT(ref l, r, 24, s, ref u, ref t); /* 13 */
s = ks.ks[13].deslong;
D_ENCRYPT(ref r, l, 26, s, ref u, ref t); /* 14 */
s = ks.ks[14].deslong;
D_ENCRYPT(ref l, r, 28, s, ref u, ref t); /* 15 */
s = ks.ks[15].deslong;
D_ENCRYPT(ref r, l, 30, s, ref u, ref t); /* 16 */
}
else
{
s = ks.ks[15].deslong;
D_ENCRYPT(ref l, r, 30, s, ref u, ref t); /* 16 */
s = ks.ks[14].deslong;
D_ENCRYPT(ref r, l, 28, s, ref u, ref t); /* 15 */
s = ks.ks[13].deslong;
D_ENCRYPT(ref l, r, 26, s, ref u, ref t); /* 14 */
s = ks.ks[12].deslong;
D_ENCRYPT(ref r, l, 24, s, ref u, ref t); /* 13 */
s = ks.ks[11].deslong;
D_ENCRYPT(ref l, r, 22, s, ref u, ref t); /* 12 */
s = ks.ks[10].deslong;
D_ENCRYPT(ref r, l, 20, s, ref u, ref t); /* 11 */
s = ks.ks[9].deslong;
D_ENCRYPT(ref l, r, 18, s, ref u, ref t); /* 10 */
s = ks.ks[8].deslong;
D_ENCRYPT(ref r, l, 16, s, ref u, ref t); /* 9 */
s = ks.ks[7].deslong;
D_ENCRYPT(ref l, r, 14, s, ref u, ref t); /* 8 */
s = ks.ks[6].deslong;
D_ENCRYPT(ref r, l, 12, s, ref u, ref t); /* 7 */
s = ks.ks[5].deslong;
D_ENCRYPT(ref l, r, 10, s, ref u, ref t); /* 6 */
s = ks.ks[4].deslong;
D_ENCRYPT(ref r, l, 8, s, ref u, ref t); /* 5 */
s = ks.ks[3].deslong;
D_ENCRYPT(ref l, r, 6, s, ref u, ref t); /* 4 */
s = ks.ks[2].deslong;
D_ENCRYPT(ref r, l, 4, s, ref u, ref t); /* 3 */
s = ks.ks[1].deslong;
D_ENCRYPT(ref l, r, 2, s, ref u, ref t); /* 2 */
s = ks.ks[0].deslong;
D_ENCRYPT(ref r, l, 0, s, ref u, ref t); /* 1 */
}
/* rotate and clear the top bits on machines with 8byte longs */
l = CryptUtil.ROTATE(l, 3) & 0xffffffffL;
r = CryptUtil.ROTATE(r, 3) & 0xffffffffL;
CryptUtil.FP(ref r, ref l);
data[0] = l;
data[1] = r;
l = r = t = u = 0;
}
public static void DES_set_key_unchecked(byte[] key, DES_key_schedule schedule)
{
ulong c = 0, d = 0, t = 0, s = 0, t2 = 0;
byte[] in_Key;
ulong[] k;
int i;
in_Key = key;
int c2l_in_Key_startIdx = 0;
CryptUtil.c2l(in_Key, ref c, ref c2l_in_Key_startIdx);
CryptUtil.c2l(in_Key, ref d, ref c2l_in_Key_startIdx);
/*
* do PC1 in 47 simple operations :-) Thanks to John Fletcher
* ([email protected]) for the inspiration. :-)
*/
CryptUtil.PERM_OP(ref d, ref c, ref t, 4, 0x0f0f0f0fL);
CryptUtil.HPERM_OP(ref c, t, -2, 0xcccc0000L);
CryptUtil.HPERM_OP(ref d, t, -2, 0xcccc0000L);
CryptUtil.PERM_OP(ref d, ref c, ref t, 1, 0x55555555L);
CryptUtil.PERM_OP(ref c, ref d, ref t, 8, 0x00ff00ffL);
CryptUtil.PERM_OP(ref d, ref c, ref t, 1, 0x55555555L);
d = (((d & 0x000000ffL) << (int)16L) | (d & 0x0000ff00L) |
((d & 0x00ff0000L) >> (int)16L) | ((c & 0xf0000000L) >> (int)4L));
c &= 0x0fffffffL;
for (i = 0; i < ITERATIONS; i++)
{
k = schedule.ks[i].deslong;
if (shifts2[i] != 0)
{
c = ((c >> (int)2L) | (c << (int)26L));
d = ((d >> (int)2L) | (d << (int)26L));
}
else
{
c = ((c >> (int)1L) | (c << (int)27L));
d = ((d >> (int)1L) | (d << (int)27L));
}
c &= 0x0fffffffL;
d &= 0x0fffffffL;
/*
* could be a few less shifts but I am to lazy at this point in time
* to investigate
*/
s = des_skb[0, (c) & 0x3f] |
des_skb[1, ((c >> (int)6L) & 0x03) | ((c >> (int)7L) & 0x3c)] |
des_skb[2, ((c >> (int)13L) & 0x0f) | ((c >> (int)14L) & 0x30)] |
des_skb[3, ((c >> (int)20L) & 0x01) | ((c >> (int)21L) & 0x06) |
((c >> (int)22L) & 0x38)];
t = des_skb[4, (d) & 0x3f] |
des_skb[5, ((d >> (int)7L) & 0x03) | ((d >> (int)8L) & 0x3c)] |
des_skb[6, (d >> (int)15L) & 0x3f] |
des_skb[7, ((d >> (int)21L) & 0x0f) | ((d >> (int)22L) & 0x30)];
/* table contained 0213 4657 */
t2 = ((t << (int)16L) | (s & 0x0000ffffL)) & 0xffffffffL;
k[0] = CryptUtil.ROTATE(t2, 30) & 0xffffffffL;
t2 = ((s >> (int)16L) | (t & 0xffff0000L));
k[1] = CryptUtil.ROTATE(t2, 26) & 0xffffffffL;
}
}
