2 * Written by Dr Stephen N Henson (steve@openssl.org) for the OpenSSL project
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).
60 #include "internal/cryptlib.h"
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>
68 static const unsigned char zeroes[] = { 0, 0, 0, 0, 0, 0, 0, 0 };
70 #if defined(_MSC_VER) && defined(_ARM_)
71 # pragma optimize("g", off)
74 int RSA_verify_PKCS1_PSS(RSA *rsa, const unsigned char *mHash,
75 const EVP_MD *Hash, const unsigned char *EM,
78 return RSA_verify_PKCS1_PSS_mgf1(rsa, mHash, Hash, NULL, EM, sLen);
81 int RSA_verify_PKCS1_PSS_mgf1(RSA *rsa, const unsigned char *mHash,
82 const EVP_MD *Hash, const EVP_MD *mgf1Hash,
83 const unsigned char *EM, int sLen)
87 int hLen, maskedDBLen, MSBits, emLen;
88 const unsigned char *H;
89 unsigned char *DB = NULL;
90 EVP_MD_CTX *ctx = EVP_MD_CTX_new();
91 unsigned char H_[EVP_MAX_MD_SIZE];
100 hLen = EVP_MD_size(Hash);
104 * Negative sLen has special meanings:
106 * -2 salt length is autorecovered from signature
113 else if (sLen < -2) {
114 RSAerr(RSA_F_RSA_VERIFY_PKCS1_PSS_MGF1, RSA_R_SLEN_CHECK_FAILED);
118 MSBits = (BN_num_bits(rsa->n) - 1) & 0x7;
119 emLen = RSA_size(rsa);
120 if (EM[0] & (0xFF << MSBits)) {
121 RSAerr(RSA_F_RSA_VERIFY_PKCS1_PSS_MGF1, RSA_R_FIRST_OCTET_INVALID);
128 if (emLen < (hLen + sLen + 2)) { /* sLen can be small negative */
129 RSAerr(RSA_F_RSA_VERIFY_PKCS1_PSS_MGF1, RSA_R_DATA_TOO_LARGE);
132 if (EM[emLen - 1] != 0xbc) {
133 RSAerr(RSA_F_RSA_VERIFY_PKCS1_PSS_MGF1, RSA_R_LAST_OCTET_INVALID);
136 maskedDBLen = emLen - hLen - 1;
137 H = EM + maskedDBLen;
138 DB = OPENSSL_malloc(maskedDBLen);
140 RSAerr(RSA_F_RSA_VERIFY_PKCS1_PSS_MGF1, ERR_R_MALLOC_FAILURE);
143 if (PKCS1_MGF1(DB, maskedDBLen, H, hLen, mgf1Hash) < 0)
145 for (i = 0; i < maskedDBLen; i++)
148 DB[0] &= 0xFF >> (8 - MSBits);
149 for (i = 0; DB[i] == 0 && i < (maskedDBLen - 1); i++) ;
150 if (DB[i++] != 0x1) {
151 RSAerr(RSA_F_RSA_VERIFY_PKCS1_PSS_MGF1, RSA_R_SLEN_RECOVERY_FAILED);
154 if (sLen >= 0 && (maskedDBLen - i) != sLen) {
155 RSAerr(RSA_F_RSA_VERIFY_PKCS1_PSS_MGF1, RSA_R_SLEN_CHECK_FAILED);
158 if (!EVP_DigestInit_ex(ctx, Hash, NULL)
159 || !EVP_DigestUpdate(ctx, zeroes, sizeof zeroes)
160 || !EVP_DigestUpdate(ctx, mHash, hLen))
162 if (maskedDBLen - i) {
163 if (!EVP_DigestUpdate(ctx, DB + i, maskedDBLen - i))
166 if (!EVP_DigestFinal_ex(ctx, H_, NULL))
168 if (memcmp(H_, H, hLen)) {
169 RSAerr(RSA_F_RSA_VERIFY_PKCS1_PSS_MGF1, RSA_R_BAD_SIGNATURE);
176 EVP_MD_CTX_free(ctx);
182 int RSA_padding_add_PKCS1_PSS(RSA *rsa, unsigned char *EM,
183 const unsigned char *mHash,
184 const EVP_MD *Hash, int sLen)
186 return RSA_padding_add_PKCS1_PSS_mgf1(rsa, EM, mHash, Hash, NULL, sLen);
189 int RSA_padding_add_PKCS1_PSS_mgf1(RSA *rsa, unsigned char *EM,
190 const unsigned char *mHash,
191 const EVP_MD *Hash, const EVP_MD *mgf1Hash,
196 int hLen, maskedDBLen, MSBits, emLen;
197 unsigned char *H, *salt = NULL, *p;
198 EVP_MD_CTX *ctx = NULL;
200 if (mgf1Hash == NULL)
203 hLen = EVP_MD_size(Hash);
207 * Negative sLen has special meanings:
209 * -2 salt length is maximized
216 else if (sLen < -2) {
217 RSAerr(RSA_F_RSA_PADDING_ADD_PKCS1_PSS_MGF1, RSA_R_SLEN_CHECK_FAILED);
221 MSBits = (BN_num_bits(rsa->n) - 1) & 0x7;
222 emLen = RSA_size(rsa);
228 sLen = emLen - hLen - 2;
229 } else if (emLen < (hLen + sLen + 2)) {
230 RSAerr(RSA_F_RSA_PADDING_ADD_PKCS1_PSS_MGF1,
231 RSA_R_DATA_TOO_LARGE_FOR_KEY_SIZE);
235 salt = OPENSSL_malloc(sLen);
237 RSAerr(RSA_F_RSA_PADDING_ADD_PKCS1_PSS_MGF1,
238 ERR_R_MALLOC_FAILURE);
241 if (RAND_bytes(salt, sLen) <= 0)
244 maskedDBLen = emLen - hLen - 1;
245 H = EM + maskedDBLen;
246 ctx = EVP_MD_CTX_new();
249 if (!EVP_DigestInit_ex(ctx, Hash, NULL)
250 || !EVP_DigestUpdate(ctx, zeroes, sizeof zeroes)
251 || !EVP_DigestUpdate(ctx, mHash, hLen))
253 if (sLen && !EVP_DigestUpdate(ctx, salt, sLen))
255 if (!EVP_DigestFinal_ex(ctx, H, NULL))
258 /* Generate dbMask in place then perform XOR on it */
259 if (PKCS1_MGF1(EM, maskedDBLen, H, hLen, mgf1Hash))
265 * Initial PS XORs with all zeroes which is a NOP so just update pointer.
266 * Note from a test above this value is guaranteed to be non-negative.
268 p += emLen - sLen - hLen - 2;
271 for (i = 0; i < sLen; i++)
275 EM[0] &= 0xFF >> (8 - MSBits);
277 /* H is already in place so just set final 0xbc */
279 EM[emLen - 1] = 0xbc;
284 EVP_MD_CTX_free(ctx);
291 #if defined(_MSC_VER)
292 # pragma optimize("",on)