2 * QEMU Crypto hash algorithms
4 * Copyright (c) 2015 Red Hat, Inc.
6 * This library is free software; you can redistribute it and/or
7 * modify it under the terms of the GNU Lesser General Public
8 * License as published by the Free Software Foundation; either
9 * version 2 of the License, or (at your option) any later version.
11 * This library is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14 * Lesser General Public License for more details.
16 * You should have received a copy of the GNU Lesser General Public
17 * License along with this library; if not, see <http://www.gnu.org/licenses/>.
21 #include "crypto/hash.h"
23 #ifdef CONFIG_GNUTLS_HASH
24 #include <gnutls/gnutls.h>
25 #include <gnutls/crypto.h>
27 static int qcrypto_hash_alg_map
[QCRYPTO_HASH_ALG__MAX
] = {
28 [QCRYPTO_HASH_ALG_MD5
] = GNUTLS_DIG_MD5
,
29 [QCRYPTO_HASH_ALG_SHA1
] = GNUTLS_DIG_SHA1
,
30 [QCRYPTO_HASH_ALG_SHA256
] = GNUTLS_DIG_SHA256
,
33 static size_t qcrypto_hash_alg_size
[QCRYPTO_HASH_ALG__MAX
] = {
34 [QCRYPTO_HASH_ALG_MD5
] = 16,
35 [QCRYPTO_HASH_ALG_SHA1
] = 20,
36 [QCRYPTO_HASH_ALG_SHA256
] = 32,
39 gboolean
qcrypto_hash_supports(QCryptoHashAlgorithm alg
)
41 if (alg
< G_N_ELEMENTS(qcrypto_hash_alg_map
)) {
47 size_t qcrypto_hash_digest_len(QCryptoHashAlgorithm alg
)
49 if (alg
>= G_N_ELEMENTS(qcrypto_hash_alg_size
)) {
52 return qcrypto_hash_alg_size
[alg
];
56 int qcrypto_hash_bytesv(QCryptoHashAlgorithm alg
,
57 const struct iovec
*iov
,
66 if (alg
>= G_N_ELEMENTS(qcrypto_hash_alg_map
)) {
68 "Unknown hash algorithm %d",
73 ret
= gnutls_hash_init(&dig
, qcrypto_hash_alg_map
[alg
]);
77 "Unable to initialize hash algorithm: %s",
78 gnutls_strerror(ret
));
82 for (i
= 0; i
< niov
; i
++) {
83 ret
= gnutls_hash(dig
, iov
[i
].iov_base
, iov
[i
].iov_len
);
86 "Unable process hash data: %s",
87 gnutls_strerror(ret
));
92 ret
= gnutls_hash_get_len(qcrypto_hash_alg_map
[alg
]);
95 "Unable to get hash length: %s",
96 gnutls_strerror(ret
));
99 if (*resultlen
== 0) {
101 *result
= g_new0(uint8_t, *resultlen
);
102 } else if (*resultlen
!= ret
) {
104 "Result buffer size %zu is smaller than hash %d",
109 gnutls_hash_deinit(dig
, *result
);
113 gnutls_hash_deinit(dig
, NULL
);
117 #else /* ! CONFIG_GNUTLS_HASH */
119 gboolean
qcrypto_hash_supports(QCryptoHashAlgorithm alg G_GNUC_UNUSED
)
124 int qcrypto_hash_bytesv(QCryptoHashAlgorithm alg
,
125 const struct iovec
*iov G_GNUC_UNUSED
,
126 size_t niov G_GNUC_UNUSED
,
127 uint8_t **result G_GNUC_UNUSED
,
128 size_t *resultlen G_GNUC_UNUSED
,
132 "Hash algorithm %d not supported without GNUTLS",
137 #endif /* ! CONFIG_GNUTLS_HASH */
139 int qcrypto_hash_bytes(QCryptoHashAlgorithm alg
,
146 struct iovec iov
= { .iov_base
= (char *)buf
,
148 return qcrypto_hash_bytesv(alg
, &iov
, 1, result
, resultlen
, errp
);
151 static const char hex
[] = "0123456789abcdef";
153 int qcrypto_hash_digestv(QCryptoHashAlgorithm alg
,
154 const struct iovec
*iov
,
159 uint8_t *result
= NULL
;
160 size_t resultlen
= 0;
163 if (qcrypto_hash_bytesv(alg
, iov
, niov
, &result
, &resultlen
, errp
) < 0) {
167 *digest
= g_new0(char, (resultlen
* 2) + 1);
168 for (i
= 0 ; i
< resultlen
; i
++) {
169 (*digest
)[(i
* 2)] = hex
[(result
[i
] >> 4) & 0xf];
170 (*digest
)[(i
* 2) + 1] = hex
[result
[i
] & 0xf];
172 (*digest
)[resultlen
* 2] = '\0';
177 int qcrypto_hash_digest(QCryptoHashAlgorithm alg
,
183 struct iovec iov
= { .iov_base
= (char *)buf
, .iov_len
= len
};
185 return qcrypto_hash_digestv(alg
, &iov
, 1, digest
, errp
);
188 int qcrypto_hash_base64v(QCryptoHashAlgorithm alg
,
189 const struct iovec
*iov
,
194 uint8_t *result
= NULL
;
195 size_t resultlen
= 0;
197 if (qcrypto_hash_bytesv(alg
, iov
, niov
, &result
, &resultlen
, errp
) < 0) {
201 *base64
= g_base64_encode(result
, resultlen
);
206 int qcrypto_hash_base64(QCryptoHashAlgorithm alg
,
212 struct iovec iov
= { .iov_base
= (char *)buf
, .iov_len
= len
};
214 return qcrypto_hash_base64v(alg
, &iov
, 1, base64
, errp
);