File:  [ELWIX - Embedded LightWeight unIX -] / embedaddon / axTLS / crypto / md2.c
Revision 1.1.1.1 (vendor branch): download - view: text, annotated - select for diffs - revision graph
Fri Sep 28 11:55:55 2012 UTC (12 years, 3 months ago) by misho
Branches: v1_4_8, MAIN
CVS tags: datecs, HEAD
axTLS

    1: /*
    2:  * Copyright (c) 2007, Cameron Rich
    3:  * 
    4:  * All rights reserved.
    5:  * 
    6:  * Redistribution and use in source and binary forms, with or without 
    7:  * modification, are permitted provided that the following conditions are met:
    8:  *
    9:  * * Redistributions of source code must retain the above copyright notice, 
   10:  *   this list of conditions and the following disclaimer.
   11:  * * Redistributions in binary form must reproduce the above copyright notice, 
   12:  *   this list of conditions and the following disclaimer in the documentation 
   13:  *   and/or other materials provided with the distribution.
   14:  * * Neither the name of the axTLS project nor the names of its contributors 
   15:  *   may be used to endorse or promote products derived from this software 
   16:  *   without specific prior written permission.
   17:  *
   18:  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
   19:  * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
   20:  * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
   21:  * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
   22:  * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
   23:  * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
   24:  * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
   25:  * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
   26:  * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
   27:  * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
   28:  * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
   29:  */
   30: 
   31: /*
   32:  *  RFC 1115/1319 compliant MD2 implementation
   33:  *  The MD2 algorithm was designed by Ron Rivest in 1989.
   34:  *
   35:  *  http://www.ietf.org/rfc/rfc1115.txt
   36:  *  http://www.ietf.org/rfc/rfc1319.txt
   37:  */
   38: 
   39: #include <string.h>
   40: #include <stdio.h>
   41: #include "os_port.h"
   42: #include "crypto.h"
   43: 
   44: /**
   45:  * This code is only here to enable the verification of Verisign root
   46:  * certificates. So only enable it for verification mode.
   47:  */
   48: #ifdef CONFIG_SSL_CERT_VERIFICATION
   49: 
   50: static const uint8_t PI_SUBST[256] =
   51: {
   52:     0x29, 0x2E, 0x43, 0xC9, 0xA2, 0xD8, 0x7C, 0x01, 0x3D, 0x36,
   53:     0x54, 0xA1, 0xEC, 0xF0, 0x06, 0x13, 0x62, 0xA7, 0x05, 0xF3,
   54:     0xC0, 0xC7, 0x73, 0x8C, 0x98, 0x93, 0x2B, 0xD9, 0xBC, 0x4C,
   55:     0x82, 0xCA, 0x1E, 0x9B, 0x57, 0x3C, 0xFD, 0xD4, 0xE0, 0x16,
   56:     0x67, 0x42, 0x6F, 0x18, 0x8A, 0x17, 0xE5, 0x12, 0xBE, 0x4E,
   57:     0xC4, 0xD6, 0xDA, 0x9E, 0xDE, 0x49, 0xA0, 0xFB, 0xF5, 0x8E,
   58:     0xBB, 0x2F, 0xEE, 0x7A, 0xA9, 0x68, 0x79, 0x91, 0x15, 0xB2,
   59:     0x07, 0x3F, 0x94, 0xC2, 0x10, 0x89, 0x0B, 0x22, 0x5F, 0x21,
   60:     0x80, 0x7F, 0x5D, 0x9A, 0x5A, 0x90, 0x32, 0x27, 0x35, 0x3E,
   61:     0xCC, 0xE7, 0xBF, 0xF7, 0x97, 0x03, 0xFF, 0x19, 0x30, 0xB3,
   62:     0x48, 0xA5, 0xB5, 0xD1, 0xD7, 0x5E, 0x92, 0x2A, 0xAC, 0x56,
   63:     0xAA, 0xC6, 0x4F, 0xB8, 0x38, 0xD2, 0x96, 0xA4, 0x7D, 0xB6,
   64:     0x76, 0xFC, 0x6B, 0xE2, 0x9C, 0x74, 0x04, 0xF1, 0x45, 0x9D,
   65:     0x70, 0x59, 0x64, 0x71, 0x87, 0x20, 0x86, 0x5B, 0xCF, 0x65,
   66:     0xE6, 0x2D, 0xA8, 0x02, 0x1B, 0x60, 0x25, 0xAD, 0xAE, 0xB0,
   67:     0xB9, 0xF6, 0x1C, 0x46, 0x61, 0x69, 0x34, 0x40, 0x7E, 0x0F,
   68:     0x55, 0x47, 0xA3, 0x23, 0xDD, 0x51, 0xAF, 0x3A, 0xC3, 0x5C,
   69:     0xF9, 0xCE, 0xBA, 0xC5, 0xEA, 0x26, 0x2C, 0x53, 0x0D, 0x6E,
   70:     0x85, 0x28, 0x84, 0x09, 0xD3, 0xDF, 0xCD, 0xF4, 0x41, 0x81,
   71:     0x4D, 0x52, 0x6A, 0xDC, 0x37, 0xC8, 0x6C, 0xC1, 0xAB, 0xFA,
   72:     0x24, 0xE1, 0x7B, 0x08, 0x0C, 0xBD, 0xB1, 0x4A, 0x78, 0x88,
   73:     0x95, 0x8B, 0xE3, 0x63, 0xE8, 0x6D, 0xE9, 0xCB, 0xD5, 0xFE,
   74:     0x3B, 0x00, 0x1D, 0x39, 0xF2, 0xEF, 0xB7, 0x0E, 0x66, 0x58,
   75:     0xD0, 0xE4, 0xA6, 0x77, 0x72, 0xF8, 0xEB, 0x75, 0x4B, 0x0A,
   76:     0x31, 0x44, 0x50, 0xB4, 0x8F, 0xED, 0x1F, 0x1A, 0xDB, 0x99,
   77:     0x8D, 0x33, 0x9F, 0x11, 0x83, 0x14
   78: };
   79: 
   80: /*
   81:  * MD2 context setup
   82:  */
   83: EXP_FUNC void STDCALL MD2_Init(MD2_CTX *ctx)
   84: {
   85:     memset(ctx, 0, sizeof *ctx);
   86: }
   87: 
   88: static void md2_process(MD2_CTX *ctx)
   89: {
   90:     int i, j;
   91:     uint8_t t = 0;
   92: 
   93:     for (i = 0; i < 16; i++)
   94:     {
   95:         ctx->state[i + 16] = ctx->buffer[i];
   96:         ctx->state[i + 32] = ctx->buffer[i] ^ ctx->state[i];
   97:     }
   98: 
   99:     for (i = 0; i < 18; i++)
  100:     {
  101:         for (j = 0; j < 48; j++)
  102:             t = (ctx->state[j] ^= PI_SUBST[t]);
  103: 
  104:         t = (t + i) & 0xFF;
  105:     }
  106: 
  107:     t = ctx->cksum[15];
  108: 
  109:     for (i = 0; i < 16; i++)
  110:         t = (ctx->cksum[i] ^= PI_SUBST[ctx->buffer[i] ^ t]);
  111: }
  112: 
  113: /*
  114:  * MD2 process buffer
  115:  */
  116: EXP_FUNC void STDCALL MD2_Update(MD2_CTX *ctx, const uint8_t *input, int ilen)
  117: {
  118:     int fill;
  119: 
  120:     while (ilen > 0)
  121:     {
  122:         if (ctx->left + ilen > 16)
  123:             fill = 16 - ctx->left;
  124:         else
  125:             fill = ilen;
  126: 
  127:         memcpy(ctx->buffer + ctx->left, input, fill);
  128: 
  129:         ctx->left += fill;
  130:         input += fill;
  131:         ilen  -= fill;
  132: 
  133:         if (ctx->left == 16)
  134:         {
  135:             ctx->left = 0;
  136:             md2_process(ctx);
  137:         }
  138:     }
  139: }
  140: 
  141: /*
  142:  * MD2 final digest
  143:  */
  144: EXP_FUNC void STDCALL MD2_Final(uint8_t *output, MD2_CTX *ctx)
  145: {
  146:     int i;
  147:     uint8_t x;
  148: 
  149:     x = (uint8_t)(16 - ctx->left);
  150: 
  151:     for (i = ctx->left; i < 16; i++)
  152:         ctx->buffer[i] = x;
  153: 
  154:     md2_process(ctx);
  155: 
  156:     memcpy(ctx->buffer, ctx->cksum, 16);
  157:     md2_process(ctx);
  158: 
  159:     memcpy(output, ctx->state, 16);
  160: }
  161: 
  162: #endif

FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>