2 * Originally written by Bodo Moeller for the OpenSSL project.
4 /* ====================================================================
5 * Copyright (c) 1998-2002 The OpenSSL Project. All rights reserved.
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
14 * 2. Redistributions in binary form must reproduce the above copyright
15 * notice, this list of conditions and the following disclaimer in
16 * the documentation and/or other materials provided with the
19 * 3. All advertising materials mentioning features or use of this
20 * software must display the following acknowledgment:
21 * "This product includes software developed by the OpenSSL Project
22 * for use in the OpenSSL Toolkit. (http://www.openssl.org/)"
24 * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to
25 * endorse or promote products derived from this software without
26 * prior written permission. For written permission, please contact
27 * openssl-core@openssl.org.
29 * 5. Products derived from this software may not be called "OpenSSL"
30 * nor may "OpenSSL" appear in their names without prior written
31 * permission of the OpenSSL Project.
33 * 6. Redistributions of any form whatsoever must retain the following
35 * "This product includes software developed by the OpenSSL Project
36 * for use in the OpenSSL Toolkit (http://www.openssl.org/)"
38 * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY
39 * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
40 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
41 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE OpenSSL PROJECT OR
42 * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
43 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
44 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
45 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
46 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
47 * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
48 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
49 * OF THE POSSIBILITY OF SUCH DAMAGE.
50 * ====================================================================
52 * This product includes cryptographic software written by Eric Young
53 * (eay@cryptsoft.com). This product includes software written by Tim
54 * Hudson (tjh@cryptsoft.com).
57 /* ====================================================================
58 * Copyright 2002 Sun Microsystems, Inc. ALL RIGHTS RESERVED.
60 * Portions of the attached software ("Contribution") are developed by
61 * SUN MICROSYSTEMS, INC., and are contributed to the OpenSSL project.
63 * The Contribution is licensed pursuant to the OpenSSL open source
64 * license provided above.
66 * The elliptic curve binary polynomial software is originally written by
67 * Sheueling Chang Shantz and Douglas Stebila of Sun Microsystems Laboratories.
71 #include <openssl/err.h>
74 EC_GROUP *EC_GROUP_new_curve_GFp(const BIGNUM *p, const BIGNUM *a,
75 const BIGNUM *b, BN_CTX *ctx)
77 const EC_METHOD *meth;
80 #if defined(OPENSSL_BN_ASM_MONT)
82 * This might appear controversial, but the fact is that generic
83 * prime method was observed to deliver better performance even
84 * for NIST primes on a range of platforms, e.g.: 60%-15%
85 * improvement on IA-64, ~25% on ARM, 30%-90% on P4, 20%-25%
86 * in 32-bit build and 35%--12% in 64-bit build on Core2...
87 * Coefficients are relative to optimized bn_nist.c for most
88 * intensive ECDSA verify and ECDH operations for 192- and 521-
89 * bit keys respectively. Choice of these boundary values is
90 * arguable, because the dependency of improvement coefficient
91 * from key length is not a "monotone" curve. For example while
92 * 571-bit result is 23% on ARM, 384-bit one is -1%. But it's
93 * generally faster, sometimes "respectfully" faster, sometimes
94 * "tolerably" slower... What effectively happens is that loop
95 * with bn_mul_add_words is put against bn_mul_mont, and the
96 * latter "wins" on short vectors. Correct solution should be
97 * implementing dedicated NxN multiplication subroutines for
98 * small N. But till it materializes, let's stick to generic
102 meth = EC_GFp_mont_method();
104 if (BN_nist_mod_func(p))
105 meth = EC_GFp_nist_method();
107 meth = EC_GFp_mont_method();
110 ret = EC_GROUP_new(meth);
114 if (!EC_GROUP_set_curve_GFp(ret, p, a, b, ctx)) {
115 EC_GROUP_clear_free(ret);
122 #ifndef OPENSSL_NO_EC2M
123 EC_GROUP *EC_GROUP_new_curve_GF2m(const BIGNUM *p, const BIGNUM *a,
124 const BIGNUM *b, BN_CTX *ctx)
126 const EC_METHOD *meth;
129 meth = EC_GF2m_simple_method();
131 ret = EC_GROUP_new(meth);
135 if (!EC_GROUP_set_curve_GF2m(ret, p, a, b, ctx)) {
136 EC_GROUP_clear_free(ret);