TeaSpeak/tomcrypt
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

added libtomcrypt-1.09

Browse Source
This commit is contained in:
Tom St Denis
2006-01-26 18:11:56 +00:00
committed by Steffen Jaeckel
parent 1eeff0bfb4
commit a3ce807bae
55 changed files with 2480 additions and 126 deletions
Download Patch File Download Diff File Expand all files Collapse all files
src/encauth/gcm/gcm_gf_mult.c
+2 -32
View File
@@ -11,11 +11,11 @@
/**
@file gcm_gf_mult.c
GCM implementation, initialize state, by Tom St Denis
GCM implementation, do the GF mult, by Tom St Denis
*/
#include "tomcrypt.h"
#ifdef GCM_MODE
#if defined(GCM_MODE) || defined(LRW_MODE)
/* right shift */
static void gcm_rightshift(unsigned char *a)
@@ -57,36 +57,6 @@ void gcm_gf_mult(const unsigned char *a, const unsigned char *b, unsigned char *
}
XMEMCPY(c, Z, 16);
}
/**
GCM multiply by H
@param gcm The GCM state which holds the H value
@param I The value to multiply H by
*/
void gcm_mult_h(gcm_state *gcm, unsigned char *I)
{
unsigned char T[16];
#ifdef GCM_TABLES
int x, y;
XMEMCPY(T, &gcm->PC[0][I[0]][0], 16);
for (x = 1; x < 16; x++) {
#ifdef LTC_FAST
for (y = 0; y < 16; y += sizeof(LTC_FAST_TYPE)) {
*((LTC_FAST_TYPE *)(T + y)) ^= *((LTC_FAST_TYPE *)(&gcm->PC[x][I[x]][y]));
}
#else
for (y = 0; y < 16; y++) {
T[y] ^= gcm->PC[x][I[x]][y];
}
#endif
}
#else
gcm_gf_mult(gcm->H, I, T);
#endif
XMEMCPY(I, T, 16);
}
#endif
/* $Source$ */
src/encauth/gcm/gcm_mult_h.c
+50
View File
@@ -0,0 +1,50 @@
/* LibTomCrypt, modular cryptographic library -- Tom St Denis
*
* LibTomCrypt is a library that provides various cryptographic
* algorithms in a highly modular and flexible manner.
*
* The library is free for all purposes without any express
* guarantee it works.
*
* Tom St Denis, tomstdenis@gmail.com, http://libtomcrypt.org
*/
/**
@file gcm_mult_h.c
GCM implementation, do the GF mult, by Tom St Denis
*/
#include "tomcrypt.h"
#if defined(GCM_MODE)
/**
GCM multiply by H
@param gcm The GCM state which holds the H value
@param I The value to multiply H by
*/
void gcm_mult_h(gcm_state *gcm, unsigned char *I)
{
unsigned char T[16];
#ifdef GCM_TABLES
int x, y;
XMEMCPY(T, &gcm->PC[0][I[0]][0], 16);
for (x = 1; x < 16; x++) {
#ifdef LTC_FAST
for (y = 0; y < 16; y += sizeof(LTC_FAST_TYPE)) {
*((LTC_FAST_TYPE *)(T + y)) ^= *((LTC_FAST_TYPE *)(&gcm->PC[x][I[x]][y]));
}
#else
for (y = 0; y < 16; y++) {
T[y] ^= gcm->PC[x][I[x]][y];
}
#endif
}
#else
gcm_gf_mult(gcm->H, I, T);
#endif
XMEMCPY(I, T, 16);
}
#endif
/* $Source$ */
/* $Revision$ */
/* $Date$ */
src/encauth/nls/nls_memory.c
+94
View File
@@ -0,0 +1,94 @@
/* LibTomCrypt, modular cryptographic library -- Tom St Denis
*
* LibTomCrypt is a library that provides various cryptographic
* algorithms in a highly modular and flexible manner.
*
* The library is free for all purposes without any express
* guarantee it works.
*
* Tom St Denis, tomstdenis@gmail.com, http://libtomcrypt.org
*/
/**
@file nls_memory.c
NLS support, process a block of memory, Tom St Denis
*/
#ifdef NLS_MODE
int nls_memory(const unsigned char *key, unsigned long keylen,
const unsigned char *IV, unsigned long IVlen,
const unsigned char *adata, unsigned long adatalen,
unsigned char *pt, unsigned long ptlen,
unsigned char *ct,
unsigned char *tag, unsigned long taglen,
int direction)
{
nls_state *nls;
int err;
LTC_ARGCHK(key != NULL);
LTC_ARGCHK(IV != NULL);
if (adatalen > 0) {
LTC_ARGCHK(adata != NULL);
}
LTC_ARGCHK(pt != NULL);
LTC_ARGCHK(ct != NULL);
if (taglen > 0) {
LTC_ARGCHK(tag != NULL);
}
/* alloc NLS state */
nls = XCALLOC(1, sizeof(*nls));
if (nls == NULL) {
return CRYPT_MEM;
}
/* init key and IV */
if ((err = nls_key(nls, key, keylen)) != CRYPT_OK) {
goto done;
}
if ((err = nls_nonce(nls, IV, IVlen)) != CRYPT_OK) {
goto done;
}
/* process adata */
if (adatalen > 0) {
if ((err = nls_maconly(nls, adata, adatalen)) != CRYPT_OK) {
goto done;
}
}
/* process msg */
if (direction == NLS_ENCRYPT) {
if ((err = nls_encrypt(nls, pt, nbytes, ct)) != CRYPT_OK) {
goto done;
}
} else {
if ((err = nls_decrypt(nls, ct, nbytes, pt)) != CRYPT_OK) {
goto done;
}
}
/* grab tag */
if (taglen > 0) {
if ((err = nls_finish(nls, tag, taglen)) != CRYPT_OK) {
goto done;
}
}
err = CRYPT_OK;
done:
#ifdef LTC_CLEAN_STACK
zeromem(nls, sizeof(*nls));
#endif
XFREE(nls);
return err;
}
#endif
/* $Source$ */
/* $Revision$ */
/* $Date$ */
src/encauth/nls/nlsfast.c
+981
View File
@@ -0,0 +1,981 @@
/* LibTomCrypt, modular cryptographic library -- Tom St Denis
*
* LibTomCrypt is a library that provides various cryptographic
* algorithms in a highly modular and flexible manner.
*
* The library is free for all purposes without any express
* guarantee it works.
*
* Tom St Denis, tomstdenis@gmail.com, http://libtomcrypt.org
*/
/**
@file nlsfast.c
NLS support, entire suite, Tom St Denis
*/
/* Id: nlsfast.c 346 2005-04-22 18:36:12Z mwp */
/* nlsfast: NLS stream cipher and Mundja MAC -- fast implementation */
/*
THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESS OR IMPLIED
WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE AND AGAINST
INFRINGEMENT ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR
CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
/* This source has been modified from the original source for the LibTomCrypt project
* by Tom St Denis. (Warnings fixed and code GNU indented)
*/
#include "tomcrypt.h"
#ifdef NLS_MODE
#define NLS_LONG_OUTPUT 1
#define N 17
#define NMAC 8
#define WORDSIZE 32
#define F16 0x10001ul
#define MACKONST 8
/* interface, multiplication table and SBox */
#include "nlssbox.inc"
#include "nlsmultab.inc"
/*
* FOLD is how many register cycles need to be performed after combining the
* last byte of key and non-linear feedback, before every byte depends on every
* byte of the key. This depends on the feedback and nonlinear functions, and
* on where they are combined into the register.
*/
#define FOLD N /* how many iterations of folding to do */
#define INITKONST 0x6996c53a /* value of KONST to use during key loading */
#define KEYP 15 /* where to insert key words */
#define FOLDP 4 /* where to insert non-linear feedback */
#if NLS_LONG_OUTPUT
#define CTRP 2 /* where to insert counter to avoid small cycles */
#endif /*NLS_LONG_OUTPUT */
#define Byte(x,i) ((unsigned char)(((x) >> (8*i)) & 0xFF))
/* define IS_LITTLE_ENDIAN for faster operation when appropriate */
#if defined(ENDIAN_LITTLE) && defined(ENDIAN_32BITWORD)
/* Useful macros -- little endian words on a little endian machine */
#define BYTE2WORD(b) (*(ulong32 *)(b))
#define WORD2BYTE(w, b) ((*(ulong32 *)(b)) = w)
#define XORWORD(w, b) ((*(ulong32 *)(b)) ^= w)
#else
/* Useful macros -- machine independent little-endian version */
#define BYTE2WORD(b) ( \
(((ulong32)(b)[3] & 0xFF)<<24) | \
(((ulong32)(b)[2] & 0xFF)<<16) | \
(((ulong32)(b)[1] & 0xFF)<<8) | \
(((ulong32)(b)[0] & 0xFF)) \
)
#define WORD2BYTE(w, b) { \
(b)[3] = Byte(w,3); \
(b)[2] = Byte(w,2); \
(b)[1] = Byte(w,1); \
(b)[0] = Byte(w,0); \
}
#define XORWORD(w, b) { \
(b)[3] ^= Byte(w,3); \
(b)[2] ^= Byte(w,2); \
(b)[1] ^= Byte(w,1); \
(b)[0] ^= Byte(w,0); \
}
#endif
#if NLS_LONG_OUTPUT
#define ZEROCOUNTER(c) c->CtrModF16 = c->CtrMod232 = 0
#else
#define ZEROCOUNTER(c) /* nothing */
#endif /*NLS_LONG_OUTPUT */
/* give correct offset for the current position of the register,
* where logically R[0] is at position "zero".
*/
#define OFF(zero, i) (((zero)+(i)) % N)
#if NLS_LONG_OUTPUT
/* Increment counter and mix into register every so often */
#define FIXCTR(c,z) \
{ \
if (++c->CtrModF16 == F16) { \
c->CtrMod232 += c->CtrModF16; \
c->R[OFF(z,CTRP)] += c->CtrMod232; \
c->CtrMod232 = 0; \
} \
}
#endif /*NLS_LONG_OUTPUT */
/* step the shift register */
/* After stepping, "zero" moves right one place */
#define STEP(c,z) \
{ register ulong32 tt; \
tt = ROL(c->R[OFF(z,0)],19) + ROL(c->R[OFF(z,15)],9) + c->konst; \
tt ^= Sbox[(tt >> 24) & 0xFF]; \
c->R[OFF(z,0)] = tt ^ c->R[OFF(z,4)]; \
}
static void cycle(nls_state * c)
{
ulong32 t;
int i;
/* nonlinear feedback function */
STEP(c, 0);
/* shift register */
t = c->R[0];
for (i = 1; i < N; ++i)
c->R[i - 1] = c->R[i];
c->R[N - 1] = t;
#if NLS_LONG_OUTPUT
FIXCTR(c, 0);
#endif /*NLS_LONG_OUTPUT */
}
/* Return a non-linear function of some parts of the register.
*/
#define NLFUNC(c,z) \
(c->R[OFF(z,0)] + c->R[OFF(z,16)]) \
^ (c->R[OFF(z,1)] + c->konst) \
^ (c->R[OFF(z,6)] + c->R[OFF(z,13)])
static ulong32 nltap(nls_state * c)
{
return NLFUNC(c, 0);
}
/* The Mundja MAC function is modelled after the round function of SHA-256.
* The following lines establish aliases for the MAC accumulator, just
* so that the definition of that function looks more like FIPS-180-2.
*/
#define A c->M[0]
#define B c->M[1]
#define C c->M[2]
#define D c->M[3]
#define E c->M[4]
#define F c->M[5]
#define G c->M[6]
#define H c->M[7]
#define SIGMA0(x) (ROR((x), 2) ^ ROR((x), 13) ^ ROR((x), 22))
#define SIGMA1(x) (ROR((x), 6) ^ ROR((x), 11) ^ ROR((x), 25))
#define CHOOSE(x,y,z) (z ^ (x & (y ^ z)))
#define MAJORITY(x,y,z) ((x & y) | (z & (x | y)))
/* Accumulate a nonlinear function of a register word and an input word for MAC.
* Except for the added S-Box and SOBER LFSR input instead of constants,
* this is exactly a round of SHA-256.
*/
#define SHAFUNC(c,i,k,A,B,C,D,E,F,G,H) \
{ \
ulong32 t1; \
t1 = H + k + i; \
t1 ^= Sbox[(t1 >> 24) & 0xFF]; \
t1 += SIGMA1(E) + CHOOSE(E, F, G); \
D += t1; \
t1 += SIGMA0(A) + MAJORITY(A, B, C); \
H = t1; \
}
static void shafunc(nls_state * c, ulong32 i)
{
ulong32 t;
SHAFUNC(c, i, c->R[MACKONST], A, B, C, D, E, F, G, H);
/* now correct alignment of MAC accumulator */
t = c->M[NMAC - 1];
for (i = NMAC - 1; i > 0; --i)
c->M[i] = c->M[i - 1];
c->M[0] = t;
}
/* Accumulate a CRC of input words, later to be fed into MAC.
*/
#define CRCFUNC(c,i,zero,five) \
{ \
ulong32 t1; \
t1 = (c->CRC[zero] << 8) ^ Multab[(c->CRC[zero] >> 24) & 0xFF] \
^ c->CRC[five] ^ i; \
c->CRC[zero] = t1; \
}
static void crcfunc(nls_state * c, ulong32 i)
{
ulong32 t;
CRCFUNC(c, i, 0, 5);
/* now correct alignment of CRC accumulator */
t = c->CRC[0];
for (i = 1; i < NMAC; ++i)
c->CRC[i - 1] = c->CRC[i];
c->CRC[NMAC - 1] = t;
}
/* Normal MAC word processing: do both SHA and CRC.
*/
static void macfunc(nls_state * c, ulong32 i)
{
crcfunc(c, i);
shafunc(c, i);
}
/* initialise to known state
*/
static void nls_initstate(nls_state * c)
{
int i;
/* Register initialised to Fibonacci numbers */
c->R[0] = 1;
c->R[1] = 1;
for (i = 2; i < N; ++i)
c->R[i] = c->R[i - 1] + c->R[i - 2];
c->konst = INITKONST;
ZEROCOUNTER(c);
}
/* Save the current register state
*/
static void nls_savestate(nls_state * c)
{
int i;
for (i = 0; i < N; ++i)
c->initR[i] = c->R[i];
}
/* initialise to previously saved register state
*/
static void nls_reloadstate(nls_state * c)
{
int i;
for (i = 0; i < N; ++i)
c->R[i] = c->initR[i];
ZEROCOUNTER(c);
}
/* Initialise "konst"
*/
static void nls_genkonst(nls_state * c)
{
ulong32 newkonst;
do {
cycle(c);
newkonst = nltap(c);
}
while ((newkonst & 0xFF000000) == 0);
c->konst = newkonst;
}
/* Load key material into the register
*/
#define ADDKEY(k) \
c->R[KEYP] += (k);
#define XORNL(nl) \
c->R[FOLDP] ^= (nl);
/* nonlinear diffusion of register for key and MAC */
#define DROUND(z) STEP(c,z); c->R[OFF((z+1),FOLDP)] ^= NLFUNC(c,(z+1));
static void nls_diffuse(nls_state * c)
{
/* relies on FOLD == N! */
DROUND(0);
DROUND(1);
DROUND(2);
DROUND(3);
DROUND(4);
DROUND(5);
DROUND(6);
DROUND(7);
DROUND(8);
DROUND(9);
DROUND(10);
DROUND(11);
DROUND(12);
DROUND(13);
DROUND(14);
DROUND(15);
DROUND(16);
}
/* common actions for loading key material */
static void
nls_loadkey(nls_state * c, const unsigned char *key, unsigned long keylen)
{
ulong32 i, k;
/* start folding in key, reject odd sized keys */
if ((keylen & 3) != 0)
abort();
for (i = 0; i < keylen; i += 4) {
k = BYTE2WORD(&key[i]);
ADDKEY(k);
cycle(c);
XORNL(nltap(c));
}
/* also fold in the length of the key */
ADDKEY(keylen);
/* now diffuse */
nls_diffuse(c);
}
/* initialise MAC related registers
*/
static void nls_macinit(nls_state * c)
{
int i;
for (i = 0; i < NMAC; ++i) {
c->M[i] = c->R[i];
c->CRC[i] = c->R[i + NMAC];
}
}
/* Published "key" interface
*/
int nls_key(nls_state * c, const unsigned char *key, unsigned long keylen)
{
LTC_ARGCHK(c != NULL);
LTC_ARGCHK(key != NULL);
if (keylen == 0) {
return CRYPT_INVALID_ARG;
}
nls_initstate(c);
nls_loadkey(c, key, keylen);
nls_genkonst(c);
nls_savestate(c);
nls_macinit(c);
c->nbuf = 0;
ZEROCOUNTER(c);
return CRYPT_OK;
}
/* Published "nonce" interface
*/
int
nls_nonce(nls_state * c, const unsigned char *nonce, unsigned long noncelen)
{
LTC_ARGCHK(c != NULL);
LTC_ARGCHK(nonce != NULL);
if (noncelen == 0) {
return CRYPT_INVALID_ARG;
}
nls_reloadstate(c);
nls_loadkey(c, nonce, noncelen);
nls_macinit(c);
c->nbuf = 0;
ZEROCOUNTER(c);
return CRYPT_OK;
}
#if 0
/* XOR pseudo-random bytes into buffer
* Note: doesn't play well with MAC functions.
*/
#define SROUND(z) STEP(c,z); t = NLFUNC(c,(z+1)); XORWORD(t, buf+(z*4));
static void
nls_stream(nls_state * c, unsigned char *buf, unsigned long nbytes)
{
ulong32 t = 0;
/* handle any previously buffered bytes */
while (c->nbuf != 0 && nbytes != 0) {
*buf++ ^= c->sbuf & 0xFF;
c->sbuf >>= 8;
c->nbuf -= 8;
--nbytes;
}
/* do lots at a time, if there's enough to do */
while (nbytes >= N * 4) {
#if NLS_LONG_OUTPUT
if (c->CtrModF16 < (F16 - 17)) {
#endif /*NLS_LONG_OUTPUT */
SROUND(0);
SROUND(1);
SROUND(2);
SROUND(3);
SROUND(4);
SROUND(5);
SROUND(6);
SROUND(7);
SROUND(8);
SROUND(9);
SROUND(10);
SROUND(11);
SROUND(12);
SROUND(13);
SROUND(14);
SROUND(15);
SROUND(16);
#if NLS_LONG_OUTPUT
c->CtrModF16 += 17;
} else {
SROUND(0);
FIXCTR(c, 1);
SROUND(1);
FIXCTR(c, 2);
SROUND(2);
FIXCTR(c, 3);
SROUND(3);
FIXCTR(c, 4);
SROUND(4);
FIXCTR(c, 5);
SROUND(5);
FIXCTR(c, 6);
SROUND(6);
FIXCTR(c, 7);
SROUND(7);
FIXCTR(c, 8);
SROUND(8);
FIXCTR(c, 9);
SROUND(9);
FIXCTR(c, 10);
SROUND(10);
FIXCTR(c, 11);
SROUND(11);
FIXCTR(c, 12);
SROUND(12);
FIXCTR(c, 13);
SROUND(13);
FIXCTR(c, 14);
SROUND(14);
FIXCTR(c, 15);
SROUND(15);
FIXCTR(c, 16);
SROUND(16);
FIXCTR(c, 0);
}
#endif /*NLS_LONG_OUTPUT */
buf += 4 * N;
nbytes -= N * 4;
}
/* do small or odd size buffers the slow way */
while (4 <= nbytes) {
cycle(c);
t = nltap(c);
XORWORD(t, buf);
buf += 4;
nbytes -= 4;
}
/* handle any trailing bytes */
if (nbytes != 0) {
cycle(c);
c->sbuf = nltap(c);
c->nbuf = 32;
while (c->nbuf != 0 && nbytes != 0) {
*buf++ ^= c->sbuf & 0xFF;
c->sbuf >>= 8;
c->nbuf -= 8;
--nbytes;
}
}
}
#endif
/* accumulate words into MAC without encryption
* Note that plaintext is accumulated for MAC.
*/
#define MROUND(z,A,B,C,D,E,F,G,H) \
t = BYTE2WORD(buf+(z*4)); \
STEP(c,z); \
CRCFUNC(c,t,((z)&0x7),(((z)+5)&0x7)); \
SHAFUNC(c,t,c->R[OFF(z+1,MACKONST)],A,B,C,D,E,F,G,H);
int nls_maconly(nls_state * c, const unsigned char *buf, unsigned long nbytes)
{
int i;
ulong32 t = 0;
LTC_ARGCHK(c != NULL);
LTC_ARGCHK(buf != NULL);
/* handle any previously buffered bytes */
if (c->nbuf != 0) {
while (c->nbuf != 0 && nbytes != 0) {
c->mbuf ^= (*buf++) << (32 - c->nbuf);
c->nbuf -= 8;
--nbytes;
}
if (c->nbuf != 0) { /* not a whole word yet */
return CRYPT_OK;
}
/* LFSR already cycled */
macfunc(c, c->mbuf);
}
/* do lots at a time, if there's enough to do */
while (4 * N <= nbytes) {
#if NLS_LONG_OUTPUT
if (c->CtrModF16 < (F16 - 17)) {
#endif /*NLS_LONG_OUTPUT */
MROUND(0, A, B, C, D, E, F, G, H);
MROUND(1, H, A, B, C, D, E, F, G);
MROUND(2, G, H, A, B, C, D, E, F);
MROUND(3, F, G, H, A, B, C, D, E);
MROUND(4, E, F, G, H, A, B, C, D);
MROUND(5, D, E, F, G, H, A, B, C);
MROUND(6, C, D, E, F, G, H, A, B);
MROUND(7, B, C, D, E, F, G, H, A);
MROUND(8, A, B, C, D, E, F, G, H);
MROUND(9, H, A, B, C, D, E, F, G);
MROUND(10, G, H, A, B, C, D, E, F);
MROUND(11, F, G, H, A, B, C, D, E);
MROUND(12, E, F, G, H, A, B, C, D);
MROUND(13, D, E, F, G, H, A, B, C);
MROUND(14, C, D, E, F, G, H, A, B);
MROUND(15, B, C, D, E, F, G, H, A);
MROUND(16, A, B, C, D, E, F, G, H);
#if NLS_LONG_OUTPUT
c->CtrModF16 += 17;
} else {
MROUND(0, A, B, C, D, E, F, G, H);
FIXCTR(c, 1);
MROUND(1, H, A, B, C, D, E, F, G);
FIXCTR(c, 2);
MROUND(2, G, H, A, B, C, D, E, F);
FIXCTR(c, 3);
MROUND(3, F, G, H, A, B, C, D, E);
FIXCTR(c, 4);
MROUND(4, E, F, G, H, A, B, C, D);
FIXCTR(c, 5);
MROUND(5, D, E, F, G, H, A, B, C);
FIXCTR(c, 6);
MROUND(6, C, D, E, F, G, H, A, B);
FIXCTR(c, 7);
MROUND(7, B, C, D, E, F, G, H, A);
FIXCTR(c, 8);
MROUND(8, A, B, C, D, E, F, G, H);
FIXCTR(c, 9);
MROUND(9, H, A, B, C, D, E, F, G);
FIXCTR(c, 10);
MROUND(10, G, H, A, B, C, D, E, F);
FIXCTR(c, 11);
MROUND(11, F, G, H, A, B, C, D, E);
FIXCTR(c, 12);
MROUND(12, E, F, G, H, A, B, C, D);
FIXCTR(c, 13);
MROUND(13, D, E, F, G, H, A, B, C);
FIXCTR(c, 14);
MROUND(14, C, D, E, F, G, H, A, B);
FIXCTR(c, 15);
MROUND(15, B, C, D, E, F, G, H, A);
FIXCTR(c, 16);
MROUND(16, A, B, C, D, E, F, G, H);
FIXCTR(c, 0);
}
#endif /*NLS_LONG_OUTPUT */
buf += 4 * N;
nbytes -= 4 * N;
/* fix alignment of MAC buffer */
t = c->M[NMAC - 1];
for (i = NMAC - 1; i > 0; --i)
c->M[i] = c->M[i - 1];
c->M[0] = t;
/* fix alignment of CRC buffer */
t = c->CRC[0];
for (i = 1; i < NMAC; ++i)
c->CRC[i - 1] = c->CRC[i];
c->CRC[NMAC - 1] = t;
}
/* do small or odd size buffers the slow way */
while (4 <= nbytes) {
cycle(c);
macfunc(c, BYTE2WORD(buf));
buf += 4;
nbytes -= 4;
}
/* handle any trailing bytes */
if (nbytes != 0) {
cycle(c);
c->sbuf = nltap(c);
c->mbuf = 0;
c->nbuf = 32;
while (nbytes != 0) {
c->mbuf ^= (*buf++) << (32 - c->nbuf);
c->nbuf -= 8;
--nbytes;
}
}
return CRYPT_OK;
}
/* Combined MAC and encryption.
* Note that plaintext is accumulated for MAC.
*/
#define EROUND(z,A,B,C,D,E,F,G,H) \
STEP(c,z); \
t3 = BYTE2WORD(buf+(z*4)); \
CRCFUNC(c,t3,((z)&0x7),(((z)+5)&0x7)); \
SHAFUNC(c,t3,c->R[OFF(z+1,MACKONST)],A,B,C,D,E,F,G,H); \
t = NLFUNC(c,(z+1)); \
t ^= t3; \
WORD2BYTE(t,buf+(z*4));
int nls_encrypt(nls_state * c,
const unsigned char *pt, unsigned long nbytes,
unsigned char *ct)
{
ulong32 t = 0, t3 = 0;
int i;
LTC_ARGCHK(c != NULL);
LTC_ARGCHK(pt != NULL);
LTC_ARGCHK(ct != NULL);
#define buf ct
/* do copy as required */
if (pt != ct) {
XMEMCPY(ct, pt, nbytes);
}
/* handle any previously buffered bytes */
if (c->nbuf != 0) {
while (c->nbuf != 0 && nbytes != 0) {
c->mbuf ^= *buf << (32 - c->nbuf);
*buf ^= (c->sbuf >> (32 - c->nbuf)) & 0xFF;
++buf;
c->nbuf -= 8;
--nbytes;
}
if (c->nbuf != 0) /* not a whole word yet */
return CRYPT_OK;
/* LFSR already cycled */
macfunc(c, c->mbuf);
}
/* do lots at a time, if there's enough to do */
while (4 * N <= nbytes) {
#if NLS_LONG_OUTPUT
if (c->CtrModF16 < (F16 - 17)) {
#endif /*NLS_LONG_OUTPUT */
EROUND(0, A, B, C, D, E, F, G, H);
EROUND(1, H, A, B, C, D, E, F, G);
EROUND(2, G, H, A, B, C, D, E, F);
EROUND(3, F, G, H, A, B, C, D, E);
EROUND(4, E, F, G, H, A, B, C, D);
EROUND(5, D, E, F, G, H, A, B, C);
EROUND(6, C, D, E, F, G, H, A, B);
EROUND(7, B, C, D, E, F, G, H, A);
EROUND(8, A, B, C, D, E, F, G, H);
EROUND(9, H, A, B, C, D, E, F, G);
EROUND(10, G, H, A, B, C, D, E, F);
EROUND(11, F, G, H, A, B, C, D, E);
EROUND(12, E, F, G, H, A, B, C, D);
EROUND(13, D, E, F, G, H, A, B, C);
EROUND(14, C, D, E, F, G, H, A, B);
EROUND(15, B, C, D, E, F, G, H, A);
EROUND(16, A, B, C, D, E, F, G, H);
#if NLS_LONG_OUTPUT
c->CtrModF16 += 17;
} else {
EROUND(0, A, B, C, D, E, F, G, H);
FIXCTR(c, 1);
EROUND(1, H, A, B, C, D, E, F, G);
FIXCTR(c, 2);
EROUND(2, G, H, A, B, C, D, E, F);
FIXCTR(c, 3);
EROUND(3, F, G, H, A, B, C, D, E);
FIXCTR(c, 4);
EROUND(4, E, F, G, H, A, B, C, D);
FIXCTR(c, 5);
EROUND(5, D, E, F, G, H, A, B, C);
FIXCTR(c, 6);
EROUND(6, C, D, E, F, G, H, A, B);
FIXCTR(c, 7);
EROUND(7, B, C, D, E, F, G, H, A);
FIXCTR(c, 8);
EROUND(8, A, B, C, D, E, F, G, H);
FIXCTR(c, 9);
EROUND(9, H, A, B, C, D, E, F, G);
FIXCTR(c, 10);
EROUND(10, G, H, A, B, C, D, E, F);
FIXCTR(c, 11);
EROUND(11, F, G, H, A, B, C, D, E);
FIXCTR(c, 12);
EROUND(12, E, F, G, H, A, B, C, D);
FIXCTR(c, 13);
EROUND(13, D, E, F, G, H, A, B, C);
FIXCTR(c, 14);
EROUND(14, C, D, E, F, G, H, A, B);
FIXCTR(c, 15);
EROUND(15, B, C, D, E, F, G, H, A);
FIXCTR(c, 16);
EROUND(16, A, B, C, D, E, F, G, H);
FIXCTR(c, 0);
}
#endif /*NLS_LONG_OUTPUT */
buf += 4 * N;
nbytes -= 4 * N;
/* fix alignment of MAC buffer */
t = c->M[7];
for (i = NMAC - 1; i > 0; --i)
c->M[i] = c->M[i - 1];
c->M[0] = t;
/* fix alignment of CRC buffer */
t = c->CRC[0];
for (i = 1; i < NMAC; ++i)
c->CRC[i - 1] = c->CRC[i];
c->CRC[NMAC - 1] = t;
}
/* do small or odd size buffers the slow way */
while (4 <= nbytes) {
cycle(c);
t = BYTE2WORD(buf);
macfunc(c, t);
t ^= nltap(c);
WORD2BYTE(t, buf);
nbytes -= 4;
buf += 4;
}
/* handle any trailing bytes */
if (nbytes != 0) {
cycle(c);
c->sbuf = nltap(c);
c->mbuf = 0;
c->nbuf = 32;
while (c->nbuf != 0 && nbytes != 0) {
c->mbuf ^= *buf << (32 - c->nbuf);
*buf ^= (c->sbuf >> (32 - c->nbuf)) & 0xFF;
++buf;
c->nbuf -= 8;
--nbytes;
}
}
#undef buf
return CRYPT_OK;
}
/* Combined MAC and decryption.
* Note that plaintext is accumulated for MAC.
*/
#undef DROUND
#define DROUND(z,A,B,C,D,E,F,G,H) \
STEP(c,z); \
t = NLFUNC(c,(z+1)); \
t3 = BYTE2WORD(buf+(z*4)); \
t ^= t3; \
CRCFUNC(c,t,((z)&0x7),(((z)+5)&0x7)); \
SHAFUNC(c,t,c->R[OFF(z+1,MACKONST)],A,B,C,D,E,F,G,H); \
WORD2BYTE(t, buf+(z*4));
int nls_decrypt(nls_state * c,
const unsigned char *ct, unsigned long nbytes,
unsigned char *pt)
{
ulong32 t = 0, t3 = 0;
int i;
LTC_ARGCHK(c != NULL);
LTC_ARGCHK(pt != NULL);
LTC_ARGCHK(ct != NULL);
#define buf pt
if (pt != ct) {
XMEMCPY(pt, ct, nbytes);
}
/* handle any previously buffered bytes */
if (c->nbuf != 0) {
while (c->nbuf != 0 && nbytes != 0) {
*buf ^= (c->sbuf >> (32 - c->nbuf)) & 0xFF;
c->mbuf ^= *buf << (32 - c->nbuf);
++buf;
c->nbuf -= 8;
--nbytes;
}
if (c->nbuf != 0) /* not a whole word yet */
return CRYPT_OK;
/* LFSR already cycled */
macfunc(c, c->mbuf);
}
/* now do lots at a time, if there's enough */
while (4 * N <= nbytes) {
#if NLS_LONG_OUTPUT
if (c->CtrModF16 < (F16 - 17)) {
#endif /*NLS_LONG_OUTPUT */
DROUND(0, A, B, C, D, E, F, G, H);
DROUND(1, H, A, B, C, D, E, F, G);
DROUND(2, G, H, A, B, C, D, E, F);
DROUND(3, F, G, H, A, B, C, D, E);
DROUND(4, E, F, G, H, A, B, C, D);
DROUND(5, D, E, F, G, H, A, B, C);
DROUND(6, C, D, E, F, G, H, A, B);
DROUND(7, B, C, D, E, F, G, H, A);
DROUND(8, A, B, C, D, E, F, G, H);
DROUND(9, H, A, B, C, D, E, F, G);
DROUND(10, G, H, A, B, C, D, E, F);
DROUND(11, F, G, H, A, B, C, D, E);
DROUND(12, E, F, G, H, A, B, C, D);
DROUND(13, D, E, F, G, H, A, B, C);
DROUND(14, C, D, E, F, G, H, A, B);
DROUND(15, B, C, D, E, F, G, H, A);
DROUND(16, A, B, C, D, E, F, G, H);
#if NLS_LONG_OUTPUT
c->CtrModF16 += 17;
} else {
DROUND(0, A, B, C, D, E, F, G, H);
FIXCTR(c, 1);
DROUND(1, H, A, B, C, D, E, F, G);
FIXCTR(c, 2);
DROUND(2, G, H, A, B, C, D, E, F);
FIXCTR(c, 3);
DROUND(3, F, G, H, A, B, C, D, E);
FIXCTR(c, 4);
DROUND(4, E, F, G, H, A, B, C, D);
FIXCTR(c, 5);
DROUND(5, D, E, F, G, H, A, B, C);
FIXCTR(c, 6);
DROUND(6, C, D, E, F, G, H, A, B);
FIXCTR(c, 7);
DROUND(7, B, C, D, E, F, G, H, A);
FIXCTR(c, 8);
DROUND(8, A, B, C, D, E, F, G, H);
FIXCTR(c, 9);
DROUND(9, H, A, B, C, D, E, F, G);
FIXCTR(c, 10);
DROUND(10, G, H, A, B, C, D, E, F);
FIXCTR(c, 11);
DROUND(11, F, G, H, A, B, C, D, E);
FIXCTR(c, 12);
DROUND(12, E, F, G, H, A, B, C, D);
FIXCTR(c, 13);
DROUND(13, D, E, F, G, H, A, B, C);
FIXCTR(c, 14);
DROUND(14, C, D, E, F, G, H, A, B);
FIXCTR(c, 15);
DROUND(15, B, C, D, E, F, G, H, A);
FIXCTR(c, 16);
DROUND(16, A, B, C, D, E, F, G, H);
FIXCTR(c, 0);
}
#endif /*NLS_LONG_OUTPUT */
buf += 4 * N;
nbytes -= 4 * N;
/* fix alignment of MAC buffer */
t = c->M[7];
for (i = NMAC - 1; i > 0; --i)
c->M[i] = c->M[i - 1];
c->M[0] = t;
/* fix alignment of CRC buffer */
t = c->CRC[0];
for (i = 1; i < NMAC; ++i)
c->CRC[i - 1] = c->CRC[i];
c->CRC[NMAC - 1] = t;
}
/* do small or odd size buffers the slow way */
while (4 <= nbytes) {
cycle(c);
t = nltap(c);
t3 = BYTE2WORD(buf);
t ^= t3;
macfunc(c, t);
WORD2BYTE(t, buf);
nbytes -= 4;
buf += 4;
}
/* handle any trailing bytes */
if (nbytes != 0) {
cycle(c);
c->sbuf = nltap(c);
c->mbuf = 0;
c->nbuf = 32;
while (c->nbuf != 0 && nbytes != 0) {
*buf ^= (c->sbuf >> (32 - c->nbuf)) & 0xFF;
c->mbuf ^= *buf << (32 - c->nbuf);
++buf;
c->nbuf -= 8;
--nbytes;
}
}
return CRYPT_OK;
#undef buf
}
/* Having accumulated a MAC, finish processing and return it.
* Note that any unprocessed bytes are treated as if
* they were encrypted zero bytes, so plaintext (zero) is accumulated.
*/
int nls_finish(nls_state * c, unsigned char *buf, unsigned long nbytes)
{
ulong32 i;
LTC_ARGCHK(c != NULL);
LTC_ARGCHK(buf != NULL);
/* handle any previously buffered bytes */
if (c->nbuf != 0) {
/* LFSR already cycled */
macfunc(c, c->mbuf);
}
/* perturb the MAC to mark end of input.
* Note that only the SHA part is updated, not the CRC. This is an
* action that can't be duplicated by passing in plaintext, hence
* defeating any kind of extension attack.
*/
cycle(c);
shafunc(c, INITKONST + (c->nbuf << 24));
c->nbuf = 0;
/* now add the CRC to the MAC like input material */
for (i = 0; i < NMAC; ++i) {
cycle(c);
crcfunc(c, 0);
shafunc(c, c->CRC[7]);
}
/* continue that process, producing output from the MAC buffer */
while (nbytes > 0) {
cycle(c);
crcfunc(c, 0);
shafunc(c, c->CRC[7]);
if (nbytes >= 4) {
WORD2BYTE(A, buf);
nbytes -= 4;
buf += 4;
} else {
for (i = 0; i < nbytes; ++i)
buf[i] = Byte(A, i);
break;
}
}
return CRYPT_OK;
}
#endif
/* $Source$ */
/* $Revision$ */
/* $Date$ */
src/encauth/nls/nlsmultab.inc
+68
View File
@@ -0,0 +1,68 @@
/* Id: nlsmultab.h 333 2005-04-13 05:35:54Z mwp */
/* Multiplication table for Mundja using 0xD02B4367 */
static const ulong32 Multab[256] = {
0x00000000, 0xD02B4367, 0xED5686CE, 0x3D7DC5A9,
0x97AC41D1, 0x478702B6, 0x7AFAC71F, 0xAAD18478,
0x631582EF, 0xB33EC188, 0x8E430421, 0x5E684746,
0xF4B9C33E, 0x24928059, 0x19EF45F0, 0xC9C40697,
0xC62A4993, 0x16010AF4, 0x2B7CCF5D, 0xFB578C3A,
0x51860842, 0x81AD4B25, 0xBCD08E8C, 0x6CFBCDEB,
0xA53FCB7C, 0x7514881B, 0x48694DB2, 0x98420ED5,
0x32938AAD, 0xE2B8C9CA, 0xDFC50C63, 0x0FEE4F04,
0xC154926B, 0x117FD10C, 0x2C0214A5, 0xFC2957C2,
0x56F8D3BA, 0x86D390DD, 0xBBAE5574, 0x6B851613,
0xA2411084, 0x726A53E3, 0x4F17964A, 0x9F3CD52D,
0x35ED5155, 0xE5C61232, 0xD8BBD79B, 0x089094FC,
0x077EDBF8, 0xD755989F, 0xEA285D36, 0x3A031E51,
0x90D29A29, 0x40F9D94E, 0x7D841CE7, 0xADAF5F80,
0x646B5917, 0xB4401A70, 0x893DDFD9, 0x59169CBE,
0xF3C718C6, 0x23EC5BA1, 0x1E919E08, 0xCEBADD6F,
0xCFA869D6, 0x1F832AB1, 0x22FEEF18, 0xF2D5AC7F,
0x58042807, 0x882F6B60, 0xB552AEC9, 0x6579EDAE,
0xACBDEB39, 0x7C96A85E, 0x41EB6DF7, 0x91C02E90,
0x3B11AAE8, 0xEB3AE98F, 0xD6472C26, 0x066C6F41,
0x09822045, 0xD9A96322, 0xE4D4A68B, 0x34FFE5EC,
0x9E2E6194, 0x4E0522F3, 0x7378E75A, 0xA353A43D,
0x6A97A2AA, 0xBABCE1CD, 0x87C12464, 0x57EA6703,
0xFD3BE37B, 0x2D10A01C, 0x106D65B5, 0xC04626D2,
0x0EFCFBBD, 0xDED7B8DA, 0xE3AA7D73, 0x33813E14,
0x9950BA6C, 0x497BF90B, 0x74063CA2, 0xA42D7FC5,
0x6DE97952, 0xBDC23A35, 0x80BFFF9C, 0x5094BCFB,
0xFA453883, 0x2A6E7BE4, 0x1713BE4D, 0xC738FD2A,
0xC8D6B22E, 0x18FDF149, 0x258034E0, 0xF5AB7787,
0x5F7AF3FF, 0x8F51B098, 0xB22C7531, 0x62073656,
0xABC330C1, 0x7BE873A6, 0x4695B60F, 0x96BEF568,
0x3C6F7110, 0xEC443277, 0xD139F7DE, 0x0112B4B9,
0xD31DD2E1, 0x03369186, 0x3E4B542F, 0xEE601748,
0x44B19330, 0x949AD057, 0xA9E715FE, 0x79CC5699,
0xB008500E, 0x60231369, 0x5D5ED6C0, 0x8D7595A7,
0x27A411DF, 0xF78F52B8, 0xCAF29711, 0x1AD9D476,
0x15379B72, 0xC51CD815, 0xF8611DBC, 0x284A5EDB,
0x829BDAA3, 0x52B099C4, 0x6FCD5C6D, 0xBFE61F0A,
0x7622199D, 0xA6095AFA, 0x9B749F53, 0x4B5FDC34,
0xE18E584C, 0x31A51B2B, 0x0CD8DE82, 0xDCF39DE5,
0x1249408A, 0xC26203ED, 0xFF1FC644, 0x2F348523,
0x85E5015B, 0x55CE423C, 0x68B38795, 0xB898C4F2,
0x715CC265, 0xA1778102, 0x9C0A44AB, 0x4C2107CC,
0xE6F083B4, 0x36DBC0D3, 0x0BA6057A, 0xDB8D461D,
0xD4630919, 0x04484A7E, 0x39358FD7, 0xE91ECCB0,
0x43CF48C8, 0x93E40BAF, 0xAE99CE06, 0x7EB28D61,
0xB7768BF6, 0x675DC891, 0x5A200D38, 0x8A0B4E5F,
0x20DACA27, 0xF0F18940, 0xCD8C4CE9, 0x1DA70F8E,
0x1CB5BB37, 0xCC9EF850, 0xF1E33DF9, 0x21C87E9E,
0x8B19FAE6, 0x5B32B981, 0x664F7C28, 0xB6643F4F,
0x7FA039D8, 0xAF8B7ABF, 0x92F6BF16, 0x42DDFC71,
0xE80C7809, 0x38273B6E, 0x055AFEC7, 0xD571BDA0,
0xDA9FF2A4, 0x0AB4B1C3, 0x37C9746A, 0xE7E2370D,
0x4D33B375, 0x9D18F012, 0xA06535BB, 0x704E76DC,
0xB98A704B, 0x69A1332C, 0x54DCF685, 0x84F7B5E2,
0x2E26319A, 0xFE0D72FD, 0xC370B754, 0x135BF433,
0xDDE1295C, 0x0DCA6A3B, 0x30B7AF92, 0xE09CECF5,
0x4A4D688D, 0x9A662BEA, 0xA71BEE43, 0x7730AD24,
0xBEF4ABB3, 0x6EDFE8D4, 0x53A22D7D, 0x83896E1A,
0x2958EA62, 0xF973A905, 0xC40E6CAC, 0x14252FCB,
0x1BCB60CF, 0xCBE023A8, 0xF69DE601, 0x26B6A566,
0x8C67211E, 0x5C4C6279, 0x6131A7D0, 0xB11AE4B7,
0x78DEE220, 0xA8F5A147, 0x958864EE, 0x45A32789,
0xEF72A3F1, 0x3F59E096, 0x0224253F, 0xD20F6658,
};
src/encauth/nls/nlssbox.inc
+84
View File
@@ -0,0 +1,84 @@
/* Id: nlssbox.h 333 2005-04-13 05:35:54Z mwp */
/* Sbox for NLS */
/*
* This is really the combination of two SBoxes; the least significant
* 24 bits comes from:
* 8->32 Sbox generated by Millan et. al. at Queensland University of
* Technology. See: E. Dawson, W. Millan, L. Burnett, G. Carter,
* "On the Design of 8*32 S-boxes". Unpublished report, by the
* Information Systems Research Centre,
* Queensland University of Technology, 1999.
*
* The most significant 8 bits are the Skipjack "F table", which can be
* found at http://csrc.nist.gov/CryptoToolkit/skipjack/skipjack.pdf .
* In this optimised table, though, the intent is to XOR the word from
* the table selected by the high byte with the input word. Thus, the
* high byte is actually the Skipjack F-table entry XORED with its
* table index.
*/
static const ulong32 Sbox[256] = {
0xa3aa1887, 0xd65e435c, 0x0b65c042, 0x800e6ef4,
0xfc57ee20, 0x4d84fed3, 0xf066c502, 0xf354e8ae,
0xbb2ee9d9, 0x281f38d4, 0x1f829b5d, 0x735cdf3c,
0x95864249, 0xbc2e3963, 0xa1f4429f, 0xf6432c35,
0xf7f40325, 0x3cc0dd70, 0x5f973ded, 0x9902dc5e,
0xda175b42, 0x590012bf, 0xdc94d78c, 0x39aab26b,
0x4ac11b9a, 0x8c168146, 0xc3ea8ec5, 0x058ac28f,
0x52ed5c0f, 0x25b4101c, 0x5a2db082, 0x370929e1,
0x2a1843de, 0xfe8299fc, 0x202fbc4b, 0x833915dd,
0x33a803fa, 0xd446b2de, 0x46233342, 0x4fcee7c3,
0x3ad607ef, 0x9e97ebab, 0x507f859b, 0xe81f2e2f,
0xc55b71da, 0xd7e2269a, 0x1339c3d1, 0x7ca56b36,
0xa6c9def2, 0xb5c9fc5f, 0x5927b3a3, 0x89a56ddf,
0xc625b510, 0x560f85a7, 0xace82e71, 0x2ecb8816,
0x44951e2a, 0x97f5f6af, 0xdfcbc2b3, 0xce4ff55d,
0xcb6b6214, 0x2b0b83e3, 0x549ea6f5, 0x9de041af,
0x792f1f17, 0xf73b99ee, 0x39a65ec0, 0x4c7016c6,
0x857709a4, 0xd6326e01, 0xc7b280d9, 0x5cfb1418,
0xa6aff227, 0xfd548203, 0x506b9d96, 0xa117a8c0,
0x9cd5bf6e, 0xdcee7888, 0x61fcfe64, 0xf7a193cd,
0x050d0184, 0xe8ae4930, 0x88014f36, 0xd6a87088,
0x6bad6c2a, 0x1422c678, 0xe9204de7, 0xb7c2e759,
0x0200248e, 0x013b446b, 0xda0d9fc2, 0x0414a895,
0x3a6cc3a1, 0x56fef170, 0x86c19155, 0xcf7b8a66,
0x551b5e69, 0xb4a8623e, 0xa2bdfa35, 0xc4f068cc,
0x573a6acd, 0x6355e936, 0x03602db9, 0x0edf13c1,
0x2d0bb16d, 0x6980b83c, 0xfeb23763, 0x3dd8a911,
0x01b6bc13, 0xf55579d7, 0xf55c2fa8, 0x19f4196e,
0xe7db5476, 0x8d64a866, 0xc06e16ad, 0xb17fc515,
0xc46feb3c, 0x8bc8a306, 0xad6799d9, 0x571a9133,
0x992466dd, 0x92eb5dcd, 0xac118f50, 0x9fafb226,
0xa1b9cef3, 0x3ab36189, 0x347a19b1, 0x62c73084,
0xc27ded5c, 0x6c8bc58f, 0x1cdde421, 0xed1e47fb,
0xcdcc715e, 0xb9c0ff99, 0x4b122f0f, 0xc4d25184,
0xaf7a5e6c, 0x5bbf18bc, 0x8dd7c6e0, 0x5fb7e420,
0x521f523f, 0x4ad9b8a2, 0xe9da1a6b, 0x97888c02,
0x19d1e354, 0x5aba7d79, 0xa2cc7753, 0x8c2d9655,
0x19829da1, 0x531590a7, 0x19c1c149, 0x3d537f1c,
0x50779b69, 0xed71f2b7, 0x463c58fa, 0x52dc4418,
0xc18c8c76, 0xc120d9f0, 0xafa80d4d, 0x3b74c473,
0xd09410e9, 0x290e4211, 0xc3c8082b, 0x8f6b334a,
0x3bf68ed2, 0xa843cc1b, 0x8d3c0ff3, 0x20e564a0,
0xf8f55a4f, 0x2b40f8e7, 0xfea7f15f, 0xcf00fe21,
0x8a6d37d6, 0xd0d506f1, 0xade00973, 0xefbbde36,
0x84670fa8, 0xfa31ab9e, 0xaedab618, 0xc01f52f5,
0x6558eb4f, 0x71b9e343, 0x4b8d77dd, 0x8cb93da6,
0x740fd52d, 0x425412f8, 0xc5a63360, 0x10e53ad0,
0x5a700f1c, 0x8324ed0b, 0xe53dc1ec, 0x1a366795,
0x6d549d15, 0xc5ce46d7, 0xe17abe76, 0x5f48e0a0,
0xd0f07c02, 0x941249b7, 0xe49ed6ba, 0x37a47f78,
0xe1cfffbd, 0xb007ca84, 0xbb65f4da, 0xb59f35da,
0x33d2aa44, 0x417452ac, 0xc0d674a7, 0x2d61a46a,
0xdc63152a, 0x3e12b7aa, 0x6e615927, 0xa14fb118,
0xa151758d, 0xba81687b, 0xe152f0b3, 0x764254ed,
0x34c77271, 0x0a31acab, 0x54f94aec, 0xb9e994cd,
0x574d9e81, 0x5b623730, 0xce8a21e8, 0x37917f0b,
0xe8a9b5d6, 0x9697adf8, 0xf3d30431, 0x5dcac921,
0x76b35d46, 0xaa430a36, 0xc2194022, 0x22bca65e,
0xdaec70ba, 0xdfaea8cc, 0x777bae8b, 0x242924d5,
0x1f098a5a, 0x4b396b81, 0x55de2522, 0x435c1cb8,
0xaeb8fe1d, 0x9db3c697, 0x5b164f83, 0xe0c16376,
0xa319224c, 0xd0203b35, 0x433ac0fe, 0x1466a19a,
0x45f0b24f, 0x51fda998, 0xc0d52d71, 0xfa0896a8,
0xf9e6053f, 0xa4b0d300, 0xd499cbcc, 0xb95e3d40,
};