/* Copyright (C) 1995-1998 Eric Young ([email protected]) * All rights reserved. * * This package is an SSL implementation written * by Eric Young ([email protected]). * 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 ([email protected]). * * 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 ([email protected])" * 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 ([email protected])" * * 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.] */ #include <openssl/rsa.h> #include <stdlib.h> #include <string.h> #include <gtest/gtest.h> #include <openssl/bn.h> #include <openssl/bytestring.h> #include <openssl/crypto.h> #include <openssl/digest.h> #include <openssl/err.h> #include <openssl/nid.h> #include "../fipsmodule/bn/internal.h" #include "../fipsmodule/rsa/internal.h" #include "../internal.h" #include "../test/test_util.h" #if defined(OPENSSL_THREADS) #include <thread> #include <vector> #endif // kPlaintext is a sample plaintext. static const uint8_t kPlaintext[] = …; // kKey1 is a DER-encoded 1024-bit RSAPrivateKey with e = 65537. static const uint8_t kKey1[] = …; static const uint8_t kKey1Public[] = …; // kOAEPCiphertext1 is a sample encryption of |kPlaintext| with |kKey1| using // RSA OAEP, SHA-1, and no label. It was generated with: // // clang-format off // openssl pkeyutl -encrypt -inkey key1.pem -pkeyopt rsa_padding_mode:oaep -pkeyopt rsa_oaep_md:sha1 -in plaintext | xxd -i // clang-format on static const uint8_t kOAEPCiphertext1[] = …; // kKey2 is a 2048-bit RSA private key, with e = 3. static const uint8_t kKey2[] = …; // kPKCS1Ciphertext2 is "hello world" encrypted with kKey2 and RSAES-PKCS1-v1_5. static const uint8_t kPKCS1Ciphertext2[] = …; // kOAEPCiphertext2 is a sample encryption of |kPlaintext| with |kKey2| using // RSA OAEP, SHA-1, and no label. It was generated with: // // clang-format off // openssl pkeyutl -encrypt -inkey key2.pem -pkeyopt rsa_padding_mode:oaep -pkeyopt rsa_oaep_md:sha1 -in plaintext | xxd -i // clang-format on static const uint8_t kOAEPCiphertext2[] = …; // kKey3 is a DER-encoded RSAPrivateKey. It is a 1024-bit RSA private key with // exponent 17. static const uint8_t kKey3[] = …; // kOAEPCiphertext3 is a sample encryption of |kPlaintext| with |kKey3| using // RSA OAEP, SHA-1, and no label. static const uint8_t kOAEPCiphertext3[] = …; // kEstonianRSAKey is an RSAPublicKey encoded with a negative modulus. See // https://crbug.com/532048. static const uint8_t kEstonianRSAKey[] = …; // kExponent1RSAKey is an RSAPublicKey encoded with an exponent of 1. See // https://crbug.com/541257 static const uint8_t kExponent1RSAKey[] = …; struct RSAEncryptParam { … } kRSAEncryptParams[] = …; class RSAEncryptTest : public testing::TestWithParam<RSAEncryptParam> { … }; TEST_P(RSAEncryptTest, TestKey) { … } INSTANTIATE_TEST_SUITE_P(…); TEST(RSATest, TestDecrypt) { … } TEST(RSATest, CheckFIPS) { … } TEST(RSATest, GenerateFIPS) { … } TEST(RSATest, BadKey) { … } TEST(RSATest, ASN1) { … } TEST(RSATest, BadExponent) { … } // Attempting to generate an excessively small key should fail. TEST(RSATest, GenerateSmallKey) { … } // Attempting to generate an funny RSA key length should round down. TEST(RSATest, RoundKeyLengths) { … } TEST(RSATest, BlindingDisabled) { … } TEST(RSATest, CheckKey) { … } TEST(RSATest, KeygenFail) { … } TEST(RSATest, KeygenFailOnce) { … } TEST(RSATest, KeygenInternalRetry) { … } // Test that, after a key has been used, it can still be modified into another // key. TEST(RSATest, OverwriteKey) { … } // Test that RSA keys do not support operations will cleanly fail them. TEST(RSATest, MissingParameters) { … } TEST(RSATest, Negative) { … } TEST(RSATest, LargeE) { … } // Test minimum key limits on RSA keys. Currently, we require a minimum of // 512-bit RSA. // // TODO(crbug.com/boringssl/607): Raise this limit. 512-bit RSA was factored in // 1999. TEST(RSATest, SmallKey) { … } #if !defined(BORINGSSL_SHARED_LIBRARY) TEST(RSATest, SqrtTwo) { bssl::UniquePtr<BIGNUM> sqrt(BN_new()), pow2(BN_new()); bssl::UniquePtr<BN_CTX> ctx(BN_CTX_new()); ASSERT_TRUE(sqrt); ASSERT_TRUE(pow2); ASSERT_TRUE(ctx); size_t bits = kBoringSSLRSASqrtTwoLen * BN_BITS2; ASSERT_TRUE(BN_one(pow2.get())); ASSERT_TRUE(BN_lshift(pow2.get(), pow2.get(), 2 * bits - 1)); // Check that sqrt² < pow2. ASSERT_TRUE( bn_set_words(sqrt.get(), kBoringSSLRSASqrtTwo, kBoringSSLRSASqrtTwoLen)); ASSERT_TRUE(BN_sqr(sqrt.get(), sqrt.get(), ctx.get())); EXPECT_LT(BN_cmp(sqrt.get(), pow2.get()), 0); // Check that pow2 < (sqrt + 1)². ASSERT_TRUE( bn_set_words(sqrt.get(), kBoringSSLRSASqrtTwo, kBoringSSLRSASqrtTwoLen)); ASSERT_TRUE(BN_add_word(sqrt.get(), 1)); ASSERT_TRUE(BN_sqr(sqrt.get(), sqrt.get(), ctx.get())); EXPECT_LT(BN_cmp(pow2.get(), sqrt.get()), 0); // Check the kBoringSSLRSASqrtTwo is sized for a 4096-bit RSA key. EXPECT_EQ(4096u / 2u, bits); } #endif // !BORINGSSL_SHARED_LIBRARY #if defined(OPENSSL_THREADS) TEST(RSATest, Threads) { … } // This test might be excessively slow on slower CPUs or platforms that do not // expect server workloads. It is disabled by default and reenabled on some // platforms when running tests standalone via all_tests.go. // // Additionally, even when running disabled tests standalone, limit this to // x86_64. On other platforms, this test hits resource limits or is too slow. We // also disable on FreeBSD. See https://crbug.com/boringssl/603. #if defined(OPENSSL_TSAN) || \ (defined(OPENSSL_X86_64) && !defined(OPENSSL_FREEBSD)) TEST(RSATest, DISABLED_BlindingCacheConcurrency) { … } #endif // TSAN || (X86_64 && !FREEBSD) #endif // THREADS