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).
59 #define OPENSSL_FIPSAPI
63 #include <openssl/bn.h>
64 #include <openssl/rsa.h>
65 #include <openssl/evp.h>
66 #include <openssl/rand.h>
67 #include <openssl/sha.h>
71 #include <openssl/fips.h>
74 static const unsigned char zeroes[] = {0,0,0,0,0,0,0,0};
76 #if defined(_MSC_VER) && defined(_ARM_)
77 #pragma optimize("g", off)
80 int RSA_verify_PKCS1_PSS(RSA *rsa, const unsigned char *mHash,
81 const EVP_MD *Hash, const unsigned char *EM, int sLen)
83 return RSA_verify_PKCS1_PSS_mgf1(rsa, mHash, Hash, NULL, EM, sLen);
86 int RSA_verify_PKCS1_PSS_mgf1(RSA *rsa, const unsigned char *mHash,
87 const EVP_MD *Hash, const EVP_MD *mgf1Hash,
88 const unsigned char *EM, int sLen)
92 int hLen, maskedDBLen, MSBits, emLen;
93 const unsigned char *H;
94 unsigned char *DB = NULL;
96 unsigned char H_[EVP_MAX_MD_SIZE];
97 EVP_MD_CTX_init(&ctx);
102 hLen = M_EVP_MD_size(Hash);
106 * Negative sLen has special meanings:
108 * -2 salt length is autorecovered from signature
111 if (sLen == -1) sLen = hLen;
112 else if (sLen == -2) sLen = -2;
115 RSAerr(RSA_F_RSA_VERIFY_PKCS1_PSS_MGF1, RSA_R_SLEN_CHECK_FAILED);
119 MSBits = (BN_num_bits(rsa->n) - 1) & 0x7;
120 emLen = RSA_size(rsa);
121 if (EM[0] & (0xFF << MSBits))
123 RSAerr(RSA_F_RSA_VERIFY_PKCS1_PSS_MGF1, RSA_R_FIRST_OCTET_INVALID);
131 if (emLen < (hLen + sLen + 2)) /* sLen can be small negative */
133 RSAerr(RSA_F_RSA_VERIFY_PKCS1_PSS_MGF1, RSA_R_DATA_TOO_LARGE);
136 if (EM[emLen - 1] != 0xbc)
138 RSAerr(RSA_F_RSA_VERIFY_PKCS1_PSS_MGF1, RSA_R_LAST_OCTET_INVALID);
141 maskedDBLen = emLen - hLen - 1;
142 H = EM + maskedDBLen;
143 DB = OPENSSL_malloc(maskedDBLen);
146 RSAerr(RSA_F_RSA_VERIFY_PKCS1_PSS_MGF1, ERR_R_MALLOC_FAILURE);
149 if (PKCS1_MGF1(DB, maskedDBLen, H, hLen, mgf1Hash) < 0)
151 for (i = 0; i < maskedDBLen; i++)
154 DB[0] &= 0xFF >> (8 - MSBits);
155 for (i = 0; DB[i] == 0 && i < (maskedDBLen-1); i++) ;
158 RSAerr(RSA_F_RSA_VERIFY_PKCS1_PSS_MGF1, RSA_R_SLEN_RECOVERY_FAILED);
161 if (sLen >= 0 && (maskedDBLen - i) != sLen)
163 RSAerr(RSA_F_RSA_VERIFY_PKCS1_PSS_MGF1, RSA_R_SLEN_CHECK_FAILED);
166 if (!EVP_DigestInit_ex(&ctx, Hash, NULL)
167 || !EVP_DigestUpdate(&ctx, zeroes, sizeof zeroes)
168 || !EVP_DigestUpdate(&ctx, mHash, hLen))
172 if (!EVP_DigestUpdate(&ctx, DB + i, maskedDBLen - i))
175 if (!EVP_DigestFinal_ex(&ctx, H_, NULL))
177 if (memcmp(H_, H, hLen))
179 RSAerr(RSA_F_RSA_VERIFY_PKCS1_PSS_MGF1, RSA_R_BAD_SIGNATURE);
188 EVP_MD_CTX_cleanup(&ctx);
194 int RSA_padding_add_PKCS1_PSS(RSA *rsa, unsigned char *EM,
195 const unsigned char *mHash,
196 const EVP_MD *Hash, int sLen)
198 return RSA_padding_add_PKCS1_PSS_mgf1(rsa, EM, mHash, Hash, NULL, sLen);
201 int RSA_padding_add_PKCS1_PSS_mgf1(RSA *rsa, unsigned char *EM,
202 const unsigned char *mHash,
203 const EVP_MD *Hash, const EVP_MD *mgf1Hash, int sLen)
207 int hLen, maskedDBLen, MSBits, emLen;
208 unsigned char *H, *salt = NULL, *p;
211 if (mgf1Hash == NULL)
214 hLen = M_EVP_MD_size(Hash);
218 * Negative sLen has special meanings:
220 * -2 salt length is maximized
223 if (sLen == -1) sLen = hLen;
224 else if (sLen == -2) sLen = -2;
227 RSAerr(RSA_F_RSA_PADDING_ADD_PKCS1_PSS_MGF1, RSA_R_SLEN_CHECK_FAILED);
231 MSBits = (BN_num_bits(rsa->n) - 1) & 0x7;
232 emLen = RSA_size(rsa);
240 sLen = emLen - hLen - 2;
242 else if (emLen < (hLen + sLen + 2))
244 RSAerr(RSA_F_RSA_PADDING_ADD_PKCS1_PSS_MGF1,RSA_R_DATA_TOO_LARGE_FOR_KEY_SIZE);
249 salt = OPENSSL_malloc(sLen);
252 RSAerr(RSA_F_RSA_PADDING_ADD_PKCS1_PSS_MGF1,ERR_R_MALLOC_FAILURE);
255 if (RAND_bytes(salt, sLen) <= 0)
258 maskedDBLen = emLen - hLen - 1;
259 H = EM + maskedDBLen;
260 EVP_MD_CTX_init(&ctx);
261 if (!EVP_DigestInit_ex(&ctx, Hash, NULL)
262 || !EVP_DigestUpdate(&ctx, zeroes, sizeof zeroes)
263 || !EVP_DigestUpdate(&ctx, mHash, hLen))
265 if (sLen && !EVP_DigestUpdate(&ctx, salt, sLen))
267 if (!EVP_DigestFinal_ex(&ctx, H, NULL))
269 EVP_MD_CTX_cleanup(&ctx);
271 /* Generate dbMask in place then perform XOR on it */
272 if (PKCS1_MGF1(EM, maskedDBLen, H, hLen, mgf1Hash))
277 /* Initial PS XORs with all zeroes which is a NOP so just update
278 * pointer. Note from a test above this value is guaranteed to
281 p += emLen - sLen - hLen - 2;
285 for (i = 0; i < sLen; i++)
289 EM[0] &= 0xFF >> (8 - MSBits);
291 /* H is already in place so just set final 0xbc */
293 EM[emLen - 1] = 0xbc;
305 #if defined(_MSC_VER)
306 #pragma optimize("",on)