| Commit message (Collapse) | Author | Age | Files | Lines |
|---|
| |
|
|
|
|
| |
the actual copyright holders. For rationale, see my post to botan-devel
on April 9, subject 'Changing license to directly reflect contributors'
(http://www.randombit.net/pipermail/botan-devel/2008-April/000527.html)
|
| |
|
|
|
|
|
| |
with the last one being both one of the input values and the output carry
register, since almost always they were in fact the same variable.
Also update the x86 and x86-64 modules.
|
| |
|
|
|
|
|
| |
but might as well keep it up to date. And it's easier to do it once with
a 'perl -pi' command than to update each file over time.
Apologies to anyone looking at diffs.
|
| | |
|
| |
|
|
|
|
| |
was used.
Make a variant of bigint_simple_mul, bigint_simple_sqr, for mp_sqr.cpp
|
| |
|
|
|
|
|
|
|
|
| |
Move the inner-most loop of Montgomery into bigint_mul_add_words, in
mp_muladd.cpp
Use bigint_mul_add_words for the inner loop of bigint_simple_multiply
Move the compare/subtract at the end of the Montomgery algorithm into
bigint_monty_redc
|
| |
|
|
|
| |
single function is using 30+% of the runtime during RSA operations,
making it a strong candidate for implementation in assembly.
|
| |
|
|
|
|
| |
as C (for replacing by asm later), and another that performs a subtract
if needed (inside powm_mnt.cpp). That way an asm version of the Montgomery
algorithm won't have to deal with calling other functions.
|
| |
|
|
|
|
| |
assembly code in order to handle the argument aliasing correctly, and it
seems I don't understand GCC's extended asm syntax well enough to figure
out how to get it work in a way that isn't hideous.
|
| | |
|
| |
|
