[2841] in cryptography@c2.net mail archive
RE: "damn the bitmaps..."
daemon@ATHENA.MIT.EDU (Colin Plumb)
Wed Jun 24 19:06:03 1998
Date: Wed, 24 Jun 1998 17:01:44 -0600 (MDT)
From: Colin Plumb <colin@nyx.net>
To: cryptography@c2.net, jya@pipeline.com
Here's a slightly better-optimized implementation. Now I'm going to
start on timing tests.
--
-Colin
#include <stdio.h>
#include <string.h>
typedef unsigned char uint8;
/* The F function */
static uint8 const F[0x100] = {
0xa3,0xd7,0x09,0x83,0xf8,0x48,0xf6,0xf4,0xb3,0x21,0x15,0x78,0x99,0xb1,0xaf,0xf9,
0xe7,0x2d,0x4d,0x8a,0xce,0x4c,0xca,0x2e,0x52,0x95,0xd9,0x1e,0x4e,0x38,0x44,0x28,
0x0a,0xdf,0x02,0xa0,0x17,0xf1,0x60,0x68,0x12,0xb7,0x7a,0xc3,0xe9,0xfa,0x3d,0x53,
0x96,0x84,0x6b,0xba,0xf2,0x63,0x9a,0x19,0x7c,0xae,0xe5,0xf5,0xf7,0x16,0x6a,0xa2,
0x39,0xb6,0x7b,0x0f,0xc1,0x93,0x81,0x1b,0xee,0xb4,0x1a,0xea,0xd0,0x91,0x2f,0xb8,
0x55,0xb9,0xda,0x85,0x3f,0x41,0xbf,0xe0,0x5a,0x58,0x80,0x5f,0x66,0x0b,0xd8,0x90,
0x35,0xd5,0xc0,0xa7,0x33,0x06,0x65,0x69,0x45,0x00,0x94,0x56,0x6d,0x98,0x9b,0x76,
0x97,0xfc,0xb2,0xc2,0xb0,0xfe,0xdb,0x20,0xe1,0xeb,0xd6,0xe4,0xdd,0x47,0x4a,0x1d,
0x42,0xed,0x9e,0x6e,0x49,0x3c,0xcd,0x43,0x27,0xd2,0x07,0xd4,0xde,0xc7,0x67,0x18,
0x89,0xcb,0x30,0x1f,0x8d,0xc6,0x8f,0xaa,0xc8,0x74,0xdc,0xc9,0x5d,0x5c,0x31,0xa4,
0x70,0x88,0x61,0x2c,0x9f,0x0d,0x2b,0x87,0x50,0x82,0x54,0x64,0x26,0x7d,0x03,0x40,
0x34,0x4b,0x1c,0x73,0xd1,0xc4,0xfd,0x3b,0xcc,0xfb,0x7f,0xab,0xe6,0x3e,0x5b,0xa5,
0xad,0x04,0x23,0x9c,0x14,0x51,0x22,0xf0,0x29,0x79,0x71,0x7e,0xff,0x8c,0x0e,0xe2,
0x0c,0xef,0xbc,0x72,0x75,0x6f,0x37,0xa1,0xec,0xd3,0x8e,0x62,0x8b,0x86,0x10,0xe8,
0x08,0x77,0x11,0xbe,0x92,0x4f,0x24,0xc5,0x32,0x36,0x9d,0xcf,0xf3,0xa6,0xbb,0xac,
0x5e,0x6c,0xa9,0x13,0x57,0x25,0xb5,0xe3,0xbd,0xa8,0x3a,0x01,0x05,0x59,0x2a,0x46
};
/* The permutation G */
#define G(l, r, key, koff) \
((l) ^= F[(r) ^ (key)[(koff)%10]], \
(r) ^= F[(l) ^ (key)[((koff)+1)%10]], \
(l) ^= F[(r) ^ (key)[((koff)+2)%10]], \
(r) ^= F[(l) ^ (key)[((koff)+3)%10]])
/* The inverse for decryption */
#define Gx(l, r, key, koff) \
((r) ^= F[(l) ^ (key)[((koff)+3)%10]], \
(l) ^= F[(r) ^ (key)[((koff)+2)%10]], \
(r) ^= F[(l) ^ (key)[((koff)+1)%10]], \
(l) ^= F[(r) ^ (key)[(koff)%10]])
/* Round function A */
#define A(G, b0, b1, b6, b7, key, n) \
(G(b0, b1, key, (n)*4-4), \
(b6) ^= (b0), \
(b7) ^= (b1) ^ (n))
/* Round function B */
#define B(G, b0, b1, b2, b3, key, n) \
((b2) ^= (b0), \
(b3) ^= (b1) ^ (n), \
G(b0, b1, key, (n)*4-4))
/* The inverse of A(G, ...) is B(Gx, ...) and vice-versa */
/* Debugging */
#if 1
#define P printf(" %02x %02x %02x %02x %02x %02x %02x %02x\n", \
b0, b1, b2, b3, b4, b5, b6, b7);
#else
#define P (void)0
#endif
void
encrypt(uint8 data[8], uint8 const key[10])
{
uint8 b0 = data[0];
uint8 b1 = data[1];
uint8 b2 = data[2];
uint8 b3 = data[3];
uint8 b4 = data[4];
uint8 b5 = data[5];
uint8 b6 = data[6];
uint8 b7 = data[7];
P;
A(G, b0, b1, b6, b7, key, 1); P;
A(G, b6, b7, b4, b5, key, 2); P;
A(G, b4, b5, b2, b3, key, 3); P;
A(G, b2, b3, b0, b1, key, 4); P;
A(G, b0, b1, b6, b7, key, 5); P;
A(G, b6, b7, b4, b5, key, 6); P;
A(G, b4, b5, b2, b3, key, 7); P;
A(G, b2, b3, b0, b1, key, 8); P;
B(G, b0, b1, b2, b3, key, 9); P;
B(G, b6, b7, b0, b1, key, 10); P;
B(G, b4, b5, b6, b7, key, 11); P;
B(G, b2, b3, b4, b5, key, 12); P;
B(G, b0, b1, b2, b3, key, 13); P;
B(G, b6, b7, b0, b1, key, 14); P;
B(G, b4, b5, b6, b7, key, 15); P;
B(G, b2, b3, b4, b5, key, 16); P;
A(G, b0, b1, b6, b7, key, 17); P;
A(G, b6, b7, b4, b5, key, 18); P;
A(G, b4, b5, b2, b3, key, 19); P;
A(G, b2, b3, b0, b1, key, 20); P;
A(G, b0, b1, b6, b7, key, 21); P;
A(G, b6, b7, b4, b5, key, 22); P;
A(G, b4, b5, b2, b3, key, 23); P;
A(G, b2, b3, b0, b1, key, 24); P;
B(G, b0, b1, b2, b3, key, 25); P;
B(G, b6, b7, b0, b1, key, 26); P;
B(G, b4, b5, b6, b7, key, 27); P;
B(G, b2, b3, b4, b5, key, 28); P;
B(G, b0, b1, b2, b3, key, 29); P;
B(G, b6, b7, b0, b1, key, 30); P;
B(G, b4, b5, b6, b7, key, 31); P;
B(G, b2, b3, b4, b5, key, 32); P;
data[0] = b0;
data[1] = b1;
data[2] = b2;
data[3] = b3;
data[4] = b4;
data[5] = b5;
data[6] = b6;
data[7] = b7;
}
void
decrypt(uint8 data[8], uint8 const key[10])
{
uint8 b0 = data[0];
uint8 b1 = data[1];
uint8 b2 = data[2];
uint8 b3 = data[3];
uint8 b4 = data[4];
uint8 b5 = data[5];
uint8 b6 = data[6];
uint8 b7 = data[7];
P;
A(Gx, b2, b3, b4, b5, key, 32); P;
A(Gx, b4, b5, b6, b7, key, 31); P;
A(Gx, b6, b7, b0, b1, key, 30); P;
A(Gx, b0, b1, b2, b3, key, 29); P;
A(Gx, b2, b3, b4, b5, key, 28); P;
A(Gx, b4, b5, b6, b7, key, 27); P;
A(Gx, b6, b7, b0, b1, key, 26); P;
A(Gx, b0, b1, b2, b3, key, 25); P;
B(Gx, b2, b3, b0, b1, key, 24); P;
B(Gx, b4, b5, b2, b3, key, 23); P;
B(Gx, b6, b7, b4, b5, key, 22); P;
B(Gx, b0, b1, b6, b7, key, 21); P;
B(Gx, b2, b3, b0, b1, key, 20); P;
B(Gx, b4, b5, b2, b3, key, 19); P;
B(Gx, b6, b7, b4, b5, key, 18); P;
B(Gx, b0, b1, b6, b7, key, 17); P;
A(Gx, b2, b3, b4, b5, key, 16); P;
A(Gx, b4, b5, b6, b7, key, 15); P;
A(Gx, b6, b7, b0, b1, key, 14); P;
A(Gx, b0, b1, b2, b3, key, 13); P;
A(Gx, b2, b3, b4, b5, key, 12); P;
A(Gx, b4, b5, b6, b7, key, 11); P;
A(Gx, b6, b7, b0, b1, key, 10); P;
A(Gx, b0, b1, b2, b3, key, 9); P;
B(Gx, b2, b3, b0, b1, key, 8); P;
B(Gx, b4, b5, b2, b3, key, 7); P;
B(Gx, b6, b7, b4, b5, key, 6); P;
B(Gx, b0, b1, b6, b7, key, 5); P;
B(Gx, b2, b3, b0, b1, key, 4); P;
B(Gx, b4, b5, b2, b3, key, 3); P;
B(Gx, b6, b7, b4, b5, key, 2); P;
B(Gx, b0, b1, b6, b7, key, 1); P;
data[0] = b0;
data[1] = b1;
data[2] = b2;
data[3] = b3;
data[4] = b4;
data[5] = b5;
data[6] = b6;
data[7] = b7;
}
int
main(void)
{
uint8 const key[10] =
{ 0x00, 0x99, 0x88, 0x77, 0x66, 0x55, 0x44, 0x33, 0x22, 0x11 };
uint8 const plain[8] =
{ 0x33, 0x22, 0x11, 0x00, 0xdd, 0xcc, 0xbb, 0xaa };
uint8 cipher[8];
memcpy(cipher, plain, 8);
encrypt(cipher, key);
putchar('\n');
decrypt(cipher, key);
return 0;
}
