Skip to content
Snippets Groups Projects
Select Git revision
  • 8ffecb51f1ae3f301d94ccc4b4097a8df65ae511
  • master default
  • wip-add-ed25519
  • disable-sha1
  • lsh-2.0.4
  • experimental-20050201
  • lsh-1.4.2
  • lsh-1.2
  • lsh_2.1_release_20130626
  • converted-master-branch-to-git
  • nettle_2.4_release_20110903
  • nettle_2.3_release_20110902
  • nettle_2.2_release_20110711
  • nettle_2.1_release_20100725
  • camellia_32bit_20100720
  • nettle_2.0_release_20090608
  • converted-lsh-2.0.4-branch-to-git
  • lsh_2.0.4_release_20070905
  • lsh_2.9_exp_release_20070404
  • nettle_1.15_release_20061128
  • after_experimental_merge_20060516
  • branch_before_experimental_merge_20060516
  • converted-experimental-branch-to-git
  • head_before_experimental_merge_20060516
  • lsh_2.0.3_release_20060509
  • lsh_2.0.2_release_20060127
  • nettle_1.14_release_20051205
  • nettle_1.13_release_20051006
28 results

plan.html

Blame
  • umac64.c 3.78 KiB
    /* umac64.c
    
       Copyright (C) 2013 Niels Möller
    
       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/.
    */
    
    #if HAVE_CONFIG_H
    # include "config.h"
    #endif
    
    #include <assert.h>
    #include <string.h>
    
    #include "umac.h"
    #include "umac-internal.h"
    
    #include "macros.h"
    
    void
    umac64_set_key (struct umac64_ctx *ctx, const uint8_t *key)
    {
      _umac_set_key (ctx->l1_key, ctx->l2_key, ctx->l3_key1, ctx->l3_key2,
    		 &ctx->pdf_key, key, 2);
    
      /* Clear nonce */
      memset (ctx->nonce, 0, sizeof(ctx->nonce));
      ctx->nonce_low = 0;
      ctx->nonce_length = sizeof(ctx->nonce);
    
      /* Initialize buffer */
      ctx->count = ctx->index = 0;
    }
    
    void
    umac64_set_nonce (struct umac64_ctx *ctx,
    		  size_t nonce_length, const uint8_t *nonce)
    {
      assert (nonce_length > 0);
      assert (nonce_length <= AES_BLOCK_SIZE);
    
      memcpy (ctx->nonce, nonce, nonce_length);
      memset (ctx->nonce + nonce_length, 0, AES_BLOCK_SIZE - nonce_length);
    
      ctx->nonce_low = ctx->nonce[nonce_length - 1] & 1;
      ctx->nonce[nonce_length - 1] &= ~1;
      ctx->nonce_length = nonce_length;
    }
    
    #define UMAC64_BLOCK(ctx, block) do {					\
        uint64_t __umac64_y[2];						\
        _umac_nh_n (__umac64_y, 2, ctx->l1_key, UMAC_BLOCK_SIZE, block);	\
        __umac64_y[0] += 8*UMAC_BLOCK_SIZE;					\
        __umac64_y[1] += 8*UMAC_BLOCK_SIZE;					\
        _umac_l2 (ctx->l2_key, ctx->l2_state, 2, ctx->count++, __umac64_y);	\
      } while (0)
    
    void
    umac64_update (struct umac64_ctx *ctx,
    	       size_t length, const uint8_t *data)
    {
      MD_UPDATE (ctx, length, data, UMAC64_BLOCK, (void)0);
    }
    
    
    void
    umac64_digest (struct umac64_ctx *ctx,
    	       size_t length, uint8_t *digest)
    {
      uint32_t tag[2];
      uint32_t *pad;
    
      assert (length > 0);
      assert (length <= 8);
    
      if (ctx->index > 0 || ctx->count == 0)
        {
          /* Zero pad to multiple of 32 */
          uint64_t y[2];
          unsigned pad = (ctx->index > 0) ? 31 & - ctx->index : 32;
          memset (ctx->block + ctx->index, 0, pad);
    
          _umac_nh_n (y, 2, ctx->l1_key, ctx->index + pad, ctx->block);
          y[0] += 8 * ctx->index;
          y[1] += 8 * ctx->index;
          _umac_l2 (ctx->l2_key, ctx->l2_state, 2, ctx->count++, y);
        }
      assert (ctx->count > 0);
      if ( !(ctx->nonce_low & _UMAC_NONCE_CACHED))
        {
          aes128_encrypt (&ctx->pdf_key, AES_BLOCK_SIZE,
    		      (uint8_t *) ctx->pad_cache, ctx->nonce);
          ctx->nonce_low |= _UMAC_NONCE_CACHED;
        }
      pad = ctx->pad_cache + 2*(ctx->nonce_low & 1);
    
      /* Increment nonce */
      ctx->nonce_low++;
      if ( !(ctx->nonce_low & 1))
        {
          unsigned i = ctx->nonce_length - 1;
    
          ctx->nonce_low = 0;
          ctx->nonce[i] += 2;
    
          if (ctx->nonce[i] == 0 && i > 0)
    	INCREMENT (i, ctx->nonce);
        }
    
      _umac_l2_final (ctx->l2_key, ctx->l2_state, 2, ctx->count);
      tag[0] = pad[0] ^ ctx->l3_key2[0] ^ _umac_l3 (ctx->l3_key1,
    						ctx->l2_state);
      tag[1] = pad[1] ^ ctx->l3_key2[1] ^ _umac_l3 (ctx->l3_key1 + 8,
    						ctx->l2_state + 2);
      memcpy (digest, tag, length);
    
      /* Reinitialize */
      ctx->count = ctx->index = 0;
    }