summaryrefslogtreecommitdiff
path: root/lib/libcrypto/ec/ecp_methods.c
diff options
context:
space:
mode:
authorTheo Buehler <tb@cvs.openbsd.org>2024-11-12 13:09:55 +0000
committerTheo Buehler <tb@cvs.openbsd.org>2024-11-12 13:09:55 +0000
commit6e28218da13c10c1a7d7e73dccecb1c016bb2b44 (patch)
tree43c66315f770e0a9dd05cd440ae307c62bb0ebf5 /lib/libcrypto/ec/ecp_methods.c
parent92b2e10ac794ba241e7e9fe9edcf3659d0dc825c (diff)
Garbage collect a reference to ecp_mont.c, rewrap comment
spotted by jsing
Diffstat (limited to 'lib/libcrypto/ec/ecp_methods.c')
-rw-r--r--lib/libcrypto/ec/ecp_methods.c13
1 files changed, 6 insertions, 7 deletions
diff --git a/lib/libcrypto/ec/ecp_methods.c b/lib/libcrypto/ec/ecp_methods.c
index 3deee06b50c..61f95b5bb9f 100644
--- a/lib/libcrypto/ec/ecp_methods.c
+++ b/lib/libcrypto/ec/ecp_methods.c
@@ -1,4 +1,4 @@
-/* $OpenBSD: ecp_methods.c,v 1.6 2024/11/12 11:01:14 tb Exp $ */
+/* $OpenBSD: ecp_methods.c,v 1.7 2024/11/12 13:09:54 tb Exp $ */
/* Includes code written by Lenka Fibikova <fibikova@exp-math.uni-essen.de>
* for the OpenSSL project.
* Includes code written by Bodo Moeller for the OpenSSL project.
@@ -73,14 +73,13 @@
#include "ec_local.h"
/*
- * Most method functions in this file are designed to work with
- * non-trivial representations of field elements if necessary
- * (see ecp_mont.c): while standard modular addition and subtraction
- * are used, the field_mul and field_sqr methods will be used for
- * multiplication, and field_encode and field_decode (if defined)
+ * Most method functions in this file are designed to work with non-trivial
+ * representations of field elements if necessary: while standard modular
+ * addition and subtraction are used, the field_mul and field_sqr methods will
+ * be used for multiplication, and field_encode and field_decode (if defined)
* will be used for converting between representations.
*
- * Functions ec_points_make_affine() and ec_point_get_affine_coordinates()
+ * The functions ec_points_make_affine() and ec_point_get_affine_coordinates()
* assume that if a non-trivial representation is used, it is a Montgomery
* representation (i.e. 'encoding' means multiplying by some factor R).
*/