2
/* Written by Dr Stephen N Henson (shenson@bigfoot.com) for the OpenSSL
5
/* ====================================================================
6
* Copyright (c) 2005 The OpenSSL Project. All rights reserved.
8
* Redistribution and use in source and binary forms, with or without
9
* modification, are permitted provided that the following conditions
12
* 1. Redistributions of source code must retain the above copyright
13
* notice, this list of conditions and the following disclaimer.
15
* 2. Redistributions in binary form must reproduce the above copyright
16
* notice, this list of conditions and the following disclaimer in
17
* the documentation and/or other materials provided with the
20
* 3. All advertising materials mentioning features or use of this
21
* software must display the following acknowledgment:
22
* "This product includes software developed by the OpenSSL Project
23
* for use in the OpenSSL Toolkit. (http://www.OpenSSL.org/)"
25
* 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to
26
* endorse or promote products derived from this software without
27
* prior written permission. For written permission, please contact
28
* licensing@OpenSSL.org.
30
* 5. Products derived from this software may not be called "OpenSSL"
31
* nor may "OpenSSL" appear in their names without prior written
32
* permission of the OpenSSL Project.
34
* 6. Redistributions of any form whatsoever must retain the following
36
* "This product includes software developed by the OpenSSL Project
37
* for use in the OpenSSL Toolkit (http://www.OpenSSL.org/)"
39
* THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY
40
* EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
41
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
42
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE OpenSSL PROJECT OR
43
* ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
44
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
45
* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
46
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
47
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
48
* STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
49
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
50
* OF THE POSSIBILITY OF SUCH DAMAGE.
51
* ====================================================================
53
* This product includes cryptographic software written by Eric Young
54
* (eay@cryptsoft.com). This product includes software written by Tim
55
* Hudson (tjh@cryptsoft.com).
61
#include <openssl/bn.h>
62
#include <openssl/rsa.h>
63
#include <openssl/evp.h>
64
#include <openssl/rand.h>
65
#include <openssl/sha.h>
67
static const unsigned char zeroes[] = {0,0,0,0,0,0,0,0};
69
#if defined(_MSC_VER) && defined(_ARM_)
70
#pragma optimize("g", off)
73
int RSA_verify_PKCS1_PSS(RSA *rsa, const unsigned char *mHash,
74
const EVP_MD *Hash, const unsigned char *EM, int sLen)
78
int hLen, maskedDBLen, MSBits, emLen;
79
const unsigned char *H;
80
unsigned char *DB = NULL;
82
unsigned char H_[EVP_MAX_MD_SIZE];
84
hLen = EVP_MD_size(Hash);
86
* Negative sLen has special meanings:
88
* -2 salt length is autorecovered from signature
91
if (sLen == -1) sLen = hLen;
92
else if (sLen == -2) sLen = -2;
95
RSAerr(RSA_F_RSA_VERIFY_PKCS1_PSS, RSA_R_SLEN_CHECK_FAILED);
99
MSBits = (BN_num_bits(rsa->n) - 1) & 0x7;
100
emLen = RSA_size(rsa);
101
if (EM[0] & (0xFF << MSBits))
103
RSAerr(RSA_F_RSA_VERIFY_PKCS1_PSS, RSA_R_FIRST_OCTET_INVALID);
111
if (emLen < (hLen + sLen + 2)) /* sLen can be small negative */
113
RSAerr(RSA_F_RSA_VERIFY_PKCS1_PSS, RSA_R_DATA_TOO_LARGE);
116
if (EM[emLen - 1] != 0xbc)
118
RSAerr(RSA_F_RSA_VERIFY_PKCS1_PSS, RSA_R_LAST_OCTET_INVALID);
121
maskedDBLen = emLen - hLen - 1;
122
H = EM + maskedDBLen;
123
DB = OPENSSL_malloc(maskedDBLen);
126
RSAerr(RSA_F_RSA_VERIFY_PKCS1_PSS, ERR_R_MALLOC_FAILURE);
129
PKCS1_MGF1(DB, maskedDBLen, H, hLen, Hash);
130
for (i = 0; i < maskedDBLen; i++)
133
DB[0] &= 0xFF >> (8 - MSBits);
134
for (i = 0; DB[i] == 0 && i < (maskedDBLen-1); i++) ;
137
RSAerr(RSA_F_RSA_VERIFY_PKCS1_PSS, RSA_R_SLEN_RECOVERY_FAILED);
140
if (sLen >= 0 && (maskedDBLen - i) != sLen)
142
RSAerr(RSA_F_RSA_VERIFY_PKCS1_PSS, RSA_R_SLEN_CHECK_FAILED);
145
EVP_MD_CTX_init(&ctx);
146
EVP_DigestInit_ex(&ctx, Hash, NULL);
147
EVP_DigestUpdate(&ctx, zeroes, sizeof zeroes);
148
EVP_DigestUpdate(&ctx, mHash, hLen);
150
EVP_DigestUpdate(&ctx, DB + i, maskedDBLen - i);
151
EVP_DigestFinal(&ctx, H_, NULL);
152
EVP_MD_CTX_cleanup(&ctx);
153
if (memcmp(H_, H, hLen))
155
RSAerr(RSA_F_RSA_VERIFY_PKCS1_PSS, RSA_R_BAD_SIGNATURE);
169
int RSA_padding_add_PKCS1_PSS(RSA *rsa, unsigned char *EM,
170
const unsigned char *mHash,
171
const EVP_MD *Hash, int sLen)
175
int hLen, maskedDBLen, MSBits, emLen;
176
unsigned char *H, *salt = NULL, *p;
179
hLen = EVP_MD_size(Hash);
181
* Negative sLen has special meanings:
183
* -2 salt length is maximized
186
if (sLen == -1) sLen = hLen;
187
else if (sLen == -2) sLen = -2;
190
RSAerr(RSA_F_RSA_PADDING_ADD_PKCS1_PSS, RSA_R_SLEN_CHECK_FAILED);
194
MSBits = (BN_num_bits(rsa->n) - 1) & 0x7;
195
emLen = RSA_size(rsa);
203
sLen = emLen - hLen - 2;
205
else if (emLen < (hLen + sLen + 2))
207
RSAerr(RSA_F_RSA_PADDING_ADD_PKCS1_PSS,
208
RSA_R_DATA_TOO_LARGE_FOR_KEY_SIZE);
213
salt = OPENSSL_malloc(sLen);
216
RSAerr(RSA_F_RSA_PADDING_ADD_PKCS1_PSS,
217
ERR_R_MALLOC_FAILURE);
220
if (!RAND_bytes(salt, sLen))
223
maskedDBLen = emLen - hLen - 1;
224
H = EM + maskedDBLen;
225
EVP_MD_CTX_init(&ctx);
226
EVP_DigestInit_ex(&ctx, Hash, NULL);
227
EVP_DigestUpdate(&ctx, zeroes, sizeof zeroes);
228
EVP_DigestUpdate(&ctx, mHash, hLen);
230
EVP_DigestUpdate(&ctx, salt, sLen);
231
EVP_DigestFinal(&ctx, H, NULL);
232
EVP_MD_CTX_cleanup(&ctx);
234
/* Generate dbMask in place then perform XOR on it */
235
PKCS1_MGF1(EM, maskedDBLen, H, hLen, Hash);
239
/* Initial PS XORs with all zeroes which is a NOP so just update
240
* pointer. Note from a test above this value is guaranteed to
243
p += emLen - sLen - hLen - 2;
247
for (i = 0; i < sLen; i++)
251
EM[0] &= 0xFF >> (8 - MSBits);
253
/* H is already in place so just set final 0xbc */
255
EM[emLen - 1] = 0xbc;
267
#if defined(_MSC_VER)
268
#pragma optimize("",on)