aboutsummaryrefslogtreecommitdiffstats
path: root/doc/todo.txt
diff options
context:
space:
mode:
authorlloyd <[email protected]>2008-09-16 16:34:44 +0000
committerlloyd <[email protected]>2008-09-16 16:34:44 +0000
commit88de7e5ec1316ae6619e9911a534b3cb93d2dddc (patch)
tree169eefbcd5d9a24f6da8964ffef915c96ca4ba84 /doc/todo.txt
parente64b0f4f0b4a1fbdd6ed62c997cd57c74d419c97 (diff)
Function was renamed, bigint_simple_sqr is now hotspot
Diffstat (limited to 'doc/todo.txt')
-rw-r--r--doc/todo.txt4
1 files changed, 2 insertions, 2 deletions
diff --git a/doc/todo.txt b/doc/todo.txt
index b861ed20c..f17a40e1f 100644
--- a/doc/todo.txt
+++ b/doc/todo.txt
@@ -138,8 +138,8 @@ architectures (such as Cell's SPU units, PowerPC, SPARCv9, MIPS, and
ARM) could really help, as could further work on the x86 code
(including making use of SSE instructions and VIA's Montgomery
multiplication instruction). The key routines for good performance are
-bigint_monty_redc and bigint_mul_add_words; together they make up
-30-60% of the runtime of most public key algorithms.
+bigint_monty_redc and bigint_simple_sqr; together they make up 30-60%
+of the runtime of most public key algorithms.
It is very likely that many of the core algorithms (in src/mp_*) could
be optimized at the C level by anyone has some knowledge or interest