1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
|
/*
* Simple O(N^2) Multiplication and Squaring
* (C) 1999-2008 Jack Lloyd
*
* Distributed under the terms of the Botan license
*/
#include <botan/mp_asm.h>
#include <botan/mp_asmi.h>
#include <botan/mp_core.h>
#include <botan/mem_ops.h>
namespace Botan {
extern "C" {
/*
* Simple O(N^2) Multiplication
*/
void bigint_simple_mul(word z[], const word x[], u32bit x_size,
const word y[], u32bit y_size)
{
const u32bit x_size_8 = x_size - (x_size % 8);
clear_mem(z, x_size + y_size);
for(u32bit i = 0; i != y_size; ++i)
{
const word y_i = y[i];
word carry = 0;
for(u32bit j = 0; j != x_size_8; j += 8)
carry = word8_madd3(z + i + j, x + j, y_i, carry);
for(u32bit j = x_size_8; j != x_size; ++j)
z[i+j] = word_madd3(x[j], y_i, z[i+j], &carry);
z[x_size+i] = carry;
}
}
/*
* Simple O(N^2) Squaring
This is exactly the same algorithm as bigint_simple_mul,
however because C/C++ compilers suck at alias analysis it
is good to have the version where the compiler knows
that x == y
There is an O(n^1.5) squaring algorithm specified in Handbook of
Applied Cryptography, chapter 14
*/
void bigint_simple_sqr(word z[], const word x[], u32bit x_size)
{
const u32bit x_size_8 = x_size - (x_size % 8);
clear_mem(z, 2*x_size);
for(u32bit i = 0; i != x_size; ++i)
{
const word x_i = x[i];
word carry = 0;
for(u32bit j = 0; j != x_size_8; j += 8)
carry = word8_madd3(z + i + j, x + j, x_i, carry);
for(u32bit j = x_size_8; j != x_size; ++j)
z[i+j] = word_madd3(x[j], x_i, z[i+j], &carry);
z[x_size+i] = carry;
}
}
}
}
|
