1 /* Originally written by Bodo Moeller for the OpenSSL project.
2 * ====================================================================
3 * Copyright (c) 1998-2005 The OpenSSL Project. All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
8 *
9 * 1. Redistributions of source code must retain the above copyright
10 * notice, this list of conditions and the following disclaimer.
11 *
12 * 2. Redistributions in binary form must reproduce the above copyright
13 * notice, this list of conditions and the following disclaimer in
14 * the documentation and/or other materials provided with the
15 * distribution.
16 *
17 * 3. All advertising materials mentioning features or use of this
18 * software must display the following acknowledgment:
19 * "This product includes software developed by the OpenSSL Project
20 * for use in the OpenSSL Toolkit. (http://www.openssl.org/)"
21 *
22 * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to
23 * endorse or promote products derived from this software without
24 * prior written permission. For written permission, please contact
25 * openssl-core@openssl.org.
26 *
27 * 5. Products derived from this software may not be called "OpenSSL"
28 * nor may "OpenSSL" appear in their names without prior written
29 * permission of the OpenSSL Project.
30 *
31 * 6. Redistributions of any form whatsoever must retain the following
32 * acknowledgment:
33 * "This product includes software developed by the OpenSSL Project
34 * for use in the OpenSSL Toolkit (http://www.openssl.org/)"
35 *
36 * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY
37 * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
38 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
39 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE OpenSSL PROJECT OR
40 * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
41 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
42 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
43 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
44 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
45 * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
46 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
47 * OF THE POSSIBILITY OF SUCH DAMAGE.
48 * ====================================================================
49 *
50 * This product includes cryptographic software written by Eric Young
51 * (eay@cryptsoft.com). This product includes software written by Tim
52 * Hudson (tjh@cryptsoft.com).
53 *
54 */
55 /* ====================================================================
56 * Copyright 2002 Sun Microsystems, Inc. ALL RIGHTS RESERVED.
57 *
58 * Portions of the attached software ("Contribution") are developed by
59 * SUN MICROSYSTEMS, INC., and are contributed to the OpenSSL project.
60 *
61 * The Contribution is licensed pursuant to the OpenSSL open source
62 * license provided above.
63 *
64 * The elliptic curve binary polynomial software is originally written by
65 * Sheueling Chang Shantz and Douglas Stebila of Sun Microsystems
66 * Laboratories. */
67
68 #include <stdio.h>
69
70 #include <openssl/bn.h>
71 #include <openssl/crypto.h>
72 #include <openssl/ec.h>
73 #include <openssl/obj.h>
74
75
example_EC_POINT_mul(void)76 int example_EC_POINT_mul(void) {
77 /* This example ensures that 10×∞ + G = G, in P-256. */
78 EC_GROUP *group = NULL;
79 EC_POINT *p = NULL, *result = NULL;
80 BIGNUM *n = NULL;
81 int ret = 0;
82 const EC_POINT *generator;
83
84 group = EC_GROUP_new_by_curve_name(NID_X9_62_prime256v1);
85 p = EC_POINT_new(group);
86 result = EC_POINT_new(group);
87 n = BN_new();
88
89 if (p == NULL ||
90 result == NULL ||
91 group == NULL ||
92 n == NULL ||
93 !EC_POINT_set_to_infinity(group, p) ||
94 !BN_set_word(n, 10)) {
95 goto err;
96 }
97
98 /* First check that 10×∞ = ∞. */
99 if (!EC_POINT_mul(group, result, NULL, p, n, NULL) ||
100 !EC_POINT_is_at_infinity(group, result)) {
101 goto err;
102 }
103
104 generator = EC_GROUP_get0_generator(group);
105
106 /* Now check that 10×∞ + G = G. */
107 if (!EC_POINT_mul(group, result, BN_value_one(), p, n, NULL) ||
108 EC_POINT_cmp(group, result, generator, NULL) != 0) {
109 goto err;
110 }
111
112 ret = 1;
113
114 err:
115 BN_free(n);
116 EC_POINT_free(result);
117 EC_POINT_free(p);
118 EC_GROUP_free(group);
119
120 return ret;
121 }
122
main(void)123 int main(void) {
124 CRYPTO_library_init();
125
126 if (!example_EC_POINT_mul()) {
127 fprintf(stderr, "failed\n");
128 return 1;
129 }
130
131 printf("PASS\n");
132 return 0;
133 }
134