Coverage Report

Created: 2026-09-28 06:58

next uncovered line (L), next uncovered region (R), next uncovered branch (B)
/src/nettle/hmac.c
Line
Count
Source
1
/* hmac.c
2
3
   HMAC message authentication code (RFC-2104).
4
5
   Copyright (C) 2001 Niels Möller
6
7
   This file is part of GNU Nettle.
8
9
   GNU Nettle is free software: you can redistribute it and/or
10
   modify it under the terms of either:
11
12
     * the GNU Lesser General Public License as published by the Free
13
       Software Foundation; either version 3 of the License, or (at your
14
       option) any later version.
15
16
   or
17
18
     * the GNU General Public License as published by the Free
19
       Software Foundation; either version 2 of the License, or (at your
20
       option) any later version.
21
22
   or both in parallel, as here.
23
24
   GNU Nettle is distributed in the hope that it will be useful,
25
   but WITHOUT ANY WARRANTY; without even the implied warranty of
26
   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
27
   General Public License for more details.
28
29
   You should have received copies of the GNU General Public License and
30
   the GNU Lesser General Public License along with this program.  If
31
   not, see http://www.gnu.org/licenses/.
32
*/
33
34
#if HAVE_CONFIG_H
35
# include "config.h"
36
#endif
37
38
#include <assert.h>
39
#include <string.h>
40
41
#include "hmac.h"
42
43
#include "memxor.h"
44
#include "nettle-internal.h"
45
46
143k
#define IPAD 0x36
47
143k
#define OPAD 0x5c
48
49
void
50
hmac_set_key(void *outer, void *inner, void *state,
51
       const struct nettle_hash *hash,
52
       size_t key_length, const uint8_t *key)
53
143k
{
54
143k
  TMP_DECL(pad, uint8_t, NETTLE_MAX_HASH_BLOCK_SIZE);
55
143k
  TMP_ALLOC(pad, hash->block_size);
56
  
57
143k
  hash->init(outer);
58
143k
  hash->init(inner);
59
60
143k
  if (key_length > hash->block_size)
61
4.13k
    {
62
      /* Reduce key to the algorithm's hash size. Use the area pointed
63
       * to by state for the temporary state. */
64
65
4.13k
      TMP_DECL(digest, uint8_t, NETTLE_MAX_HASH_DIGEST_SIZE);
66
4.13k
      TMP_ALLOC(digest, hash->digest_size);
67
68
4.13k
      hash->init(state);
69
4.13k
      hash->update(state, key_length, key);
70
4.13k
      hash->digest(state, hash->digest_size, digest);
71
72
4.13k
      key = digest;
73
4.13k
      key_length = hash->digest_size;
74
4.13k
    }
75
76
143k
  assert(key_length <= hash->block_size);
77
  
78
143k
  memset(pad, OPAD, hash->block_size);
79
143k
  memxor(pad, key, key_length);
80
81
143k
  hash->update(outer, hash->block_size, pad);
82
83
143k
  memset(pad, IPAD, hash->block_size);
84
143k
  memxor(pad, key, key_length);
85
86
143k
  hash->update(inner, hash->block_size, pad);
87
88
143k
  memcpy(state, inner, hash->context_size);
89
143k
}
90
91
void
92
hmac_update(void *state,
93
      const struct nettle_hash *hash,
94
      size_t length, const uint8_t *data)
95
0
{
96
0
  hash->update(state, length, data);
97
0
}
98
99
void
100
hmac_digest(const void *outer, const void *inner, void *state,
101
      const struct nettle_hash *hash,       
102
      size_t length, uint8_t *dst)
103
11.5M
{
104
11.5M
  TMP_DECL(digest, uint8_t, NETTLE_MAX_HASH_DIGEST_SIZE);
105
11.5M
  TMP_ALLOC(digest, hash->digest_size);
106
107
11.5M
  hash->digest(state, hash->digest_size, digest);
108
109
11.5M
  memcpy(state, outer, hash->context_size);
110
111
11.5M
  hash->update(state, hash->digest_size, digest);
112
11.5M
  hash->digest(state, length, dst);
113
114
11.5M
  memcpy(state, inner, hash->context_size);
115
11.5M
}