1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
|
/* rsa-decrypt.c
The RSA publickey algorithm. PKCS#1 encryption.
Copyright (C) 2001, 2012 Niels Möller
This file is part of GNU Nettle.
GNU Nettle is free software: you can redistribute it and/or
modify it under the terms of either:
* the GNU Lesser General Public License as published by the Free
Software Foundation; either version 3 of the License, or (at your
option) any later version.
or
* the GNU General Public License as published by the Free
Software Foundation; either version 2 of the License, or (at your
option) any later version.
or both in parallel, as here.
GNU Nettle is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
General Public License for more details.
You should have received copies of the GNU General Public License and
the GNU Lesser General Public License along with this program. If
not, see http://www.gnu.org/licenses/.
*/
#if HAVE_CONFIG_H
# include "config.h"
#endif
#include "rsa.h"
#include "pkcs1.h"
int
rsa_decrypt(const struct rsa_private_key *key,
size_t *length, uint8_t *message,
const mpz_t gibberish)
{
mpz_t m;
int res;
mpz_init(m);
/* First check that input is in range. Since we don't have the
public key available here, we need to reconstruct n. */
mpz_mul (m, key->p, key->q);
if (mpz_sgn (gibberish) < 0 || mpz_cmp (gibberish, m) >= 0)
{
mpz_clear (m);
return 0;
}
rsa_compute_root(key, m, gibberish);
res = pkcs1_decrypt (key->size, m, length, message);
mpz_clear(m);
return res;
}
|
