Skip to content
Snippets Groups Projects
Select Git revision
  • 2b5dcfed94d66a3207f8bbd6d043e17532a88db8
  • master default
  • jas-ci-test
  • wip-slh-dsa-sha2-128s
  • master-updates
  • release-3.10-fixes
  • getopt-prototype
  • fix-bcrypt-warning
  • refactor-hmac
  • wip-use-alignas
  • trim-sha3-context
  • fix-gitlab-ci
  • check-fat-emulate
  • delete-digest_func-size
  • slh-dsa-shake-128f-nettle
  • slh-dsa-shake-128s-nettle
  • slh-dsa-shake-128s
  • delete-openpgp
  • ppc64-sha512
  • delete-md5-compat
  • cleanup-hmac-tests
  • nettle_3.10.2_release_20250626
  • nettle_3.10.1_release_20241230
  • nettle_3.10_release_20240616
  • nettle_3.10rc2
  • nettle_3.10rc1
  • nettle_3.9.1_release_20230601
  • nettle_3.9_release_20230514
  • nettle_3.8.1_release_20220727
  • nettle_3.8_release_20220602
  • nettle_3.7.3_release_20210606
  • nettle_3.7.2_release_20210321
  • nettle_3.7.1_release_20210217
  • nettle_3.7_release_20210104
  • nettle_3.7rc1
  • nettle_3.6_release_20200429
  • nettle_3.6rc3
  • nettle_3.6rc2
  • nettle_3.6rc1
  • nettle_3.5.1_release_20190627
  • nettle_3.5_release_20190626
41 results

md2.c

Blame
  • md2.c 4.31 KiB
    /* md2.c
    
       The MD2 hash function, described in RFC 1319.
    
       Copyright (C) 2003 Niels Möller, Andreas Sigfridsson
    
       This file is part of GNU Nettle.
    
       GNU Nettle is free software: you can redistribute it and/or
       modify it under the terms of either:
    
         * the GNU Lesser General Public License as published by the Free
           Software Foundation; either version 3 of the License, or (at your
           option) any later version.
    
       or
    
         * the GNU General Public License as published by the Free
           Software Foundation; either version 2 of the License, or (at your
           option) any later version.
    
       or both in parallel, as here.
    
       GNU Nettle 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 copies of the GNU General Public License and
       the GNU Lesser General Public License along with this program.  If
       not, see http://www.gnu.org/licenses/.
    */
    
    /* This code originates from the Python Cryptography Toolkit, version 1.0.1.
       Further hacked by Andreas Sigfridsson and Niels Möller. Original license:
    
       ===================================================================
       Distribute and use freely; there are no restrictions on further
       dissemination and usage except those imposed by the laws of your
       country of residence.  This software is provided "as is" without
       warranty of fitness for use or suitability for any purpose, express
       or implied. Use at your own risk or not at all.
       ===================================================================
       
       Incorporating the code into commercial products is permitted; you do
       not have to make source available or contribute your changes back
       (though that would be nice).
       
       --amk                                                    (www.amk.ca) */
       
    #if HAVE_CONFIG_H
    # include "config.h"
    #endif
    
    #include <assert.h>
    #include <string.h>
    
    #include "md2.h"
    
    #include "macros.h"
    
    static const uint8_t
    S[256] = {
      41, 46, 67, 201, 162, 216, 124, 1, 61, 54, 84, 161, 236, 240, 6,
      19, 98, 167, 5, 243, 192, 199, 115, 140, 152, 147, 43, 217, 188,
      76, 130, 202, 30, 155, 87, 60, 253, 212, 224, 22, 103, 66, 111, 24,
      138, 23, 229, 18, 190, 78, 196, 214, 218, 158, 222, 73, 160, 251,
      245, 142, 187, 47, 238, 122, 169, 104, 121, 145, 21, 178, 7, 63,
      148, 194, 16, 137, 11, 34, 95, 33, 128, 127, 93, 154, 90, 144, 50,
      39, 53, 62, 204, 231, 191, 247, 151, 3, 255, 25, 48, 179, 72, 165,
      181, 209, 215, 94, 146, 42, 172, 86, 170, 198, 79, 184, 56, 210,
      150, 164, 125, 182, 118, 252, 107, 226, 156, 116, 4, 241, 69, 157,
      112, 89, 100, 113, 135, 32, 134, 91, 207, 101, 230, 45, 168, 2, 27,
      96, 37, 173, 174, 176, 185, 246, 28, 70, 97, 105, 52, 64, 126, 15,
      85, 71, 163, 35, 221, 81, 175, 58, 195, 92, 249, 206, 186, 197,
      234, 38, 44, 83, 13, 110, 133, 40, 132, 9, 211, 223, 205, 244, 65,
      129, 77, 82, 106, 220, 55, 200, 108, 193, 171, 250, 36, 225, 123,
      8, 12, 189, 177, 74, 120, 136, 149, 139, 227, 99, 232, 109, 233,
      203, 213, 254, 59, 0, 29, 57, 242, 239, 183, 14, 102, 88, 208, 228,
      166, 119, 114, 248, 235, 117, 75, 10, 49, 68, 80, 180, 143, 237,
      31, 26, 219, 153, 141, 51, 159, 17, 131, 20
    };
    
    static void
    md2_transform(struct md2_ctx *ctx, const uint8_t *data)
    {
      unsigned i;
      uint8_t t;
      
      memcpy(ctx->X + 16, data, MD2_BLOCK_SIZE);
    
      for (i = 0, t = ctx->C[15];
           i<MD2_BLOCK_SIZE; i++)
        {
          ctx->X[2 * MD2_BLOCK_SIZE + i]
    	= ctx->X[i] ^ ctx->X[MD2_BLOCK_SIZE + i];
          t = (ctx->C[i] ^= S[data[i]^t]);
        }
      for (i = t = 0;
           i< MD2_BLOCK_SIZE + 2;
           t = (t + i) & 0xff, i++)
        {
          unsigned j;
          for (j = 0; j < 3 * MD2_BLOCK_SIZE; j++)
    	t = (ctx->X[j] ^= S[t]);
        }
    }
    
    void
    md2_init(struct md2_ctx *ctx)
    {
      memset(ctx, 0, sizeof(*ctx));
    }
    
    void
    md2_update(struct md2_ctx *ctx,
    	   size_t length,
    	   const uint8_t *data)
    {
      MD_UPDATE(ctx, length, data, md2_transform, (void)0);
    }
    
    void
    md2_digest(struct md2_ctx *ctx,
    	   size_t length,
    	   uint8_t *digest)
    {
      unsigned left;
      
      assert(length <= MD2_DIGEST_SIZE);
    
      left = MD2_BLOCK_SIZE - ctx->index;
      memset(ctx->block + ctx->index, left, left);
      md2_transform(ctx, ctx->block);
      
      md2_transform(ctx, ctx->C);
      memcpy(digest, ctx->X, length);
      md2_init(ctx);
    }