diff options
| author | Bodo Möller <bodo@openssl.org> | 2002-08-02 17:25:05 +0000 |
|---|---|---|
| committer | Bodo Möller <bodo@openssl.org> | 2002-08-02 17:25:05 +0000 |
| commit | 848c849584c2c6de3373516a762fa4279d89a8c3 (patch) | |
| tree | 66bfe212be99f1d7667a8bc2c0d101ad63321d74 /crypto | |
| parent | 102c8f47bf899bfc76047bdde396d40ea3b6ce7c (diff) | |
| download | openssl-848c849584c2c6de3373516a762fa4279d89a8c3.zip openssl-848c849584c2c6de3373516a762fa4279d89a8c3.tar.gz openssl-848c849584c2c6de3373516a762fa4279d89a8c3.tar.bz2 | |
optical changes
Diffstat (limited to 'crypto')
| -rw-r--r-- | crypto/ec/ec_lcl.h | 8 | ||||
| -rw-r--r-- | crypto/ec/ectest.c | 7 |
2 files changed, 8 insertions, 7 deletions
diff --git a/crypto/ec/ec_lcl.h b/crypto/ec/ec_lcl.h index 5730f2a..247c985 100644 --- a/crypto/ec/ec_lcl.h +++ b/crypto/ec/ec_lcl.h @@ -207,10 +207,10 @@ struct ec_group_st { */ unsigned int poly[5]; /* Field specification for curves over GF(2^m). - * The irreducible f(t) is then of the form: - * t^poly[0] + t^poly[1] + ... + t^poly[k] - * where m = poly[0] > poly[1] > ... > poly[k] = 0. - */ + * The irreducible f(t) is then of the form: + * t^poly[0] + t^poly[1] + ... + t^poly[k] + * where m = poly[0] > poly[1] > ... > poly[k] = 0. + */ BIGNUM a, b; /* Curve coefficients. * (Here the assumption is that BIGNUMs can be used diff --git a/crypto/ec/ectest.c b/crypto/ec/ectest.c index 9d46d15..7f1af44 100644 --- a/crypto/ec/ectest.c +++ b/crypto/ec/ectest.c @@ -752,8 +752,8 @@ void char2_field_tests() if (!BN_hex2bn(&a, "3")) ABORT; if (!BN_hex2bn(&b, "1")) ABORT; - group = EC_GROUP_new(EC_GF2m_simple_method()); /* applications should use EC_GROUP_new_curve_GFp - * so that the library gets to choose the EC_METHOD */ + group = EC_GROUP_new(EC_GF2m_simple_method()); /* applications should use EC_GROUP_new_curve_GF2m + * so that the library gets to choose the EC_METHOD */ if (!group) ABORT; if (!EC_GROUP_set_curve_GF2m(group, p, a, b, ctx)) ABORT; @@ -774,7 +774,7 @@ void char2_field_tests() BN_print_fp(stdout, a); fprintf(stdout, "\n b = 0x"); BN_print_fp(stdout, b); - fprintf(stdout, "\n"); + fprintf(stdout, "\n(0x... means binary polynomial)\n"); P = EC_POINT_new(group); Q = EC_POINT_new(group); @@ -1171,6 +1171,7 @@ int main(int argc, char *argv[]) RAND_seed(rnd_seed, sizeof rnd_seed); /* or BN_generate_prime may fail */ prime_field_tests(); + puts(""); char2_field_tests(); ENGINE_cleanup(); |