Coverage Report

Created: 2025-09-05 06:13

/src/boringssl/crypto/blake2/blake2.cc
Line
Count
Source (jump to first uncovered line)
1
// Copyright 2021 The BoringSSL Authors
2
//
3
// Licensed under the Apache License, Version 2.0 (the "License");
4
// you may not use this file except in compliance with the License.
5
// You may obtain a copy of the License at
6
//
7
//     https://www.apache.org/licenses/LICENSE-2.0
8
//
9
// Unless required by applicable law or agreed to in writing, software
10
// distributed under the License is distributed on an "AS IS" BASIS,
11
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
12
// See the License for the specific language governing permissions and
13
// limitations under the License.
14
15
#include <openssl/blake2.h>
16
17
#include <assert.h>
18
19
#include <iterator>
20
21
#include "../internal.h"
22
23
// https://tools.ietf.org/html/rfc7693#section-2.6
24
static const uint64_t kIV[8] = {
25
    UINT64_C(0x6a09e667f3bcc908), UINT64_C(0xbb67ae8584caa73b),
26
    UINT64_C(0x3c6ef372fe94f82b), UINT64_C(0xa54ff53a5f1d36f1),
27
    UINT64_C(0x510e527fade682d1), UINT64_C(0x9b05688c2b3e6c1f),
28
    UINT64_C(0x1f83d9abfb41bd6b), UINT64_C(0x5be0cd19137e2179),
29
};
30
31
// https://tools.ietf.org/html/rfc7693#section-2.7
32
static const uint8_t kSigma[10 * 16] = {
33
    // clang-format off
34
    0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15,
35
    14, 10, 4, 8, 9, 15, 13, 6, 1, 12, 0, 2, 11, 7, 5, 3,
36
    11, 8, 12, 0, 5, 2, 15, 13, 10, 14, 3, 6, 7, 1, 9, 4,
37
    7, 9, 3, 1, 13, 12, 11, 14, 2, 6, 5, 10, 4, 0, 15, 8,
38
    9, 0, 5, 7, 2, 4, 10, 15, 14, 1, 11, 12, 6, 8, 3, 13,
39
    2, 12, 6, 10, 0, 11, 8, 3, 4, 13, 7, 5, 15, 14, 1, 9,
40
    12, 5, 1, 15, 14, 13, 4, 10, 0, 7, 6, 3, 9, 2, 8, 11,
41
    13, 11, 7, 14, 12, 1, 3, 9, 5, 0, 15, 4, 8, 6, 2, 10,
42
    6, 15, 14, 9, 11, 3, 0, 8, 12, 2, 13, 7, 1, 4, 10, 5,
43
    10, 2, 8, 4, 7, 6, 1, 5, 15, 11, 9, 14, 3, 12, 13, 0,
44
    // clang-format on
45
};
46
47
// https://tools.ietf.org/html/rfc7693#section-3.1
48
static void blake2b_mix(uint64_t v[16], int a, int b, int c, int d, uint64_t x,
49
0
                        uint64_t y) {
50
0
  v[a] = v[a] + v[b] + x;
51
0
  v[d] = CRYPTO_rotr_u64(v[d] ^ v[a], 32);
52
0
  v[c] = v[c] + v[d];
53
0
  v[b] = CRYPTO_rotr_u64(v[b] ^ v[c], 24);
54
0
  v[a] = v[a] + v[b] + y;
55
0
  v[d] = CRYPTO_rotr_u64(v[d] ^ v[a], 16);
56
0
  v[c] = v[c] + v[d];
57
0
  v[b] = CRYPTO_rotr_u64(v[b] ^ v[c], 63);
58
0
}
59
60
0
static uint64_t blake2b_load(const uint8_t block[BLAKE2B_CBLOCK], size_t i) {
61
0
  return CRYPTO_load_u64_le(block + 8 * i);
62
0
}
63
64
static void blake2b_transform(BLAKE2B_CTX *b2b,
65
                              const uint8_t block[BLAKE2B_CBLOCK],
66
0
                              size_t num_bytes, int is_final_block) {
67
  // https://tools.ietf.org/html/rfc7693#section-3.2
68
0
  uint64_t v[16];
69
0
  static_assert(sizeof(v) == sizeof(b2b->h) + sizeof(kIV));
70
0
  OPENSSL_memcpy(v, b2b->h, sizeof(b2b->h));
71
0
  OPENSSL_memcpy(&v[8], kIV, sizeof(kIV));
72
73
0
  b2b->t_low += num_bytes;
74
0
  if (b2b->t_low < num_bytes) {
75
0
    b2b->t_high++;
76
0
  }
77
0
  v[12] ^= b2b->t_low;
78
0
  v[13] ^= b2b->t_high;
79
80
0
  if (is_final_block) {
81
0
    v[14] = ~v[14];
82
0
  }
83
84
0
  for (int round = 0; round < 12; round++) {
85
0
    const uint8_t *const s = &kSigma[16 * (round % 10)];
86
0
    blake2b_mix(v, 0, 4, 8, 12, blake2b_load(block, s[0]),
87
0
                blake2b_load(block, s[1]));
88
0
    blake2b_mix(v, 1, 5, 9, 13, blake2b_load(block, s[2]),
89
0
                blake2b_load(block, s[3]));
90
0
    blake2b_mix(v, 2, 6, 10, 14, blake2b_load(block, s[4]),
91
0
                blake2b_load(block, s[5]));
92
0
    blake2b_mix(v, 3, 7, 11, 15, blake2b_load(block, s[6]),
93
0
                blake2b_load(block, s[7]));
94
0
    blake2b_mix(v, 0, 5, 10, 15, blake2b_load(block, s[8]),
95
0
                blake2b_load(block, s[9]));
96
0
    blake2b_mix(v, 1, 6, 11, 12, blake2b_load(block, s[10]),
97
0
                blake2b_load(block, s[11]));
98
0
    blake2b_mix(v, 2, 7, 8, 13, blake2b_load(block, s[12]),
99
0
                blake2b_load(block, s[13]));
100
0
    blake2b_mix(v, 3, 4, 9, 14, blake2b_load(block, s[14]),
101
0
                blake2b_load(block, s[15]));
102
0
  }
103
104
0
  for (size_t i = 0; i < std::size(b2b->h); i++) {
105
0
    b2b->h[i] ^= v[i];
106
0
    b2b->h[i] ^= v[i + 8];
107
0
  }
108
0
}
109
110
0
void BLAKE2B256_Init(BLAKE2B_CTX *b2b) {
111
0
  OPENSSL_memset(b2b, 0, sizeof(BLAKE2B_CTX));
112
113
0
  static_assert(sizeof(kIV) == sizeof(b2b->h));
114
0
  OPENSSL_memcpy(&b2b->h, kIV, sizeof(kIV));
115
116
  // https://tools.ietf.org/html/rfc7693#section-2.5
117
0
  b2b->h[0] ^= 0x01010000 | BLAKE2B256_DIGEST_LENGTH;
118
0
}
119
120
0
void BLAKE2B256_Update(BLAKE2B_CTX *b2b, const void *in_data, size_t len) {
121
0
  if (len == 0) {
122
    // Work around a C language bug. See https://crbug.com/1019588.
123
0
    return;
124
0
  }
125
126
0
  const uint8_t *data = reinterpret_cast<const uint8_t *>(in_data);
127
0
  size_t todo = sizeof(b2b->block) - b2b->block_used;
128
0
  if (todo > len) {
129
0
    todo = len;
130
0
  }
131
0
  OPENSSL_memcpy(&b2b->block[b2b->block_used], data, todo);
132
0
  b2b->block_used += todo;
133
0
  data += todo;
134
0
  len -= todo;
135
136
0
  if (!len) {
137
0
    return;
138
0
  }
139
140
  // More input remains therefore we must have filled |b2b->block|.
141
0
  assert(b2b->block_used == BLAKE2B_CBLOCK);
142
0
  blake2b_transform(b2b, b2b->block, BLAKE2B_CBLOCK,
143
0
                    /*is_final_block=*/0);
144
0
  b2b->block_used = 0;
145
146
0
  while (len > BLAKE2B_CBLOCK) {
147
0
    blake2b_transform(b2b, data, BLAKE2B_CBLOCK, /*is_final_block=*/0);
148
0
    data += BLAKE2B_CBLOCK;
149
0
    len -= BLAKE2B_CBLOCK;
150
0
  }
151
152
0
  OPENSSL_memcpy(b2b->block, data, len);
153
0
  b2b->block_used = len;
154
0
}
155
156
0
void BLAKE2B256_Final(uint8_t out[BLAKE2B256_DIGEST_LENGTH], BLAKE2B_CTX *b2b) {
157
0
  OPENSSL_memset(&b2b->block[b2b->block_used], 0,
158
0
                 sizeof(b2b->block) - b2b->block_used);
159
0
  blake2b_transform(b2b, b2b->block, b2b->block_used,
160
0
                    /*is_final_block=*/1);
161
0
  static_assert(BLAKE2B256_DIGEST_LENGTH <= sizeof(b2b->h));
162
0
  memcpy(out, b2b->h, BLAKE2B256_DIGEST_LENGTH);
163
0
}
164
165
void BLAKE2B256(const uint8_t *data, size_t len,
166
0
                uint8_t out[BLAKE2B256_DIGEST_LENGTH]) {
167
0
  BLAKE2B_CTX ctx;
168
0
  BLAKE2B256_Init(&ctx);
169
0
  BLAKE2B256_Update(&ctx, data, len);
170
0
  BLAKE2B256_Final(out, &ctx);
171
0
}