blob: d3a989e718f53518bafe93ddb9efea419e5d9b30 [file] [log] [blame]
David Howellsa9681bf2012-09-21 23:24:55 +01001/* In-software asymmetric public-key crypto subtype
2 *
3 * See Documentation/crypto/asymmetric-keys.txt
4 *
5 * Copyright (C) 2012 Red Hat, Inc. All Rights Reserved.
6 * Written by David Howells (dhowells@redhat.com)
7 *
8 * This program is free software; you can redistribute it and/or
9 * modify it under the terms of the GNU General Public Licence
10 * as published by the Free Software Foundation; either version
11 * 2 of the Licence, or (at your option) any later version.
12 */
13
14#define pr_fmt(fmt) "PKEY: "fmt
15#include <linux/module.h>
16#include <linux/export.h>
17#include <linux/kernel.h>
18#include <linux/slab.h>
19#include <linux/seq_file.h>
David Howellsd43de6c2016-03-03 21:49:27 +000020#include <linux/scatterlist.h>
David Howellsa9681bf2012-09-21 23:24:55 +010021#include <keys/asymmetric-subtype.h>
Tadeusz Strukdb6c43b2016-02-02 10:08:53 -080022#include <crypto/public_key.h>
David Howellsd43de6c2016-03-03 21:49:27 +000023#include <crypto/akcipher.h>
David Howellsa9681bf2012-09-21 23:24:55 +010024
25MODULE_LICENSE("GPL");
26
David Howellsa9681bf2012-09-21 23:24:55 +010027/*
28 * Provide a part of a description of the key for /proc/keys.
29 */
30static void public_key_describe(const struct key *asymmetric_key,
31 struct seq_file *m)
32{
David Howells146aa8b2015-10-21 14:04:48 +010033 struct public_key *key = asymmetric_key->payload.data[asym_crypto];
David Howellsa9681bf2012-09-21 23:24:55 +010034
35 if (key)
David Howells4e8ae722016-03-03 21:49:27 +000036 seq_printf(m, "%s.%s", key->id_type, key->pkey_algo);
David Howellsa9681bf2012-09-21 23:24:55 +010037}
38
39/*
40 * Destroy a public key algorithm key.
41 */
David Howells3b764562016-04-06 16:13:33 +010042void public_key_free(struct public_key *key)
David Howellsa9681bf2012-09-21 23:24:55 +010043{
David Howells3b764562016-04-06 16:13:33 +010044 if (key) {
Tadeusz Strukdb6c43b2016-02-02 10:08:53 -080045 kfree(key->key);
David Howells3b764562016-04-06 16:13:33 +010046 kfree(key);
47 }
David Howellsa9681bf2012-09-21 23:24:55 +010048}
David Howells3b764562016-04-06 16:13:33 +010049EXPORT_SYMBOL_GPL(public_key_free);
50
51/*
52 * Destroy a public key algorithm key.
53 */
54static void public_key_destroy(void *payload0, void *payload3)
55{
56 public_key_free(payload0);
57 public_key_signature_free(payload3);
58}
David Howellsa9681bf2012-09-21 23:24:55 +010059
David Howellsd43de6c2016-03-03 21:49:27 +000060struct public_key_completion {
61 struct completion completion;
62 int err;
63};
64
65static void public_key_verify_done(struct crypto_async_request *req, int err)
66{
67 struct public_key_completion *compl = req->data;
68
69 if (err == -EINPROGRESS)
70 return;
71
72 compl->err = err;
73 complete(&compl->completion);
74}
75
David Howellsa9681bf2012-09-21 23:24:55 +010076/*
77 * Verify a signature using a public key.
78 */
Tadeusz Strukdb6c43b2016-02-02 10:08:53 -080079int public_key_verify_signature(const struct public_key *pkey,
David Howells3d167d62013-08-30 16:15:30 +010080 const struct public_key_signature *sig)
David Howellsa9681bf2012-09-21 23:24:55 +010081{
David Howellsd43de6c2016-03-03 21:49:27 +000082 struct public_key_completion compl;
83 struct crypto_akcipher *tfm;
84 struct akcipher_request *req;
85 struct scatterlist sig_sg, digest_sg;
86 const char *alg_name;
87 char alg_name_buf[CRYPTO_MAX_ALG_NAME];
88 void *output;
89 unsigned int outlen;
90 int ret = -ENOMEM;
91
92 pr_devel("==>%s()\n", __func__);
93
Tadeusz Strukdb6c43b2016-02-02 10:08:53 -080094 BUG_ON(!pkey);
David Howells3d167d62013-08-30 16:15:30 +010095 BUG_ON(!sig);
96 BUG_ON(!sig->digest);
Tadeusz Strukdb6c43b2016-02-02 10:08:53 -080097 BUG_ON(!sig->s);
David Howells3d167d62013-08-30 16:15:30 +010098
David Howells4e8ae722016-03-03 21:49:27 +000099 alg_name = sig->pkey_algo;
100 if (strcmp(sig->pkey_algo, "rsa") == 0) {
David Howellsd43de6c2016-03-03 21:49:27 +0000101 /* The data wangled by the RSA algorithm is typically padded
102 * and encoded in some manner, such as EMSA-PKCS1-1_5 [RFC3447
103 * sec 8.2].
104 */
105 if (snprintf(alg_name_buf, CRYPTO_MAX_ALG_NAME,
David Howells4e8ae722016-03-03 21:49:27 +0000106 "pkcs1pad(rsa,%s)", sig->hash_algo
David Howellsd43de6c2016-03-03 21:49:27 +0000107 ) >= CRYPTO_MAX_ALG_NAME)
108 return -EINVAL;
109 alg_name = alg_name_buf;
110 }
David Howells3d167d62013-08-30 16:15:30 +0100111
David Howellsd43de6c2016-03-03 21:49:27 +0000112 tfm = crypto_alloc_akcipher(alg_name, 0, 0);
113 if (IS_ERR(tfm))
114 return PTR_ERR(tfm);
David Howellsa9681bf2012-09-21 23:24:55 +0100115
David Howellsd43de6c2016-03-03 21:49:27 +0000116 req = akcipher_request_alloc(tfm, GFP_KERNEL);
117 if (!req)
118 goto error_free_tfm;
119
120 ret = crypto_akcipher_set_pub_key(tfm, pkey->key, pkey->keylen);
121 if (ret)
122 goto error_free_req;
123
Pan Bianfbb72632016-12-13 09:26:18 +0000124 ret = -ENOMEM;
David Howellsd43de6c2016-03-03 21:49:27 +0000125 outlen = crypto_akcipher_maxsize(tfm);
126 output = kmalloc(outlen, GFP_KERNEL);
127 if (!output)
128 goto error_free_req;
129
130 sg_init_one(&sig_sg, sig->s, sig->s_size);
131 sg_init_one(&digest_sg, output, outlen);
132 akcipher_request_set_crypt(req, &sig_sg, &digest_sg, sig->s_size,
133 outlen);
134 init_completion(&compl.completion);
135 akcipher_request_set_callback(req, CRYPTO_TFM_REQ_MAY_BACKLOG |
136 CRYPTO_TFM_REQ_MAY_SLEEP,
137 public_key_verify_done, &compl);
138
139 /* Perform the verification calculation. This doesn't actually do the
140 * verification, but rather calculates the hash expected by the
141 * signature and returns that to us.
142 */
143 ret = crypto_akcipher_verify(req);
144 if (ret == -EINPROGRESS) {
145 wait_for_completion(&compl.completion);
146 ret = compl.err;
147 }
148 if (ret < 0)
149 goto out_free_output;
150
151 /* Do the actual verification step. */
152 if (req->dst_len != sig->digest_size ||
153 memcmp(sig->digest, output, sig->digest_size) != 0)
154 ret = -EKEYREJECTED;
155
156out_free_output:
157 kfree(output);
158error_free_req:
159 akcipher_request_free(req);
160error_free_tfm:
161 crypto_free_akcipher(tfm);
162 pr_devel("<==%s() = %d\n", __func__, ret);
163 return ret;
David Howells3d167d62013-08-30 16:15:30 +0100164}
165EXPORT_SYMBOL_GPL(public_key_verify_signature);
166
167static int public_key_verify_signature_2(const struct key *key,
168 const struct public_key_signature *sig)
169{
David Howells146aa8b2015-10-21 14:04:48 +0100170 const struct public_key *pk = key->payload.data[asym_crypto];
David Howells3d167d62013-08-30 16:15:30 +0100171 return public_key_verify_signature(pk, sig);
David Howellsa9681bf2012-09-21 23:24:55 +0100172}
173
174/*
175 * Public key algorithm asymmetric key subtype
176 */
177struct asymmetric_key_subtype public_key_subtype = {
178 .owner = THIS_MODULE,
179 .name = "public_key",
David Howells876c6e32014-09-02 13:52:10 +0100180 .name_len = sizeof("public_key") - 1,
David Howellsa9681bf2012-09-21 23:24:55 +0100181 .describe = public_key_describe,
182 .destroy = public_key_destroy,
David Howells3d167d62013-08-30 16:15:30 +0100183 .verify_signature = public_key_verify_signature_2,
David Howellsa9681bf2012-09-21 23:24:55 +0100184};
185EXPORT_SYMBOL_GPL(public_key_subtype);