-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathsmul_init.c
83 lines (73 loc) · 2.81 KB
/
smul_init.c
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
78
79
80
81
82
83
/* Copyright 2008-2019 Douglas Wikstrom
*
* This file is part of Verificatum Elliptic Curve library (VEC).
*
* Permission is hereby granted, free of charge, to any person
* obtaining a copy of this software and associated documentation
* files (the "Software"), to deal in the Software without
* restriction, including without limitation the rights to use, copy,
* modify, merge, publish, distribute, sublicense, and/or sell copies
* of the Software, and to permit persons to whom the Software is
* furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be
* included in all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
* BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
* ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
* CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
* SOFTWARE.
*/
#include <stdio.h>
#include <stdlib.h>
#include <gmp.h>
#include "vec.h"
void
vec_smul_init(vec_smul_tab table,
vec_curve *curve,
size_t len, size_t block_width)
{
size_t i, j; /* Index parameters. */
size_t tab_len; /* Size of a subtable. */
mpz_t *tx; /* Temporary variable for subtable. */
mpz_t *ty; /* Temporary variable for subtable. */
/* Initialize the curve parameters of the table. */
table->curve = curve;
/* Initialize length parameters. */
table->len = len;
table->block_width = block_width;
if (len < block_width) {
table->block_width = len;
}
table->tabs_len = (len + block_width - 1) / block_width;
/* Allocate and initialize space for pointers to tables. */
table->tabsx = (mpz_t **)malloc(table->tabs_len * sizeof(mpz_t *));
table->tabsy = (mpz_t **)malloc(table->tabs_len * sizeof(mpz_t *));
tab_len = 1 << block_width;
for (i = 0; i < table->tabs_len; i++)
{
/* Last block may be more narrow than the other, but it is never
of size zero. */
if (i == table->tabs_len - 1
&& len - (table->tabs_len - 1) * block_width < block_width)
{
block_width = len - (table->tabs_len - 1) * block_width;
tab_len = 1 << block_width;
}
/* Allocate and initialize a table. */
table->tabsx[i] = (mpz_t *)malloc(tab_len * sizeof(mpz_t));
tx = table->tabsx[i];
table->tabsy[i] = (mpz_t *)malloc(tab_len * sizeof(mpz_t));
ty = table->tabsy[i];
/* Initialize mpz_t's. */
for (j = 0; j < tab_len; j++)
{
mpz_init(tx[j]);
mpz_init(ty[j]);
}
}
}