Red Pike is a classified United Kingdom government encryption algorithm, proposed for use by the National Health ServicebyGCHQ, but designed for a "broad range of applications in the British government" [1] Archived 2004-04-23 at the Wayback Machine. Little is publicly known about Red Pike, except that it is a block cipher with a 64-bit block size and 64-bit key length. According to the academic study of the cipher cited below and quoted in a paper by Ross Anderson and Markus Kuhn, it "uses the same basic operations as RC5" (add, XOR, and left shift) and "has no look-up tables, virtually no key schedule and requires only five lines of code"; "the influence of each key bit quickly cascades" and "each encryption involves of the order of 100 operations". 64 bits of key entropy are not considered secure anymore.
Red Pike is available to approved British government contractors in software form, for use in confidential (not secret) government communication systems. GCHQ also designed the Rambutan cryptosystem for the same segment.
Given that Red Pike is a British encryption algorithm, its name likely refers to a particular fell in the western English Lake District.
In February 2014, the supposed source code for Red Pike was posted as follows to the Cypherpunk mailing list. [1]
/* Red Pike cipher source code */
#include <stdint.h>
typedef uint32_t word;
#define CONST 0x9E3779B9
#define ROUNDS 16
#define ROTL(X, R) (((X) << ((R) &31)) | ((X) >> (32 - ((R) &31))))
#define ROTR(X, R) (((X) >> ((R) &31)) | ((X) << (32 - ((R) &31))))
void encrypt(word * x, const word * k)
{
unsigned int i;
word rk0 = k[0];
word rk1 = k[1];
for (i = 0; i < ROUNDS; i++)
{
rk0 += CONST;
rk1 -= CONST;
x[0] ^= rk0;
x[0] += x[1];
x[0] = ROTL(x[0], x[1]);
x[1] = ROTR(x[1], x[0]);
x[1] -= x[0];
x[1] ^= rk1;
}
rk0 = x[0]; x[0] = x[1]; x[1] = rk0;
}
void decrypt(word * x, const word * k)
{
word dk[2] =
{
k[1] - CONST * (ROUNDS + 1),
k[0] + CONST * (ROUNDS + 1)
};
encrypt(x, dk);
}
