summaryrefslogtreecommitdiff
path: root/src/lib/libcrypto/ec/ec_mult.c
diff options
context:
space:
mode:
authortb <>2022-11-19 07:00:57 +0000
committertb <>2022-11-19 07:00:57 +0000
commitb197546e7fd8128aedea248a6196a0d25734b937 (patch)
treeea2ed349b4963d6f17652f4f5e962ee6d7cb2183 /src/lib/libcrypto/ec/ec_mult.c
parentc85d7e98a77173fe38f0421c7cf06dc09bc9a746 (diff)
downloadopenbsd-b197546e7fd8128aedea248a6196a0d25734b937.tar.gz
openbsd-b197546e7fd8128aedea248a6196a0d25734b937.tar.bz2
openbsd-b197546e7fd8128aedea248a6196a0d25734b937.zip
whitespace
Diffstat (limited to 'src/lib/libcrypto/ec/ec_mult.c')
-rw-r--r--src/lib/libcrypto/ec/ec_mult.c14
1 files changed, 7 insertions, 7 deletions
diff --git a/src/lib/libcrypto/ec/ec_mult.c b/src/lib/libcrypto/ec/ec_mult.c
index 05f89a5787..1198a6f6b1 100644
--- a/src/lib/libcrypto/ec/ec_mult.c
+++ b/src/lib/libcrypto/ec/ec_mult.c
@@ -1,4 +1,4 @@
1/* $OpenBSD: ec_mult.c,v 1.24 2018/07/15 16:27:39 tb Exp $ */ 1/* $OpenBSD: ec_mult.c,v 1.25 2022/11/19 07:00:57 tb Exp $ */
2/* 2/*
3 * Originally written by Bodo Moeller and Nils Larsch for the OpenSSL project. 3 * Originally written by Bodo Moeller and Nils Larsch for the OpenSSL project.
4 */ 4 */
@@ -132,7 +132,7 @@ ec_pre_comp_dup(void *src_)
132 return src_; 132 return src_;
133} 133}
134 134
135static void 135static void
136ec_pre_comp_free(void *pre_) 136ec_pre_comp_free(void *pre_)
137{ 137{
138 int i; 138 int i;
@@ -155,7 +155,7 @@ ec_pre_comp_free(void *pre_)
155 free(pre); 155 free(pre);
156} 156}
157 157
158static void 158static void
159ec_pre_comp_clear_free(void *pre_) 159ec_pre_comp_clear_free(void *pre_)
160{ 160{
161 int i; 161 int i;
@@ -331,7 +331,7 @@ compute_wNAF(const BIGNUM * scalar, int w, size_t * ret_len)
331 * scalar*generator 331 * scalar*generator
332 * in the addition if scalar != NULL 332 * in the addition if scalar != NULL
333 */ 333 */
334int 334int
335ec_wNAF_mul(const EC_GROUP * group, EC_POINT * r, const BIGNUM * scalar, 335ec_wNAF_mul(const EC_GROUP * group, EC_POINT * r, const BIGNUM * scalar,
336 size_t num, const EC_POINT * points[], const BIGNUM * scalars[], BN_CTX * ctx) 336 size_t num, const EC_POINT * points[], const BIGNUM * scalars[], BN_CTX * ctx)
337{ 337{
@@ -721,7 +721,7 @@ ec_wNAF_mul(const EC_GROUP * group, EC_POINT * r, const BIGNUM * scalar,
721 * points[2^(w-1)*numblocks-1] = (2^(w-1)) * 2^(blocksize*(numblocks-1)) * generator 721 * points[2^(w-1)*numblocks-1] = (2^(w-1)) * 2^(blocksize*(numblocks-1)) * generator
722 * points[2^(w-1)*numblocks] = NULL 722 * points[2^(w-1)*numblocks] = NULL
723 */ 723 */
724int 724int
725ec_wNAF_precompute_mult(EC_GROUP * group, BN_CTX * ctx) 725ec_wNAF_precompute_mult(EC_GROUP * group, BN_CTX * ctx)
726{ 726{
727 const EC_POINT *generator; 727 const EC_POINT *generator;
@@ -764,7 +764,7 @@ ec_wNAF_precompute_mult(EC_GROUP * group, BN_CTX * ctx)
764 /* 764 /*
765 * The following parameters mean we precompute (approximately) one 765 * The following parameters mean we precompute (approximately) one
766 * point per bit. 766 * point per bit.
767 * 767 *
768 * TBD: The combination 8, 4 is perfect for 160 bits; for other bit 768 * TBD: The combination 8, 4 is perfect for 160 bits; for other bit
769 * lengths, other parameter combinations might provide better 769 * lengths, other parameter combinations might provide better
770 * efficiency. 770 * efficiency.
@@ -875,7 +875,7 @@ ec_wNAF_precompute_mult(EC_GROUP * group, BN_CTX * ctx)
875} 875}
876 876
877 877
878int 878int
879ec_wNAF_have_precompute_mult(const EC_GROUP * group) 879ec_wNAF_have_precompute_mult(const EC_GROUP * group)
880{ 880{
881 if (EC_EX_DATA_get_data(group->extra_data, ec_pre_comp_dup, ec_pre_comp_free, ec_pre_comp_clear_free) != NULL) 881 if (EC_EX_DATA_get_data(group->extra_data, ec_pre_comp_dup, ec_pre_comp_free, ec_pre_comp_clear_free) != NULL)