-
Notifications
You must be signed in to change notification settings - Fork 0
/
smul.c
70 lines (62 loc) · 2.33 KB
/
smul.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
/* 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 <gmp.h>
#include "vec.h"
void
vec_smul(mpz_t ropx, mpz_t ropy,
vec_curve *curve,
mpz_t *basesx, mpz_t *basesy,
mpz_t *scalars,
size_t len)
{
size_t i;
size_t bitlen;
size_t max_scalar_bitlen;
size_t batch_len = 100; /* This is somewhat arbitrary, but it
makes the amortized cost for squaring
very small in comparison to the cost
for multiplications. */
size_t block_width;
/* Compute the maximal bit length among the scalars. */
max_scalar_bitlen = 0;
for (i = 0; i < len; i++)
{
bitlen = mpz_sizeinbase(scalars[i], 2);
if (bitlen > max_scalar_bitlen)
{
max_scalar_bitlen = bitlen;
}
}
/* Determine a good block width. */
block_width = vec_smul_block_width(max_scalar_bitlen, batch_len);
vec_smul_block_batch(ropx, ropy,
curve,
basesx, basesy,
scalars,
len,
block_width, batch_len,
max_scalar_bitlen);
}