Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 1 | /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com) |
| 2 | * All rights reserved. |
| 3 | * |
| 4 | * This package is an SSL implementation written |
| 5 | * by Eric Young (eay@cryptsoft.com). |
| 6 | * The implementation was written so as to conform with Netscapes SSL. |
| 7 | * |
| 8 | * This library is free for commercial and non-commercial use as long as |
| 9 | * the following conditions are aheared to. The following conditions |
| 10 | * apply to all code found in this distribution, be it the RC4, RSA, |
| 11 | * lhash, DES, etc., code; not just the SSL code. The SSL documentation |
| 12 | * included with this distribution is covered by the same copyright terms |
| 13 | * except that the holder is Tim Hudson (tjh@cryptsoft.com). |
| 14 | * |
| 15 | * Copyright remains Eric Young's, and as such any Copyright notices in |
| 16 | * the code are not to be removed. |
| 17 | * If this package is used in a product, Eric Young should be given attribution |
| 18 | * as the author of the parts of the library used. |
| 19 | * This can be in the form of a textual message at program startup or |
| 20 | * in documentation (online or textual) provided with the package. |
| 21 | * |
| 22 | * Redistribution and use in source and binary forms, with or without |
| 23 | * modification, are permitted provided that the following conditions |
| 24 | * are met: |
| 25 | * 1. Redistributions of source code must retain the copyright |
| 26 | * notice, this list of conditions and the following disclaimer. |
| 27 | * 2. Redistributions in binary form must reproduce the above copyright |
| 28 | * notice, this list of conditions and the following disclaimer in the |
| 29 | * documentation and/or other materials provided with the distribution. |
| 30 | * 3. All advertising materials mentioning features or use of this software |
| 31 | * must display the following acknowledgement: |
| 32 | * "This product includes cryptographic software written by |
| 33 | * Eric Young (eay@cryptsoft.com)" |
| 34 | * The word 'cryptographic' can be left out if the rouines from the library |
| 35 | * being used are not cryptographic related :-). |
| 36 | * 4. If you include any Windows specific code (or a derivative thereof) from |
| 37 | * the apps directory (application code) you must include an acknowledgement: |
| 38 | * "This product includes software written by Tim Hudson (tjh@cryptsoft.com)" |
| 39 | * |
| 40 | * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND |
| 41 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
| 42 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
| 43 | * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE |
| 44 | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL |
| 45 | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS |
| 46 | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) |
| 47 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT |
| 48 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY |
| 49 | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF |
| 50 | * SUCH DAMAGE. |
| 51 | * |
| 52 | * The licence and distribution terms for any publically available version or |
| 53 | * derivative of this code cannot be changed. i.e. this code cannot simply be |
| 54 | * copied and put under another distribution licence |
| 55 | * [including the GNU Public Licence.] */ |
| 56 | |
| 57 | #ifndef OPENSSL_HEADER_RSA_H |
| 58 | #define OPENSSL_HEADER_RSA_H |
| 59 | |
| 60 | #include <openssl/base.h> |
| 61 | |
| 62 | #include <openssl/engine.h> |
| 63 | #include <openssl/ex_data.h> |
| 64 | |
| 65 | #if defined(__cplusplus) |
| 66 | extern "C" { |
| 67 | #endif |
| 68 | |
| 69 | |
| 70 | /* rsa.h contains functions for handling encryption and signature using RSA. */ |
| 71 | |
| 72 | |
| 73 | /* Allocation and destruction. */ |
| 74 | |
| 75 | /* RSA_new returns a new, empty RSA object or NULL on error. */ |
| 76 | RSA *RSA_new(void); |
| 77 | |
| 78 | /* RSA_new_method acts the same as |DH_new| but takes an explicit |ENGINE|. */ |
| 79 | RSA *RSA_new_method(const ENGINE *engine); |
| 80 | |
| 81 | /* RSA_free decrements the reference count of |rsa| and frees it if the |
| 82 | * reference count drops to zero. */ |
| 83 | void RSA_free(RSA *rsa); |
| 84 | |
| 85 | /* RSA_up_ref increments the reference count of |rsa|. */ |
| 86 | int RSA_up_ref(RSA *rsa); |
| 87 | |
| 88 | |
| 89 | /* Key generation. */ |
| 90 | |
| 91 | /* RSA_generate_key_ex generates a new RSA key where the modulus has size |
| 92 | * |bits| and the public exponent is |e|. If unsure, |RSA_F4| is a good value |
| 93 | * for |e|. If |cb| is not NULL then it is called during the key generation |
| 94 | * process. In addition to the calls documented for |BN_generate_prime_ex|, it |
| 95 | * is called with event=2 when the n'th prime is rejected as unsuitable and |
| 96 | * with event=3 when a suitable value for |p| is found. */ |
| 97 | int RSA_generate_key_ex(RSA *rsa, int bits, BIGNUM *e, BN_GENCB *cb); |
| 98 | |
| 99 | |
| 100 | /* Encryption / Decryption */ |
| 101 | |
| 102 | /* Padding types for encryption. */ |
| 103 | #define RSA_PKCS1_PADDING 1 |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 104 | #define RSA_NO_PADDING 3 |
| 105 | #define RSA_PKCS1_OAEP_PADDING 4 |
| 106 | /* RSA_PKCS1_PSS_PADDING can only be used via the EVP interface. */ |
| 107 | #define RSA_PKCS1_PSS_PADDING 6 |
| 108 | |
| 109 | /* RSA_encrypt encrypts |in_len| bytes from |in| to the public key from |rsa| |
| 110 | * and writes, at most, |max_out| bytes of encrypted data to |out|. The |
| 111 | * |max_out| argument must be, at least, |RSA_size| in order to ensure success. |
| 112 | * |
| 113 | * It returns 1 on success or zero on error. |
| 114 | * |
| 115 | * The |padding| argument must be one of the |RSA_*_PADDING| values. If in |
| 116 | * doubt, |RSA_PKCS1_PADDING| is the most common but |RSA_PKCS1_OAEP_PADDING| |
| 117 | * is the most secure. */ |
| 118 | int RSA_encrypt(RSA *rsa, size_t *out_len, uint8_t *out, size_t max_out, |
| 119 | const uint8_t *in, size_t in_len, int padding); |
| 120 | |
| 121 | /* RSA_decrypt decrypts |in_len| bytes from |in| with the private key from |
| 122 | * |rsa| and writes, at most, |max_out| bytes of plaintext to |out|. The |
| 123 | * |max_out| argument must be, at least, |RSA_size| in order to ensure success. |
| 124 | * |
| 125 | * It returns 1 on success or zero on error. |
| 126 | * |
| 127 | * The |padding| argument must be one of the |RSA_*_PADDING| values. If in |
| 128 | * doubt, |RSA_PKCS1_PADDING| is the most common but |RSA_PKCS1_OAEP_PADDING| |
| 129 | * is the most secure. */ |
| 130 | int RSA_decrypt(RSA *rsa, size_t *out_len, uint8_t *out, size_t max_out, |
| 131 | const uint8_t *in, size_t in_len, int padding); |
| 132 | |
| 133 | /* RSA_public_encrypt encrypts |flen| bytes from |from| to the public key in |
| 134 | * |rsa| and writes the encrypted data to |to|. The |to| buffer must have at |
| 135 | * least |RSA_size| bytes of space. It returns the number of bytes written, or |
| 136 | * -1 on error. The |padding| argument must be one of the |RSA_*_PADDING| |
| 137 | * values. If in doubt, |RSA_PKCS1_PADDING| is the most common but |
| 138 | * |RSA_PKCS1_OAEP_PADDING| is the most secure. |
| 139 | * |
| 140 | * WARNING: this function is dangerous because it breaks the usual return value |
| 141 | * convention. Use |RSA_encrypt| instead. */ |
| 142 | int RSA_public_encrypt(int flen, const uint8_t *from, uint8_t *to, RSA *rsa, |
| 143 | int padding); |
| 144 | |
| 145 | /* RSA_private_decrypt decrypts |flen| bytes from |from| with the public key in |
| 146 | * |rsa| and writes the plaintext to |to|. The |to| buffer must have at |
| 147 | * least |RSA_size| bytes of space. It returns the number of bytes written, or |
| 148 | * -1 on error. The |padding| argument must be one of the |RSA_*_PADDING| |
| 149 | * values. If in doubt, |RSA_PKCS1_PADDING| is the most common but |
| 150 | * |RSA_PKCS1_OAEP_PADDING| is the most secure. |
| 151 | * |
| 152 | * WARNING: this function is dangerous because it breaks the usual return value |
| 153 | * convention. Use |RSA_decrypt| instead. */ |
| 154 | int RSA_private_decrypt(int flen, const uint8_t *from, uint8_t *to, RSA *rsa, |
| 155 | int padding); |
| 156 | |
David Benjamin | 0aa0767 | 2014-07-24 15:34:14 -0400 | [diff] [blame] | 157 | /* RSA_message_index_PKCS1_type_2 performs the first step of a PKCS #1 padding |
| 158 | * check for decryption. If the |from_len| bytes pointed to at |from| are a |
| 159 | * valid PKCS #1 message, it returns one and sets |*out_index| to the start of |
| 160 | * the unpadded message. The unpadded message is a suffix of the input and has |
| 161 | * length |from_len - *out_index|. Otherwise, it returns zero and sets |
| 162 | * |*out_index| to some undefined value. This function runs in time independent |
| 163 | * of the input data and is intended to be used directly to avoid |
| 164 | * Bleichenbacker's attack. |
| 165 | * |
| 166 | * WARNING: This function behaves differently from the usual OpenSSL convention |
| 167 | * in that it does NOT put an error on the queue in the error case. */ |
| 168 | int RSA_message_index_PKCS1_type_2(const uint8_t *from, size_t from_len, |
| 169 | size_t *out_index); |
| 170 | |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 171 | |
| 172 | /* Signing / Verification */ |
| 173 | |
| 174 | /* RSA_sign signs |in_len| bytes of digest from |in| with |rsa| and writes, at |
| 175 | * most, |RSA_size(rsa)| bytes to |out|. On successful return, the actual |
| 176 | * number of bytes written is written to |*out_len|. |
| 177 | * |
| 178 | * The |hash_nid| argument identifies the hash function used to calculate |in| |
| 179 | * and is embedded in the resulting signature. For example, it might be |
| 180 | * |NID_sha256|. |
| 181 | * |
| 182 | * It returns 1 on success and zero on error. */ |
| 183 | int RSA_sign(int hash_nid, const uint8_t *in, unsigned int in_len, uint8_t *out, |
| 184 | unsigned int *out_len, RSA *rsa); |
| 185 | |
| 186 | /* RSA_sign_raw signs |in_len| bytes from |in| with the public key from |rsa| |
| 187 | * and writes, at most, |max_out| bytes of encrypted data to |out|. The |
| 188 | * |max_out| argument must be, at least, |RSA_size| in order to ensure success. |
| 189 | * |
| 190 | * It returns 1 on success or zero on error. |
| 191 | * |
| 192 | * The |padding| argument must be one of the |RSA_*_PADDING| values. If in |
| 193 | * doubt, |RSA_PKCS1_PADDING| is the most common. */ |
| 194 | int RSA_sign_raw(RSA *rsa, size_t *out_len, uint8_t *out, size_t max_out, |
| 195 | const uint8_t *in, size_t in_len, int padding); |
| 196 | |
| 197 | /* RSA_verify verifies that |sig_len| bytes from |sig| are a valid, PKCS#1 |
| 198 | * signature of |msg_len| bytes at |msg| by |rsa|. |
| 199 | * |
| 200 | * The |hash_nid| argument identifies the hash function used to calculate |in| |
| 201 | * and is embedded in the resulting signature in order to prevent hash |
| 202 | * confusion attacks. For example, it might be |NID_sha256|. |
| 203 | * |
| 204 | * It returns one if the signature is valid and zero otherwise. |
| 205 | * |
| 206 | * WARNING: this differs from the original, OpenSSL function which additionally |
| 207 | * returned -1 on error. */ |
| 208 | int RSA_verify(int hash_nid, const uint8_t *msg, size_t msg_len, |
| 209 | const uint8_t *sig, size_t sig_len, RSA *rsa); |
| 210 | |
| 211 | /* RSA_verify_raw verifies |in_len| bytes of signature from |in| using the |
| 212 | * public key from |rsa| and writes, at most, |max_out| bytes of plaintext to |
| 213 | * |out|. The |max_out| argument must be, at least, |RSA_size| in order to |
| 214 | * ensure success. |
| 215 | * |
| 216 | * It returns 1 on success or zero on error. |
| 217 | * |
| 218 | * The |padding| argument must be one of the |RSA_*_PADDING| values. If in |
| 219 | * doubt, |RSA_PKCS1_PADDING| is the most common. */ |
| 220 | int RSA_verify_raw(RSA *rsa, size_t *out_len, uint8_t *out, size_t max_out, |
| 221 | const uint8_t *in, size_t in_len, int padding); |
| 222 | |
| 223 | /* RSA_private_encrypt encrypts |flen| bytes from |from| with the private key in |
| 224 | * |rsa| and writes the encrypted data to |to|. The |to| buffer must have at |
| 225 | * least |RSA_size| bytes of space. It returns the number of bytes written, or |
| 226 | * -1 on error. The |padding| argument must be one of the |RSA_*_PADDING| |
| 227 | * values. If in doubt, |RSA_PKCS1_PADDING| is the most common. |
| 228 | * |
| 229 | * WARNING: this function is dangerous because it breaks the usual return value |
| 230 | * convention. Use |RSA_sign_raw| instead. */ |
| 231 | int RSA_private_encrypt(int flen, const uint8_t *from, uint8_t *to, RSA *rsa, |
| 232 | int padding); |
| 233 | |
| 234 | /* RSA_private_encrypt verifies |flen| bytes of signature from |from| using the |
| 235 | * public key in |rsa| and writes the plaintext to |to|. The |to| buffer must |
| 236 | * have at least |RSA_size| bytes of space. It returns the number of bytes |
| 237 | * written, or -1 on error. The |padding| argument must be one of the |
| 238 | * |RSA_*_PADDING| values. If in doubt, |RSA_PKCS1_PADDING| is the most common. |
| 239 | * |
| 240 | * WARNING: this function is dangerous because it breaks the usual return value |
| 241 | * convention. Use |RSA_verify_raw| instead. */ |
| 242 | int RSA_public_decrypt(int flen, const uint8_t *from, uint8_t *to, RSA *rsa, |
| 243 | int padding); |
| 244 | |
| 245 | |
| 246 | /* Utility functions. */ |
| 247 | |
| 248 | /* RSA_size returns the number of bytes in the modulus, which is also the size |
| 249 | * of a signature of encrypted value using |rsa|. */ |
| 250 | unsigned RSA_size(const RSA *rsa); |
| 251 | |
David Benjamin | ecc0ce7 | 2014-07-18 18:39:42 -0400 | [diff] [blame] | 252 | /* RSA_is_opaque returns one if |rsa| is opaque and doesn't expose its key |
| 253 | * material. Otherwise it return zero. */ |
| 254 | int RSA_is_opaque(const RSA *rsa); |
| 255 | |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 256 | /* RSAPublicKey_dup allocates a fresh |RSA| and copies the private key from |
| 257 | * |rsa| into it. It returns the fresh |RSA| object, or NULL on error. */ |
| 258 | RSA *RSAPublicKey_dup(const RSA *rsa); |
| 259 | |
| 260 | /* RSAPrivateKey_dup allocates a fresh |RSA| and copies the private key from |
| 261 | * |rsa| into it. It returns the fresh |RSA| object, or NULL on error. */ |
| 262 | RSA *RSAPrivateKey_dup(const RSA *rsa); |
| 263 | |
Adam Langley | 409766d | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 264 | /* RSA_recover_crt_params uses |rsa->n|, |rsa->d| and |rsa->e| in order to |
| 265 | * calculate the two primes used and thus the precomputed, CRT values. These |
| 266 | * values are set in the |p|, |q|, |dmp1|, |dmq1| and |iqmp| members of |rsa|, |
| 267 | * which must be |NULL| on entry. It returns one on success and zero |
| 268 | * otherwise. */ |
| 269 | int RSA_recover_crt_params(RSA *rsa); |
| 270 | |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 271 | |
| 272 | /* ASN.1 functions. */ |
| 273 | |
| 274 | /* d2i_RSAPublicKey parses an ASN.1, DER-encoded, RSA public key from |len| |
| 275 | * bytes at |*inp|. If |out| is not NULL then, on exit, a pointer to the result |
| 276 | * is in |*out|. If |*out| is already non-NULL on entry then the result is |
| 277 | * written directly into |*out|, otherwise a fresh |RSA| is allocated. On |
| 278 | * successful exit, |*inp| is advanced past the DER structure. It returns the |
| 279 | * result or NULL on error. */ |
| 280 | RSA *d2i_RSAPublicKey(RSA **out, const uint8_t **inp, long len); |
| 281 | |
| 282 | /* i2d_RSAPublicKey marshals |in| to an ASN.1, DER structure. If |outp| is not |
| 283 | * NULL then the result is written to |*outp| and |*outp| is advanced just past |
| 284 | * the output. It returns the number of bytes in the result, whether written or |
| 285 | * not, or a negative value on error. */ |
| 286 | int i2d_RSAPublicKey(const RSA *in, uint8_t **outp); |
| 287 | |
| 288 | /* d2i_RSAPrivateKey parses an ASN.1, DER-encoded, RSA private key from |len| |
| 289 | * bytes at |*inp|. If |out| is not NULL then, on exit, a pointer to the result |
| 290 | * is in |*out|. If |*out| is already non-NULL on entry then the result is |
| 291 | * written directly into |*out|, otherwise a fresh |RSA| is allocated. On |
| 292 | * successful exit, |*inp| is advanced past the DER structure. It returns the |
| 293 | * result or NULL on error. */ |
| 294 | RSA *d2i_RSAPrivateKey(RSA **out, const uint8_t **inp, long len); |
| 295 | |
| 296 | /* i2d_RSAPrivateKey marshals |in| to an ASN.1, DER structure. If |outp| is not |
| 297 | * NULL then the result is written to |*outp| and |*outp| is advanced just past |
| 298 | * the output. It returns the number of bytes in the result, whether written or |
| 299 | * not, or a negative value on error. */ |
| 300 | int i2d_RSAPrivateKey(const RSA *in, uint8_t **outp); |
| 301 | |
| 302 | |
| 303 | /* ex_data functions. |
| 304 | * |
| 305 | * These functions are wrappers. See |ex_data.h| for details. */ |
| 306 | |
| 307 | int RSA_get_ex_new_index(long argl, void *argp, CRYPTO_EX_new *new_func, |
| 308 | CRYPTO_EX_dup *dup_func, CRYPTO_EX_free *free_func); |
| 309 | int RSA_set_ex_data(RSA *r, int idx, void *arg); |
| 310 | void *RSA_get_ex_data(const RSA *r, int idx); |
| 311 | |
David Benjamin | ecc0ce7 | 2014-07-18 18:39:42 -0400 | [diff] [blame] | 312 | /* RSA_FLAG_OPAQUE specifies that this RSA_METHOD does not expose its key |
| 313 | * material. This may be set if, for instance, it is wrapping some other crypto |
| 314 | * API, like a platform key store. */ |
| 315 | #define RSA_FLAG_OPAQUE 1 |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 316 | |
| 317 | /* RSA_FLAG_CACHE_PUBLIC causes a precomputed Montgomery context to be created, |
| 318 | * on demand, for the public key operations. */ |
| 319 | #define RSA_FLAG_CACHE_PUBLIC 2 |
| 320 | |
| 321 | /* RSA_FLAG_CACHE_PRIVATE causes a precomputed Montgomery context to be |
| 322 | * created, on demand, for the private key operations. */ |
| 323 | #define RSA_FLAG_CACHE_PRIVATE 4 |
| 324 | |
| 325 | /* RSA_FLAG_NO_BLINDING disables blinding of private operations. */ |
| 326 | #define RSA_FLAG_NO_BLINDING 8 |
| 327 | |
| 328 | /* RSA_FLAG_EXT_PKEY means that private key operations will be handled by |
| 329 | * |mod_exp| and that they do not depend on the private key components being |
| 330 | * present: for example a key stored in external hardware. */ |
| 331 | #define RSA_FLAG_EXT_PKEY 0x20 |
| 332 | |
| 333 | /* RSA_FLAG_SIGN_VER causes the |sign| and |verify| functions of |rsa_meth_st| |
| 334 | * to be called when set. */ |
| 335 | #define RSA_FLAG_SIGN_VER 0x40 |
| 336 | |
| 337 | |
| 338 | /* RSA public exponent values. */ |
| 339 | |
| 340 | #define RSA_3 0x3 |
| 341 | #define RSA_F4 0x10001 |
| 342 | |
| 343 | |
| 344 | struct rsa_meth_st { |
| 345 | struct openssl_method_common_st common; |
| 346 | |
| 347 | void *app_data; |
| 348 | |
| 349 | int (*init)(RSA *rsa); |
| 350 | int (*finish)(RSA *rsa); |
| 351 | |
David Benjamin | 925fee3 | 2014-07-11 14:14:08 -0400 | [diff] [blame] | 352 | /* size returns the size of the RSA modulus in bytes. */ |
| 353 | size_t (*size)(const RSA *rsa); |
| 354 | |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 355 | int (*sign)(int type, const uint8_t *m, unsigned int m_length, |
| 356 | uint8_t *sigret, unsigned int *siglen, const RSA *rsa); |
| 357 | |
| 358 | int (*verify)(int dtype, const uint8_t *m, unsigned int m_length, |
| 359 | const uint8_t *sigbuf, unsigned int siglen, const RSA *rsa); |
| 360 | |
| 361 | |
| 362 | /* These functions mirror the |RSA_*| functions of the same name. */ |
| 363 | int (*encrypt)(RSA *rsa, size_t *out_len, uint8_t *out, size_t max_out, |
| 364 | const uint8_t *in, size_t in_len, int padding); |
| 365 | int (*sign_raw)(RSA *rsa, size_t *out_len, uint8_t *out, size_t max_out, |
| 366 | const uint8_t *in, size_t in_len, int padding); |
| 367 | |
| 368 | int (*decrypt)(RSA *rsa, size_t *out_len, uint8_t *out, size_t max_out, |
| 369 | const uint8_t *in, size_t in_len, int padding); |
| 370 | int (*verify_raw)(RSA *rsa, size_t *out_len, uint8_t *out, size_t max_out, |
| 371 | const uint8_t *in, size_t in_len, int padding); |
| 372 | |
| 373 | int (*mod_exp)(BIGNUM *r0, const BIGNUM *I, RSA *rsa, |
| 374 | BN_CTX *ctx); /* Can be null */ |
| 375 | int (*bn_mod_exp)(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, |
| 376 | const BIGNUM *m, BN_CTX *ctx, |
| 377 | BN_MONT_CTX *m_ctx); |
| 378 | |
| 379 | int flags; |
| 380 | |
| 381 | int (*keygen)(RSA *rsa, int bits, BIGNUM *e, BN_GENCB *cb); |
| 382 | }; |
| 383 | |
| 384 | |
| 385 | /* Private functions. */ |
| 386 | |
| 387 | typedef struct bn_blinding_st BN_BLINDING; |
| 388 | |
| 389 | struct rsa_st { |
| 390 | /* version is only used during ASN.1 (de)serialisation. */ |
| 391 | long version; |
| 392 | RSA_METHOD *meth; |
| 393 | |
| 394 | BIGNUM *n; |
| 395 | BIGNUM *e; |
| 396 | BIGNUM *d; |
| 397 | BIGNUM *p; |
| 398 | BIGNUM *q; |
| 399 | BIGNUM *dmp1; |
| 400 | BIGNUM *dmq1; |
| 401 | BIGNUM *iqmp; |
| 402 | /* be careful using this if the RSA structure is shared */ |
| 403 | CRYPTO_EX_DATA ex_data; |
| 404 | int references; |
| 405 | int flags; |
| 406 | |
| 407 | /* Used to cache montgomery values */ |
| 408 | BN_MONT_CTX *_method_mod_n; |
| 409 | BN_MONT_CTX *_method_mod_p; |
| 410 | BN_MONT_CTX *_method_mod_q; |
| 411 | |
| 412 | /* num_blindings contains the size of the |blindings| and |blindings_inuse| |
| 413 | * arrays. This member and the |blindings_inuse| array are protected by |
| 414 | * CRYPTO_LOCK_RSA_BLINDING. */ |
| 415 | unsigned num_blindings; |
| 416 | /* blindings is an array of BN_BLINDING structures that can be reserved by a |
| 417 | * thread by locking CRYPTO_LOCK_RSA_BLINDING and changing the corresponding |
| 418 | * element in |blindings_inuse| from 0 to 1. */ |
| 419 | BN_BLINDING **blindings; |
| 420 | unsigned char *blindings_inuse; |
| 421 | }; |
| 422 | |
| 423 | |
| 424 | #if defined(__cplusplus) |
| 425 | } /* extern C */ |
| 426 | #endif |
| 427 | |
| 428 | #define RSA_F_RSA_padding_check_none 100 |
| 429 | #define RSA_F_RSA_padding_add_none 101 |
| 430 | #define RSA_F_RSA_padding_check_PKCS1_OAEP_mgf1 102 |
| 431 | #define RSA_F_RSA_verify_PKCS1_PSS_mgf1 103 |
| 432 | #define RSA_F_RSA_padding_add_PKCS1_PSS_mgf1 104 |
| 433 | #define RSA_F_RSA_verify 105 |
| 434 | #define RSA_F_rsa_setup_blinding 106 |
| 435 | #define RSA_F_verify_raw 107 |
| 436 | #define RSA_F_RSA_padding_add_PKCS1_type_1 108 |
| 437 | #define RSA_F_keygen 109 |
| 438 | #define RSA_F_RSA_padding_add_PKCS1_OAEP_mgf1 110 |
| 439 | #define RSA_F_pkcs1_prefixed_msg 111 |
| 440 | #define RSA_F_BN_BLINDING_update 112 |
| 441 | #define RSA_F_RSA_padding_check_SSLv23 113 |
| 442 | #define RSA_F_RSA_padding_add_SSLv23 114 |
| 443 | #define RSA_F_BN_BLINDING_new 115 |
| 444 | #define RSA_F_RSA_padding_add_PKCS1_type_2 116 |
| 445 | #define RSA_F_BN_BLINDING_convert_ex 117 |
| 446 | #define RSA_F_BN_BLINDING_invert_ex 118 |
| 447 | #define RSA_F_encrypt 119 |
| 448 | #define RSA_F_sign_raw 120 |
| 449 | #define RSA_F_RSA_new_method 121 |
| 450 | #define RSA_F_RSA_padding_check_PKCS1_type_1 122 |
| 451 | #define RSA_F_RSA_sign 123 |
| 452 | #define RSA_F_BN_BLINDING_create_param 124 |
| 453 | #define RSA_F_decrypt 125 |
| 454 | #define RSA_F_RSA_padding_check_PKCS1_type_2 126 |
Adam Langley | 409766d | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 455 | #define RSA_F_RSA_recover_crt_params 127 |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 456 | #define RSA_R_INVALID_MESSAGE_LENGTH 100 |
| 457 | #define RSA_R_DATA_GREATER_THAN_MOD_LEN 101 |
| 458 | #define RSA_R_NO_PUBLIC_EXPONENT 102 |
| 459 | #define RSA_R_DATA_TOO_LARGE_FOR_KEY_SIZE 103 |
| 460 | #define RSA_R_BLOCK_TYPE_IS_NOT_01 104 |
| 461 | #define RSA_R_DATA_TOO_SMALL_FOR_KEY_SIZE 105 |
| 462 | #define RSA_R_UNKNOWN_PADDING_TYPE 106 |
| 463 | #define RSA_R_TOO_MANY_ITERATIONS 107 |
| 464 | #define RSA_R_SLEN_RECOVERY_FAILED 108 |
| 465 | #define RSA_R_WRONG_SIGNATURE_LENGTH 109 |
| 466 | #define RSA_R_MODULUS_TOO_LARGE 110 |
| 467 | #define RSA_R_NULL_BEFORE_BLOCK_MISSING 111 |
| 468 | #define RSA_R_DATA_TOO_LARGE 112 |
| 469 | #define RSA_R_OUTPUT_BUFFER_TOO_SMALL 113 |
| 470 | #define RSA_R_SLEN_CHECK_FAILED 114 |
| 471 | #define RSA_R_FIRST_OCTET_INVALID 115 |
| 472 | #define RSA_R_BAD_E_VALUE 116 |
| 473 | #define RSA_R_DATA_TOO_LARGE_FOR_MODULUS 117 |
| 474 | #define RSA_R_EMPTY_PUBLIC_KEY 118 |
| 475 | #define RSA_R_BAD_PAD_BYTE_COUNT 119 |
| 476 | #define RSA_R_OAEP_DECODING_ERROR 120 |
| 477 | #define RSA_R_TOO_LONG 121 |
| 478 | #define RSA_R_BAD_FIXED_HEADER_DECRYPT 122 |
| 479 | #define RSA_R_DATA_TOO_SMALL 123 |
| 480 | #define RSA_R_UNKNOWN_ALGORITHM_TYPE 124 |
| 481 | #define RSA_R_PADDING_CHECK_FAILED 125 |
| 482 | #define RSA_R_THE_ASN1_OBJECT_IDENTIFIER_IS_NOT_KNOWN_FOR_THIS_MD 126 |
| 483 | #define RSA_R_BLOCK_TYPE_IS_NOT_02 127 |
| 484 | #define RSA_R_LAST_OCTET_INVALID 128 |
| 485 | #define RSA_R_DIGEST_TOO_BIG_FOR_RSA_KEY 129 |
| 486 | #define RSA_R_SSLV3_ROLLBACK_ATTACK 130 |
| 487 | #define RSA_R_KEY_SIZE_TOO_SMALL 131 |
| 488 | #define RSA_R_BAD_SIGNATURE 132 |
| 489 | #define RSA_R_BN_NOT_INITIALIZED 133 |
Adam Langley | 7d0a1d6 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 490 | #define RSA_R_PKCS_DECODING_ERROR 134 |
Adam Langley | 409766d | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 491 | #define RSA_R_BAD_RSA_PARAMETERS 135 |
| 492 | #define RSA_R_INTERNAL_ERROR 136 |
| 493 | #define RSA_R_CRT_PARAMS_ALREADY_GIVEN 137 |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 494 | |
| 495 | #endif /* OPENSSL_HEADER_RSA_H */ |