/* * Copyright (c) 2014 - 2020 The GmSSL Project. All rights reserved. * * 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 above 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 acknowledgment: * "This product includes software developed by the GmSSL Project. * (http://gmssl.org/)" * * 4. The name "GmSSL Project" must not be used to endorse or promote * products derived from this software without prior written * permission. For written permission, please contact * guanzhi1980@gmail.com. * * 5. Products derived from this software may not be called "GmSSL" * nor may "GmSSL" appear in their names without prior written * permission of the GmSSL Project. * * 6. Redistributions of any form whatsoever must retain the following * acknowledgment: * "This product includes software developed by the GmSSL Project * (http://gmssl.org/)" * * THIS SOFTWARE IS PROVIDED BY THE GmSSL PROJECT ``AS IS'' AND ANY * EXPRESSED 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 GmSSL PROJECT OR * ITS 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. */ #include #include #include #include #include #include static int test_ec_named_curve(void) { uint8_t buf[256]; uint8_t *p = buf; const uint8_t *cp = buf; size_t len = 0; char *curves[] = { "sm2p256v1", "prime192v1", "prime256v1", "secp256k1", "secp384r1", "secp521r1", }; int oid; int i; for (i = 0; i < sizeof(curves)/sizeof(curves[0]); i++) { if ((oid = ec_named_curve_from_name(curves[i])) == OID_undef) { error_print(); return -1; } if (ec_named_curve_to_der(oid, &p, &len) != 1) { error_print(); return -1; } } for (i = 0; i < sizeof(curves)/sizeof(curves[0]); i++) { if (ec_named_curve_from_der(&oid, &cp, &len) != 1) { error_print(); return -1; } if (oid != ec_named_curve_from_name(curves[i])) { error_print(); return -1; } format_print(stderr, 0, 4, "%s\n", ec_named_curve_name(oid)); } (void)asn1_length_is_zero(len); printf("%s() ok\n", __FUNCTION__); return 1; } static int test_ec_point_print(void) { SM2_KEY sm2_key; uint8_t buf[256]; uint8_t *p = buf; size_t len = 0; if (sm2_key_generate(&sm2_key) != 1) { error_print(); return -1; } if (sm2_point_to_der(&(sm2_key.public_key), &p, &len) != 1) { error_print(); return -1; } ec_point_print(stderr, 0, 4, "ECPoint", buf, len); printf("%s() ok\n", __FUNCTION__); return 1; } static int test_ec_private_key_print(void) { SM2_KEY sm2_key; uint8_t buf[256]; uint8_t *p = buf; const uint8_t *cp = buf; size_t len = 0; const uint8_t *d; size_t dlen; if (sm2_key_generate(&sm2_key) != 1) { error_print(); return -1; } if (sm2_private_key_to_der(&sm2_key, &p, &len) != 1 || asn1_sequence_from_der(&d, &dlen, &cp, &len) != 1 || asn1_length_is_zero(len) != 1) { error_print(); return -1; } ec_private_key_print(stderr, 0, 4, "ECPrivateKey", d, dlen); printf("%s() ok\n", __FUNCTION__); return 1; } int main(void) { if (test_ec_named_curve() != 1) goto err; if (test_ec_point_print() != 1) goto err; if (test_ec_private_key_print() != 1) goto err; printf("%s all tests passed\n", __FILE__); return 0; err: error_print(); return -1; }