2014-06-20 20:00:00 +01:00
|
|
|
/* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
|
|
|
|
* All rights reserved.
|
|
|
|
*
|
|
|
|
* This package is an SSL implementation written
|
|
|
|
* by Eric Young (eay@cryptsoft.com).
|
|
|
|
* The implementation was written so as to conform with Netscapes SSL.
|
|
|
|
*
|
|
|
|
* This library is free for commercial and non-commercial use as long as
|
|
|
|
* the following conditions are aheared to. The following conditions
|
|
|
|
* apply to all code found in this distribution, be it the RC4, RSA,
|
|
|
|
* lhash, DES, etc., code; not just the SSL code. The SSL documentation
|
|
|
|
* included with this distribution is covered by the same copyright terms
|
|
|
|
* except that the holder is Tim Hudson (tjh@cryptsoft.com).
|
|
|
|
*
|
|
|
|
* Copyright remains Eric Young's, and as such any Copyright notices in
|
|
|
|
* the code are not to be removed.
|
|
|
|
* If this package is used in a product, Eric Young should be given attribution
|
|
|
|
* as the author of the parts of the library used.
|
|
|
|
* This can be in the form of a textual message at program startup or
|
|
|
|
* in documentation (online or textual) provided with the package.
|
|
|
|
*
|
|
|
|
* Redistribution and use in source and binary forms, with or without
|
|
|
|
* modification, are permitted provided that the following conditions
|
|
|
|
* are met:
|
|
|
|
* 1. Redistributions of source code must retain the copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer.
|
|
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
|
|
* documentation and/or other materials provided with the distribution.
|
|
|
|
* 3. All advertising materials mentioning features or use of this software
|
|
|
|
* must display the following acknowledgement:
|
|
|
|
* "This product includes cryptographic software written by
|
|
|
|
* Eric Young (eay@cryptsoft.com)"
|
|
|
|
* The word 'cryptographic' can be left out if the rouines from the library
|
|
|
|
* being used are not cryptographic related :-).
|
|
|
|
* 4. If you include any Windows specific code (or a derivative thereof) from
|
|
|
|
* the apps directory (application code) you must include an acknowledgement:
|
|
|
|
* "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
|
|
|
|
*
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
|
|
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
|
|
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
|
|
* SUCH DAMAGE.
|
|
|
|
*
|
|
|
|
* The licence and distribution terms for any publically available version or
|
|
|
|
* derivative of this code cannot be changed. i.e. this code cannot simply be
|
|
|
|
* copied and put under another distribution licence
|
|
|
|
* [including the GNU Public Licence.] */
|
|
|
|
|
|
|
|
#ifndef OPENSSL_HEADER_RSA_INTERNAL_H
|
|
|
|
#define OPENSSL_HEADER_RSA_INTERNAL_H
|
|
|
|
|
|
|
|
#include <openssl/base.h>
|
|
|
|
|
2017-04-10 23:35:22 +01:00
|
|
|
#include <openssl/bn.h>
|
|
|
|
|
2014-06-20 20:00:00 +01:00
|
|
|
|
|
|
|
#if defined(__cplusplus)
|
|
|
|
extern "C" {
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
2015-10-29 17:19:12 +00:00
|
|
|
/* Default implementations of RSA operations. */
|
|
|
|
|
|
|
|
extern const RSA_METHOD RSA_default_method;
|
|
|
|
|
|
|
|
size_t rsa_default_size(const RSA *rsa);
|
|
|
|
int rsa_default_encrypt(RSA *rsa, size_t *out_len, uint8_t *out, size_t max_out,
|
|
|
|
const uint8_t *in, size_t in_len, int padding);
|
|
|
|
int rsa_default_sign_raw(RSA *rsa, size_t *out_len, uint8_t *out,
|
|
|
|
size_t max_out, const uint8_t *in, size_t in_len,
|
|
|
|
int padding);
|
|
|
|
int rsa_default_decrypt(RSA *rsa, size_t *out_len, uint8_t *out, size_t max_out,
|
|
|
|
const uint8_t *in, size_t in_len, int padding);
|
|
|
|
int rsa_default_private_transform(RSA *rsa, uint8_t *out, const uint8_t *in,
|
|
|
|
size_t len);
|
|
|
|
int rsa_default_keygen(RSA *rsa, int bits, BIGNUM *e_value, BN_GENCB *cb);
|
|
|
|
|
|
|
|
|
Require the public exponent to be available in RSA blinding.
Require the public exponent to be available unless
|RSA_FLAG_NO_BLINDING| is set on the key. Also, document this.
If the public exponent |e| is not available, then we could compute it
from |p|, |q|, and |d|. However, there's no reasonable situation in
which we'd have |p| or |q| but not |e|; either we have all the CRT
parameters, or we have (e, d, n), or we have only (d, n). The
calculation to compute |e| exposes the private key to risk of side
channel attacks.
Also, it was particularly wasteful to compute |e| for each
|BN_BLINDING| created, instead of just once before the first
|BN_BLINDING| was created.
|BN_BLINDING| now no longer needs to contain a duplicate copy of |e|,
so it is now more space-efficient.
Note that the condition |b->e != NULL| in |bn_blinding_update| was
always true since commit cbf56a5683ddda831ff91c46ea48d1fba545db66.
Change-Id: Ic2fd6980e0d359dcd53772a7c31bdd0267e316b4
Reviewed-on: https://boringssl-review.googlesource.com/7594
Reviewed-by: David Benjamin <davidben@google.com>
2016-03-27 06:42:31 +01:00
|
|
|
BN_BLINDING *BN_BLINDING_new(void);
|
2014-06-20 20:00:00 +01:00
|
|
|
void BN_BLINDING_free(BN_BLINDING *b);
|
Require the public exponent to be available in RSA blinding.
Require the public exponent to be available unless
|RSA_FLAG_NO_BLINDING| is set on the key. Also, document this.
If the public exponent |e| is not available, then we could compute it
from |p|, |q|, and |d|. However, there's no reasonable situation in
which we'd have |p| or |q| but not |e|; either we have all the CRT
parameters, or we have (e, d, n), or we have only (d, n). The
calculation to compute |e| exposes the private key to risk of side
channel attacks.
Also, it was particularly wasteful to compute |e| for each
|BN_BLINDING| created, instead of just once before the first
|BN_BLINDING| was created.
|BN_BLINDING| now no longer needs to contain a duplicate copy of |e|,
so it is now more space-efficient.
Note that the condition |b->e != NULL| in |bn_blinding_update| was
always true since commit cbf56a5683ddda831ff91c46ea48d1fba545db66.
Change-Id: Ic2fd6980e0d359dcd53772a7c31bdd0267e316b4
Reviewed-on: https://boringssl-review.googlesource.com/7594
Reviewed-by: David Benjamin <davidben@google.com>
2016-03-27 06:42:31 +01:00
|
|
|
int BN_BLINDING_convert(BIGNUM *n, BN_BLINDING *b, const BIGNUM *e,
|
|
|
|
const BN_MONT_CTX *mont_ctx, BN_CTX *ctx);
|
2016-03-18 02:10:04 +00:00
|
|
|
int BN_BLINDING_invert(BIGNUM *n, const BN_BLINDING *b, BN_MONT_CTX *mont_ctx,
|
|
|
|
BN_CTX *ctx);
|
2014-06-20 20:00:00 +01:00
|
|
|
|
|
|
|
|
2017-03-14 19:35:27 +00:00
|
|
|
int RSA_padding_add_PKCS1_type_1(uint8_t *to, size_t to_len,
|
|
|
|
const uint8_t *from, size_t from_len);
|
2017-03-16 15:54:11 +00:00
|
|
|
int RSA_padding_check_PKCS1_type_1(uint8_t *out, size_t *out_len,
|
|
|
|
size_t max_out, const uint8_t *from,
|
|
|
|
size_t from_len);
|
2017-03-14 19:35:27 +00:00
|
|
|
int RSA_padding_add_PKCS1_type_2(uint8_t *to, size_t to_len,
|
|
|
|
const uint8_t *from, size_t from_len);
|
2017-03-16 17:15:31 +00:00
|
|
|
int RSA_padding_check_PKCS1_type_2(uint8_t *out, size_t *out_len,
|
|
|
|
size_t max_out, const uint8_t *from,
|
|
|
|
size_t from_len);
|
|
|
|
int RSA_padding_check_PKCS1_OAEP_mgf1(uint8_t *out, size_t *out_len,
|
|
|
|
size_t max_out, const uint8_t *from,
|
|
|
|
size_t from_len, const uint8_t *param,
|
|
|
|
size_t param_len, const EVP_MD *md,
|
|
|
|
const EVP_MD *mgf1md);
|
2017-03-14 19:35:27 +00:00
|
|
|
int RSA_padding_add_none(uint8_t *to, size_t to_len, const uint8_t *from,
|
|
|
|
size_t from_len);
|
2014-06-20 20:00:00 +01:00
|
|
|
|
2014-08-18 21:29:45 +01:00
|
|
|
/* RSA_private_transform calls either the method-specific |private_transform|
|
|
|
|
* function (if given) or the generic one. See the comment for
|
|
|
|
* |private_transform| in |rsa_meth_st|. */
|
|
|
|
int RSA_private_transform(RSA *rsa, uint8_t *out, const uint8_t *in,
|
|
|
|
size_t len);
|
|
|
|
|
2014-06-20 20:00:00 +01:00
|
|
|
|
2017-04-10 23:35:22 +01:00
|
|
|
/* The following utility functions are exported for test purposes. */
|
|
|
|
|
|
|
|
extern const BN_ULONG kBoringSSLRSASqrtTwo[];
|
|
|
|
extern const size_t kBoringSSLRSASqrtTwoLen;
|
|
|
|
|
|
|
|
/* rsa_less_than_words returns one if |a| < |b| and zero otherwise, where |a|
|
|
|
|
* and |b| both are |len| words long. It runs in constant time. */
|
|
|
|
int rsa_less_than_words(const BN_ULONG *a, const BN_ULONG *b, size_t len);
|
|
|
|
|
|
|
|
/* rsa_greater_than_pow2 returns one if |b| is greater than 2^|n| and zero
|
|
|
|
* otherwise. */
|
|
|
|
int rsa_greater_than_pow2(const BIGNUM *b, int n);
|
|
|
|
|
|
|
|
|
2014-06-20 20:00:00 +01:00
|
|
|
#if defined(__cplusplus)
|
|
|
|
} /* extern C */
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#endif /* OPENSSL_HEADER_RSA_INTERNAL_H */
|