diff options
author | Ashlee Young <ashlee@wildernessvoice.com> | 2016-01-20 01:10:01 +0000 |
---|---|---|
committer | Ashlee Young <ashlee@wildernessvoice.com> | 2016-01-20 01:10:11 +0000 |
commit | 19d701ddf07d855128ded0cf2b573ce468e3bdd6 (patch) | |
tree | 0edcd3461ca903c76e431bb7c6348c42a0f12488 /framework/src/suricata/src/util-crypt.c | |
parent | fac6fbefbfad1cf837ddd88bc0d330559c8eb6f9 (diff) |
Removing Suricata and Audit from source repo, and updated build.sh to avoid building suricata. Will re-address this in C release via tar balls.
Change-Id: I3710076f8b7f3313cb3cb5260c4eb0a6834d4f6e
Signed-off-by: Ashlee Young <ashlee@wildernessvoice.com>
Diffstat (limited to 'framework/src/suricata/src/util-crypt.c')
-rw-r--r-- | framework/src/suricata/src/util-crypt.c | 306 |
1 files changed, 0 insertions, 306 deletions
diff --git a/framework/src/suricata/src/util-crypt.c b/framework/src/suricata/src/util-crypt.c deleted file mode 100644 index a9d82013..00000000 --- a/framework/src/suricata/src/util-crypt.c +++ /dev/null @@ -1,306 +0,0 @@ -/* Copyright (C) 2007-2012 Open Information Security Foundation - * - * You can copy, redistribute or modify this Program under the terms of - * the GNU General Public License version 2 as published by the Free - * Software Foundation. - * - * This program is distributed in the hope that it will be useful, - * but WITHOUT ANY WARRANTY; without even the implied warranty of - * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the - * GNU General Public License for more details. - * - * You should have received a copy of the GNU General Public License - * version 2 along with this program; if not, write to the Free Software - * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA - * 02110-1301, USA. - */ - -/** - * \file - * - * \author Roliers Jean-Paul <popof.fpn@gmail.co> - * - * Implements cryptographic functions. - * Based on the libtomcrypt library ( http://libtom.org/?page=features&newsitems=5&whatfile=crypt ) - * - * Implementation of function using NSS is not linked with libtomcrypt. - */ - -#include "suricata-common.h" -#include "suricata.h" -#include "util-crypt.h" -#ifdef HAVE_NSS -#include <sechash.h> -#endif - -#ifndef HAVE_NSS - -#define F0(x,y,z) (z ^ (x & (y ^ z))) -#define F1(x,y,z) (x ^ y ^ z) -#define F2(x,y,z) ((x & y) | (z & (x | y))) -#define F3(x,y,z) (x ^ y ^ z) - - -static int Sha1Compress(HashState *md, unsigned char *buf) -{ - uint32_t a,b,c,d,e,W[80],i; - /* copy the state into 512-bits into W[0..15] */ - for (i = 0; i < 16; i++) { - LOAD32H(W[i], buf + (4*i)); - } - - /* copy state */ - a = md->sha1.state[0]; - b = md->sha1.state[1]; - c = md->sha1.state[2]; - d = md->sha1.state[3]; - e = md->sha1.state[4]; - - /* expand it */ - for (i = 16; i < 80; i++) { - W[i] = ROL(W[i-3] ^ W[i-8] ^ W[i-14] ^ W[i-16], 1); - } - - /* compress */ - /* round one */ - #define FF0(a,b,c,d,e,i) e = (ROLc(a, 5) + F0(b,c,d) + e + W[i] + 0x5a827999UL); b = ROLc(b, 30); - #define FF1(a,b,c,d,e,i) e = (ROLc(a, 5) + F1(b,c,d) + e + W[i] + 0x6ed9eba1UL); b = ROLc(b, 30); - #define FF2(a,b,c,d,e,i) e = (ROLc(a, 5) + F2(b,c,d) + e + W[i] + 0x8f1bbcdcUL); b = ROLc(b, 30); - #define FF3(a,b,c,d,e,i) e = (ROLc(a, 5) + F3(b,c,d) + e + W[i] + 0xca62c1d6UL); b = ROLc(b, 30); - - for (i = 0; i < 20; ) { - FF0(a,b,c,d,e,i++); - FF0(e,a,b,c,d,i++); - FF0(d,e,a,b,c,i++); - FF0(c,d,e,a,b,i++); - FF0(b,c,d,e,a,i++); - } - - /* round two */ - for (; i < 40; ) { - FF1(a,b,c,d,e,i++); - FF1(e,a,b,c,d,i++); - FF1(d,e,a,b,c,i++); - FF1(c,d,e,a,b,i++); - FF1(b,c,d,e,a,i++); - } - - /* round three */ - for (; i < 60; ) { - FF2(a,b,c,d,e,i++); - FF2(e,a,b,c,d,i++); - FF2(d,e,a,b,c,i++); - FF2(c,d,e,a,b,i++); - FF2(b,c,d,e,a,i++); - } - - /* round four */ - for (; i < 80; ) { - FF3(a,b,c,d,e,i++); - FF3(e,a,b,c,d,i++); - FF3(d,e,a,b,c,i++); - FF3(c,d,e,a,b,i++); - FF3(b,c,d,e,a,i++); - } - - #undef FF0 - #undef FF1 - #undef FF2 - #undef FF3 - - /* store */ - md->sha1.state[0] = md->sha1.state[0] + a; - md->sha1.state[1] = md->sha1.state[1] + b; - md->sha1.state[2] = md->sha1.state[2] + c; - md->sha1.state[3] = md->sha1.state[3] + d; - md->sha1.state[4] = md->sha1.state[4] + e; - - return SC_SHA_1_OK; -} - -static int Sha1Init(HashState * md) -{ - if(md == NULL) - { - return SC_SHA_1_NOK; - } - md->sha1.state[0] = 0x67452301UL; - md->sha1.state[1] = 0xefcdab89UL; - md->sha1.state[2] = 0x98badcfeUL; - md->sha1.state[3] = 0x10325476UL; - md->sha1.state[4] = 0xc3d2e1f0UL; - md->sha1.curlen = 0; - md->sha1.length = 0; - return SC_SHA_1_OK; -} - -static int Sha1Process (HashState * md, const unsigned char *in, unsigned long inlen) -{ - if(md == NULL || in == NULL) { - return SC_SHA_1_INVALID_ARG; - } - - unsigned long n; - int err; - - if (md->sha1.curlen > sizeof(md->sha1.buf)) { - return SC_SHA_1_INVALID_ARG; - } - while (inlen > 0) { - if (md-> sha1.curlen == 0 && inlen >= 64) { - if ((err = Sha1Compress(md, (unsigned char *)in)) != SC_SHA_1_OK) { - return err; - } - md-> sha1 .length += 64 * 8; - in += 64; - inlen -= 64; - } else { - n = MIN(inlen, (64 - md-> sha1 .curlen)); - memcpy(md-> sha1 .buf + md-> sha1.curlen, in, (size_t)n); - md-> sha1 .curlen += n; - in += n; - inlen -= n; - if (md-> sha1 .curlen == 64) { - if ((err = Sha1Compress(md, md-> sha1 .buf)) != SC_SHA_1_OK) { - return err; - } - md-> sha1 .length += 8*64; - md-> sha1 .curlen = 0; - } - } - } - return SC_SHA_1_OK; -} - - - -static int Sha1Done(HashState * md, unsigned char *out) -{ - int i; - - if (md == NULL || out == NULL) - { - return SC_SHA_1_NOK; - } - - if (md->sha1.curlen >= sizeof(md->sha1.buf)) { - return SC_SHA_1_INVALID_ARG; - } - - /* increase the length of the message */ - md->sha1.length += md->sha1.curlen * 8; - - /* append the '1' bit */ - md->sha1.buf[md->sha1.curlen++] = (unsigned char)0x80; - - /* if the length is currently above 56 bytes we append zeros - * then compress. Then we can fall back to padding zeros and length - * encoding like normal. - */ - if (md->sha1.curlen > 56) { - while (md->sha1.curlen < 64) { - md->sha1.buf[md->sha1.curlen++] = (unsigned char)0; - } - Sha1Compress(md, md->sha1.buf); - md->sha1.curlen = 0; - } - - /* pad upto 56 bytes of zeroes */ - while (md->sha1.curlen < 56) { - md->sha1.buf[md->sha1.curlen++] = (unsigned char)0; - } - - /* store length */ - STORE64H(md->sha1.length, md->sha1.buf+56); - Sha1Compress(md, md->sha1.buf); - - /* copy output */ - for (i = 0; i < 5; i++) { - STORE32H(md->sha1.state[i], out+(4*i)); - } - - memset(md, 0, sizeof(HashState)); - - return SC_SHA_1_OK; -} - -unsigned char* ComputeSHA1(unsigned char* buff, int bufflen) -{ - HashState md; - unsigned char* lResult = (unsigned char*) SCMalloc((sizeof(unsigned char) * 20)); - if (lResult == NULL) - return NULL; - Sha1Init(&md); - Sha1Process(&md, buff, bufflen); - Sha1Done(&md, lResult); - return lResult; -} - -#else /* HAVE_NSS */ - -unsigned char* ComputeSHA1(unsigned char* buff, int bufflen) -{ - HASHContext *sha1_ctx = HASH_Create(HASH_AlgSHA1); - unsigned char* lResult = NULL; - unsigned int rlen; - if (sha1_ctx == NULL) { - return NULL; - } - - lResult = (unsigned char*) SCMalloc((sizeof(unsigned char) * 20)); - if (lResult == NULL) { - HASH_Destroy(sha1_ctx); - return NULL; - } - HASH_Begin(sha1_ctx); - HASH_Update(sha1_ctx, buff, bufflen); - HASH_End(sha1_ctx, lResult, &rlen, (sizeof(unsigned char) * 20)); - HASH_Destroy(sha1_ctx); - - return lResult; -} - -#endif /* HAVE_NSS */ - -static const char *b64codes = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"; - -int Base64Encode(const unsigned char *in, unsigned long inlen, - unsigned char *out, unsigned long *outlen) -{ - unsigned long i, len2, leven; - unsigned char *p; - if(in == NULL || out == NULL || outlen == NULL) - { - return SC_BASE64_INVALID_ARG; - } - /* valid output size ? */ - len2 = 4 * ((inlen + 2) / 3); - if (*outlen < len2 + 1) { - *outlen = len2 + 1; - return SC_BASE64_OVERFLOW; - } - p = out; - leven = 3*(inlen / 3); - for (i = 0; i < leven; i += 3) { - *p++ = b64codes[(in[0] >> 2) & 0x3F]; - *p++ = b64codes[(((in[0] & 3) << 4) + (in[1] >> 4)) & 0x3F]; - *p++ = b64codes[(((in[1] & 0xf) << 2) + (in[2] >> 6)) & 0x3F]; - *p++ = b64codes[in[2] & 0x3F]; - in += 3; - } - /* Pad it if necessary... */ - if (i < inlen) { - unsigned a = in[0]; - unsigned b = (i+1 < inlen) ? in[1] : 0; - - *p++ = b64codes[(a >> 2) & 0x3F]; - *p++ = b64codes[(((a & 3) << 4) + (b >> 4)) & 0x3F]; - *p++ = (i+1 < inlen) ? b64codes[(((b & 0xf) << 2)) & 0x3F] : '='; - *p++ = '='; - } - /* append a NULL byte */ - *p = '\0'; - /* return ok */ - *outlen = p - out; - return SC_BASE64_OK; -} |