projects
/
oweals
/
openssl.git
/ commitdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
| commitdiff |
tree
raw
|
patch
|
inline
| side by side (parent:
4b08da5
)
correct+extend publication info
author
Bodo Möller
<bodo@openssl.org>
Mon, 12 Sep 2005 01:39:46 +0000
(
01:39
+0000)
committer
Bodo Möller
<bodo@openssl.org>
Mon, 12 Sep 2005 01:39:46 +0000
(
01:39
+0000)
crypto/ec/ec2_mult.c
patch
|
blob
|
history
diff --git
a/crypto/ec/ec2_mult.c
b/crypto/ec/ec2_mult.c
index ff368fd7d7b3d277db18ab1884aa59201d80692a..8e2b2a27cda3b22d36b71da42ffa931806d2071b 100644
(file)
--- a/
crypto/ec/ec2_mult.c
+++ b/
crypto/ec/ec2_mult.c
@@
-76,7
+76,7
@@
* coordinates.
* Uses algorithm Mdouble in appendix of
* Lopez, J. and Dahab, R. "Fast multiplication on elliptic curves over
* coordinates.
* Uses algorithm Mdouble in appendix of
* Lopez, J. and Dahab, R. "Fast multiplication on elliptic curves over
- * GF(2^m) without precomputation".
+ * GF(2^m) without precomputation"
(CHES '99, LNCS 1717)
.
* modified to not require precomputation of c=b^{2^{m-1}}.
*/
static int gf2m_Mdouble(const EC_GROUP *group, BIGNUM *x, BIGNUM *z, BN_CTX *ctx)
* modified to not require precomputation of c=b^{2^{m-1}}.
*/
static int gf2m_Mdouble(const EC_GROUP *group, BIGNUM *x, BIGNUM *z, BN_CTX *ctx)
@@
-107,8
+107,8
@@
static int gf2m_Mdouble(const EC_GROUP *group, BIGNUM *x, BIGNUM *z, BN_CTX *ctx
/* Compute the x-coordinate x1/z1 for the point (x1/z1)+(x2/x2) in Montgomery
* projective coordinates.
* Uses algorithm Madd in appendix of
/* Compute the x-coordinate x1/z1 for the point (x1/z1)+(x2/x2) in Montgomery
* projective coordinates.
* Uses algorithm Madd in appendix of
- * Lope
x
, J. and Dahab, R. "Fast multiplication on elliptic curves over
- * GF(2^m) without precomputation".
+ * Lope
z
, J. and Dahab, R. "Fast multiplication on elliptic curves over
+ * GF(2^m) without precomputation"
(CHES '99, LNCS 1717)
.
*/
static int gf2m_Madd(const EC_GROUP *group, const BIGNUM *x, BIGNUM *x1, BIGNUM *z1,
const BIGNUM *x2, const BIGNUM *z2, BN_CTX *ctx)
*/
static int gf2m_Madd(const EC_GROUP *group, const BIGNUM *x, BIGNUM *x1, BIGNUM *z1,
const BIGNUM *x2, const BIGNUM *z2, BN_CTX *ctx)
@@
-140,8
+140,8
@@
static int gf2m_Madd(const EC_GROUP *group, const BIGNUM *x, BIGNUM *x1, BIGNUM
/* Compute the x, y affine coordinates from the point (x1, z1) (x2, z2)
* using Montgomery point multiplication algorithm Mxy() in appendix of
/* Compute the x, y affine coordinates from the point (x1, z1) (x2, z2)
* using Montgomery point multiplication algorithm Mxy() in appendix of
- * Lope
x
, J. and Dahab, R. "Fast multiplication on elliptic curves over
- * GF(2^m) without precomputation".
+ * Lope
z
, J. and Dahab, R. "Fast multiplication on elliptic curves over
+ * GF(2^m) without precomputation"
(CHES '99, LNCS 1717)
.
* Returns:
* 0 on error
* 1 if return value should be the point at infinity
* Returns:
* 0 on error
* 1 if return value should be the point at infinity
@@
-209,8
+209,8
@@
static int gf2m_Mxy(const EC_GROUP *group, const BIGNUM *x, const BIGNUM *y, BIG
/* Computes scalar*point and stores the result in r.
* point can not equal r.
* Uses algorithm 2P of
/* Computes scalar*point and stores the result in r.
* point can not equal r.
* Uses algorithm 2P of
- * Lope
x
, J. and Dahab, R. "Fast multiplication on elliptic curves over
- * GF(2^m) without precomputation".
+ * Lope
z
, J. and Dahab, R. "Fast multiplication on elliptic curves over
+ * GF(2^m) without precomputation"
(CHES '99, LNCS 1717)
.
*/
static int ec_GF2m_montgomery_point_multiply(const EC_GROUP *group, EC_POINT *r, const BIGNUM *scalar,
const EC_POINT *point, BN_CTX *ctx)
*/
static int ec_GF2m_montgomery_point_multiply(const EC_GROUP *group, EC_POINT *r, const BIGNUM *scalar,
const EC_POINT *point, BN_CTX *ctx)