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>
69 static const unsigned char zeroes[] = { 0, 0, 0, 0, 0, 0, 0, 0 };
71 #if defined(_MSC_VER) && defined(_ARM_)
72 # pragma optimize("g", off)
75 int RSA_verify_PKCS1_PSS(RSA *rsa, const unsigned char *mHash,
76 const EVP_MD *Hash, const unsigned char *EM,
79 return RSA_verify_PKCS1_PSS_mgf1(rsa, mHash, Hash, NULL, EM, sLen);
82 int RSA_verify_PKCS1_PSS_mgf1(RSA *rsa, const unsigned char *mHash,
83 const EVP_MD *Hash, const EVP_MD *mgf1Hash,
84 const unsigned char *EM, int sLen)
88 int hLen, maskedDBLen, MSBits, emLen;
89 const unsigned char *H;
90 unsigned char *DB = NULL;
92 unsigned char H_[EVP_MAX_MD_SIZE];
93 EVP_MD_CTX_init(&ctx);
98 hLen = M_EVP_MD_size(Hash);
102 * Negative sLen has special meanings:
104 * -2 salt length is autorecovered from signature
111 else if (sLen < -2) {
112 RSAerr(RSA_F_RSA_VERIFY_PKCS1_PSS_MGF1, RSA_R_SLEN_CHECK_FAILED);
116 MSBits = (BN_num_bits(rsa->n) - 1) & 0x7;
117 emLen = RSA_size(rsa);
118 if (EM[0] & (0xFF << MSBits)) {
119 RSAerr(RSA_F_RSA_VERIFY_PKCS1_PSS_MGF1, RSA_R_FIRST_OCTET_INVALID);
126 if (emLen < (hLen + sLen + 2)) { /* sLen can be small negative */
127 RSAerr(RSA_F_RSA_VERIFY_PKCS1_PSS_MGF1, RSA_R_DATA_TOO_LARGE);
130 if (EM[emLen - 1] != 0xbc) {
131 RSAerr(RSA_F_RSA_VERIFY_PKCS1_PSS_MGF1, RSA_R_LAST_OCTET_INVALID);
134 maskedDBLen = emLen - hLen - 1;
135 H = EM + maskedDBLen;
136 DB = OPENSSL_malloc(maskedDBLen);
138 RSAerr(RSA_F_RSA_VERIFY_PKCS1_PSS_MGF1, ERR_R_MALLOC_FAILURE);
141 if (PKCS1_MGF1(DB, maskedDBLen, H, hLen, mgf1Hash) < 0)
143 for (i = 0; i < maskedDBLen; i++)
146 DB[0] &= 0xFF >> (8 - MSBits);
147 for (i = 0; DB[i] == 0 && i < (maskedDBLen - 1); i++) ;
148 if (DB[i++] != 0x1) {
149 RSAerr(RSA_F_RSA_VERIFY_PKCS1_PSS_MGF1, RSA_R_SLEN_RECOVERY_FAILED);
152 if (sLen >= 0 && (maskedDBLen - i) != sLen) {
153 RSAerr(RSA_F_RSA_VERIFY_PKCS1_PSS_MGF1, RSA_R_SLEN_CHECK_FAILED);
156 if (!EVP_DigestInit_ex(&ctx, Hash, NULL)
157 || !EVP_DigestUpdate(&ctx, zeroes, sizeof zeroes)
158 || !EVP_DigestUpdate(&ctx, mHash, hLen))
160 if (maskedDBLen - i) {
161 if (!EVP_DigestUpdate(&ctx, DB + i, maskedDBLen - i))
164 if (!EVP_DigestFinal_ex(&ctx, H_, NULL))
166 if (memcmp(H_, H, hLen)) {
167 RSAerr(RSA_F_RSA_VERIFY_PKCS1_PSS_MGF1, RSA_R_BAD_SIGNATURE);
174 EVP_MD_CTX_cleanup(&ctx);
180 int RSA_padding_add_PKCS1_PSS(RSA *rsa, unsigned char *EM,
181 const unsigned char *mHash,
182 const EVP_MD *Hash, int sLen)
184 return RSA_padding_add_PKCS1_PSS_mgf1(rsa, EM, mHash, Hash, NULL, sLen);
187 int RSA_padding_add_PKCS1_PSS_mgf1(RSA *rsa, unsigned char *EM,
188 const unsigned char *mHash,
189 const EVP_MD *Hash, const EVP_MD *mgf1Hash,
194 int hLen, maskedDBLen, MSBits, emLen;
195 unsigned char *H, *salt = NULL, *p;
198 if (mgf1Hash == NULL)
201 hLen = M_EVP_MD_size(Hash);
205 * Negative sLen has special meanings:
207 * -2 salt length is maximized
214 else if (sLen < -2) {
215 RSAerr(RSA_F_RSA_PADDING_ADD_PKCS1_PSS_MGF1, RSA_R_SLEN_CHECK_FAILED);
219 MSBits = (BN_num_bits(rsa->n) - 1) & 0x7;
220 emLen = RSA_size(rsa);
226 sLen = emLen - hLen - 2;
227 } else if (emLen < (hLen + sLen + 2)) {
228 RSAerr(RSA_F_RSA_PADDING_ADD_PKCS1_PSS_MGF1,
229 RSA_R_DATA_TOO_LARGE_FOR_KEY_SIZE);
233 salt = OPENSSL_malloc(sLen);
235 RSAerr(RSA_F_RSA_PADDING_ADD_PKCS1_PSS_MGF1,
236 ERR_R_MALLOC_FAILURE);
239 if (RAND_bytes(salt, sLen) <= 0)
242 maskedDBLen = emLen - hLen - 1;
243 H = EM + maskedDBLen;
244 EVP_MD_CTX_init(&ctx);
245 if (!EVP_DigestInit_ex(&ctx, Hash, NULL)
246 || !EVP_DigestUpdate(&ctx, zeroes, sizeof zeroes)
247 || !EVP_DigestUpdate(&ctx, mHash, hLen))
249 if (sLen && !EVP_DigestUpdate(&ctx, salt, sLen))
251 if (!EVP_DigestFinal_ex(&ctx, H, NULL))
253 EVP_MD_CTX_cleanup(&ctx);
255 /* Generate dbMask in place then perform XOR on it */
256 if (PKCS1_MGF1(EM, maskedDBLen, H, hLen, mgf1Hash))
262 * Initial PS XORs with all zeroes which is a NOP so just update pointer.
263 * Note from a test above this value is guaranteed to be non-negative.
265 p += emLen - sLen - hLen - 2;
268 for (i = 0; i < sLen; i++)
272 EM[0] &= 0xFF >> (8 - MSBits);
274 /* H is already in place so just set final 0xbc */
276 EM[emLen - 1] = 0xbc;
287 #if defined(_MSC_VER)
288 # pragma optimize("",on)