2 /* Written by Dr Stephen N Henson (steve@openssl.org) 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];
86 RSAerr(RSA_F_RSA_VERIFY_PKCS1_PSS, RSA_R_BAD_ARGUMENT);
90 hLen = EVP_MD_size(Hash);
92 * Negative sLen has special meanings:
94 * -2 salt length is autorecovered from signature
97 if (sLen == -1) sLen = hLen;
98 else if (sLen == -2) sLen = -2;
101 RSAerr(RSA_F_RSA_VERIFY_PKCS1_PSS, RSA_R_SLEN_CHECK_FAILED);
105 MSBits = (BN_num_bits(rsa->n) - 1) & 0x7;
106 emLen = RSA_size(rsa);
107 if (EM[0] & (0xFF << MSBits))
109 RSAerr(RSA_F_RSA_VERIFY_PKCS1_PSS, RSA_R_FIRST_OCTET_INVALID);
117 if (emLen < (hLen + sLen + 2)) /* sLen can be small negative */
119 RSAerr(RSA_F_RSA_VERIFY_PKCS1_PSS, RSA_R_DATA_TOO_LARGE);
122 if (EM[emLen - 1] != 0xbc)
124 RSAerr(RSA_F_RSA_VERIFY_PKCS1_PSS, RSA_R_LAST_OCTET_INVALID);
127 maskedDBLen = emLen - hLen - 1;
128 H = EM + maskedDBLen;
129 DB = OPENSSL_malloc(maskedDBLen);
132 RSAerr(RSA_F_RSA_VERIFY_PKCS1_PSS, ERR_R_MALLOC_FAILURE);
135 PKCS1_MGF1(DB, maskedDBLen, H, hLen, Hash);
136 for (i = 0; i < maskedDBLen; i++)
139 DB[0] &= 0xFF >> (8 - MSBits);
140 for (i = 0; DB[i] == 0 && i < (maskedDBLen-1); i++) ;
143 RSAerr(RSA_F_RSA_VERIFY_PKCS1_PSS, RSA_R_SLEN_RECOVERY_FAILED);
146 if (sLen >= 0 && (maskedDBLen - i) != sLen)
148 RSAerr(RSA_F_RSA_VERIFY_PKCS1_PSS, RSA_R_SLEN_CHECK_FAILED);
151 EVP_MD_CTX_init(&ctx);
152 EVP_DigestInit_ex(&ctx, Hash, NULL);
153 EVP_DigestUpdate(&ctx, zeroes, sizeof zeroes);
154 EVP_DigestUpdate(&ctx, mHash, hLen);
156 EVP_DigestUpdate(&ctx, DB + i, maskedDBLen - i);
157 EVP_DigestFinal(&ctx, H_, NULL);
158 EVP_MD_CTX_cleanup(&ctx);
159 if (memcmp(H_, H, hLen))
161 RSAerr(RSA_F_RSA_VERIFY_PKCS1_PSS, RSA_R_BAD_SIGNATURE);
175 int RSA_padding_add_PKCS1_PSS(RSA *rsa, unsigned char *EM,
176 const unsigned char *mHash,
177 const EVP_MD *Hash, int sLen)
181 int hLen, maskedDBLen, MSBits, emLen;
182 unsigned char *H, *salt = NULL, *p;
185 hLen = EVP_MD_size(Hash);
187 * Negative sLen has special meanings:
189 * -2 salt length is maximized
192 if (sLen == -1) sLen = hLen;
193 else if (sLen == -2) sLen = -2;
196 RSAerr(RSA_F_RSA_PADDING_ADD_PKCS1_PSS, RSA_R_SLEN_CHECK_FAILED);
200 MSBits = (BN_num_bits(rsa->n) - 1) & 0x7;
201 emLen = RSA_size(rsa);
209 sLen = emLen - hLen - 2;
211 else if (emLen < (hLen + sLen + 2))
213 RSAerr(RSA_F_RSA_PADDING_ADD_PKCS1_PSS,
214 RSA_R_DATA_TOO_LARGE_FOR_KEY_SIZE);
219 salt = OPENSSL_malloc(sLen);
222 RSAerr(RSA_F_RSA_PADDING_ADD_PKCS1_PSS,
223 ERR_R_MALLOC_FAILURE);
226 if (!RAND_bytes(salt, sLen))
229 maskedDBLen = emLen - hLen - 1;
230 H = EM + maskedDBLen;
231 EVP_MD_CTX_init(&ctx);
232 EVP_DigestInit_ex(&ctx, Hash, NULL);
233 EVP_DigestUpdate(&ctx, zeroes, sizeof zeroes);
234 EVP_DigestUpdate(&ctx, mHash, hLen);
236 EVP_DigestUpdate(&ctx, salt, sLen);
237 EVP_DigestFinal(&ctx, H, NULL);
238 EVP_MD_CTX_cleanup(&ctx);
240 /* Generate dbMask in place then perform XOR on it */
241 PKCS1_MGF1(EM, maskedDBLen, H, hLen, Hash);
245 /* Initial PS XORs with all zeroes which is a NOP so just update
246 * pointer. Note from a test above this value is guaranteed to
249 p += emLen - sLen - hLen - 2;
253 for (i = 0; i < sLen; i++)
257 EM[0] &= 0xFF >> (8 - MSBits);
259 /* H is already in place so just set final 0xbc */
261 EM[emLen - 1] = 0xbc;
273 #if defined(_MSC_VER)
274 #pragma optimize("",on)