Coverage Report

Created: 2024-11-25 06:31

/src/nettle/pss-mgf1.c
Line
Count
Source
1
/* pss-mgf1.c
2
3
   PKCS#1 mask generation function 1, used in RSA-PSS (RFC-3447).
4
5
   Copyright (C) 2017 Daiki Ueno
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 "pss-mgf1.h"
39
40
#include <assert.h>
41
#include <string.h>
42
43
#include "nettle-internal.h"
44
#include "macros.h"
45
46
void
47
pss_mgf1(const void *seed, const struct nettle_hash *hash,
48
   size_t length, uint8_t *mask)
49
1.06k
{
50
1.06k
  TMP_DECL(h, uint8_t, NETTLE_MAX_HASH_DIGEST_SIZE);
51
1.06k
  TMP_DECL_ALIGN(state, NETTLE_MAX_HASH_CONTEXT_SIZE);
52
1.06k
  size_t i;
53
1.06k
  uint8_t c[4];
54
55
1.06k
  TMP_ALLOC(h, hash->digest_size);
56
1.06k
  TMP_ALLOC_ALIGN(state, hash->context_size);
57
58
1.06k
  for (i = 0;;
59
5.96k
       i++, mask += hash->digest_size, length -= hash->digest_size)
60
7.02k
    {
61
7.02k
      WRITE_UINT32(c, i);
62
63
7.02k
      memcpy(state, seed, hash->context_size);
64
7.02k
      hash->update(state, 4, c);
65
66
7.02k
      if (length <= hash->digest_size)
67
1.06k
  {
68
1.06k
    hash->digest(state, length, mask);
69
1.06k
    return;
70
1.06k
  }
71
5.96k
      hash->digest(state, hash->digest_size, mask);
72
5.96k
    }
73
1.06k
}