summaryrefslogtreecommitdiffstats
path: root/crypto/bn/bn_mont.c
diff options
context:
space:
mode:
authorBodo Möller <bodo@openssl.org>2000-01-27 12:52:41 +0000
committerBodo Möller <bodo@openssl.org>2000-01-27 12:52:41 +0000
commitb99b110766b23729f1f123ba68d02788229dedda (patch)
tree1987f9d55976de142fcba28bc8b5c7f3fb496a0e /crypto/bn/bn_mont.c
parent6e0cad8d34700c82d1c3749cee6a0fa1683dcd5f (diff)
Add a pointer to a paper (is the algorithm in section 4.2 the
word-based algorithm we are using?)
Diffstat (limited to 'crypto/bn/bn_mont.c')
-rw-r--r--crypto/bn/bn_mont.c7
1 files changed, 4 insertions, 3 deletions
diff --git a/crypto/bn/bn_mont.c b/crypto/bn/bn_mont.c
index d3782416d3..5ef08d9157 100644
--- a/crypto/bn/bn_mont.c
+++ b/crypto/bn/bn_mont.c
@@ -57,9 +57,10 @@
*/
/*
- * Details about Montgomery multiplication algorithms can be found at:
- * http://security.ece.orst.edu/publications.html, especially
- * http://security.ece.orst.edu/koc/papers/j37acmon.pdf
+ * Details about Montgomery multiplication algorithms can be found at
+ * http://security.ece.orst.edu/publications.html, e.g.
+ * http://security.ece.orst.edu/koc/papers/j37acmon.pdf and
+ * sections 3.8 and 4.2 in http://security.ece.orst.edu/koc/papers/r01rsasw.pdf
*/
#include <stdio.h>