3 * Written by Dr Stephen N Henson (steve@openssl.org) for the OpenSSL project
6 /* ====================================================================
7 * Copyright (c) 2005 The OpenSSL Project. All rights reserved.
9 * Redistribution and use in source and binary forms, with or without
10 * modification, are permitted provided that the following conditions
13 * 1. Redistributions of source code must retain the above copyright
14 * notice, this list of conditions and the following disclaimer.
16 * 2. Redistributions in binary form must reproduce the above copyright
17 * notice, this list of conditions and the following disclaimer in
18 * the documentation and/or other materials provided with the
21 * 3. All advertising materials mentioning features or use of this
22 * software must display the following acknowledgment:
23 * "This product includes software developed by the OpenSSL Project
24 * for use in the OpenSSL Toolkit. (http://www.OpenSSL.org/)"
26 * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to
27 * endorse or promote products derived from this software without
28 * prior written permission. For written permission, please contact
29 * licensing@OpenSSL.org.
31 * 5. Products derived from this software may not be called "OpenSSL"
32 * nor may "OpenSSL" appear in their names without prior written
33 * permission of the OpenSSL Project.
35 * 6. Redistributions of any form whatsoever must retain the following
37 * "This product includes software developed by the OpenSSL Project
38 * for use in the OpenSSL Toolkit (http://www.OpenSSL.org/)"
40 * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY
41 * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
42 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
43 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE OpenSSL PROJECT OR
44 * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
45 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
46 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
47 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
48 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
49 * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
50 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
51 * OF THE POSSIBILITY OF SUCH DAMAGE.
52 * ====================================================================
54 * This product includes cryptographic software written by Eric Young
55 * (eay@cryptsoft.com). This product includes software written by Tim
56 * Hudson (tjh@cryptsoft.com).
62 #include <openssl/bn.h>
63 #include <openssl/rsa.h>
64 #include <openssl/evp.h>
65 #include <openssl/rand.h>
66 #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,
80 int hLen, maskedDBLen, MSBits, emLen;
81 const unsigned char *H;
82 unsigned char *DB = NULL;
84 unsigned char H_[EVP_MAX_MD_SIZE];
86 hLen = EVP_MD_size(Hash);
90 * Negative sLen has special meanings:
92 * -2 salt length is autorecovered from signature
100 RSAerr(RSA_F_RSA_VERIFY_PKCS1_PSS, RSA_R_SLEN_CHECK_FAILED);
104 MSBits = (BN_num_bits(rsa->n) - 1) & 0x7;
105 emLen = RSA_size(rsa);
106 if (EM[0] & (0xFF << MSBits)) {
107 RSAerr(RSA_F_RSA_VERIFY_PKCS1_PSS, RSA_R_FIRST_OCTET_INVALID);
114 if (emLen < (hLen + sLen + 2)) { /* sLen can be small negative */
115 RSAerr(RSA_F_RSA_VERIFY_PKCS1_PSS, RSA_R_DATA_TOO_LARGE);
118 if (EM[emLen - 1] != 0xbc) {
119 RSAerr(RSA_F_RSA_VERIFY_PKCS1_PSS, RSA_R_LAST_OCTET_INVALID);
122 maskedDBLen = emLen - hLen - 1;
123 H = EM + maskedDBLen;
124 DB = OPENSSL_malloc(maskedDBLen);
126 RSAerr(RSA_F_RSA_VERIFY_PKCS1_PSS, ERR_R_MALLOC_FAILURE);
129 if (PKCS1_MGF1(DB, maskedDBLen, H, hLen, Hash) < 0)
131 for (i = 0; i < maskedDBLen; i++)
134 DB[0] &= 0xFF >> (8 - MSBits);
135 for (i = 0; DB[i] == 0 && i < (maskedDBLen - 1); i++) ;
136 if (DB[i++] != 0x1) {
137 RSAerr(RSA_F_RSA_VERIFY_PKCS1_PSS, RSA_R_SLEN_RECOVERY_FAILED);
140 if (sLen >= 0 && (maskedDBLen - i) != sLen) {
141 RSAerr(RSA_F_RSA_VERIFY_PKCS1_PSS, RSA_R_SLEN_CHECK_FAILED);
144 EVP_MD_CTX_init(&ctx);
145 EVP_DigestInit_ex(&ctx, Hash, NULL);
146 EVP_DigestUpdate(&ctx, zeroes, sizeof zeroes);
147 EVP_DigestUpdate(&ctx, mHash, hLen);
149 EVP_DigestUpdate(&ctx, DB + i, maskedDBLen - i);
150 EVP_DigestFinal(&ctx, H_, NULL);
151 EVP_MD_CTX_cleanup(&ctx);
152 if (memcmp(H_, H, hLen)) {
153 RSAerr(RSA_F_RSA_VERIFY_PKCS1_PSS, RSA_R_BAD_SIGNATURE);
166 int RSA_padding_add_PKCS1_PSS(RSA *rsa, unsigned char *EM,
167 const unsigned char *mHash,
168 const EVP_MD *Hash, int sLen)
172 int hLen, maskedDBLen, MSBits, emLen;
173 unsigned char *H, *salt = NULL, *p;
176 hLen = EVP_MD_size(Hash);
180 * Negative sLen has special meanings:
182 * -2 salt length is maximized
189 else if (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);
201 sLen = emLen - hLen - 2;
202 } else if (emLen < (hLen + sLen + 2)) {
203 RSAerr(RSA_F_RSA_PADDING_ADD_PKCS1_PSS,
204 RSA_R_DATA_TOO_LARGE_FOR_KEY_SIZE);
208 salt = OPENSSL_malloc(sLen);
210 RSAerr(RSA_F_RSA_PADDING_ADD_PKCS1_PSS, ERR_R_MALLOC_FAILURE);
213 if (RAND_bytes(salt, sLen) <= 0)
216 maskedDBLen = emLen - hLen - 1;
217 H = EM + maskedDBLen;
218 EVP_MD_CTX_init(&ctx);
219 EVP_DigestInit_ex(&ctx, Hash, NULL);
220 EVP_DigestUpdate(&ctx, zeroes, sizeof zeroes);
221 EVP_DigestUpdate(&ctx, mHash, hLen);
223 EVP_DigestUpdate(&ctx, salt, sLen);
224 EVP_DigestFinal(&ctx, H, NULL);
225 EVP_MD_CTX_cleanup(&ctx);
227 /* Generate dbMask in place then perform XOR on it */
228 if (PKCS1_MGF1(EM, maskedDBLen, H, hLen, Hash))
234 * Initial PS XORs with all zeroes which is a NOP so just update pointer.
235 * Note from a test above this value is guaranteed to be non-negative.
237 p += emLen - sLen - hLen - 2;
240 for (i = 0; i < sLen; i++)
244 EM[0] &= 0xFF >> (8 - MSBits);
246 /* H is already in place so just set final 0xbc */
248 EM[emLen - 1] = 0xbc;
260 #if defined(_MSC_VER)
261 # pragma optimize("",on)