1897b8e Merge pull request #229 efc571c Add simple testcases for signing with rfc6979 extra entropy. 1573a10 Add ability to pass extra entropy to rfc6979 3087bc4 Merge pull request #228 d9b9f11 Merge pull request #218 0065a8f Eliminate multiple-returns from secp256k1.c. 354ffa3 Make secp256k1_ec_pubkey_create reject oversized secrets. 27bc131 Silence some warnings from pedantic static analysis tools, improve compatibility with C++. 3b7ea63 Merge pull request #221 f789c5b Merge pull request #215 4bc273b Merge pull request #222 137a8ec Merge pull request #216 7c3771d Disable overlength-strings warnings. 8956111 use 128-bit hex seed 02efd06 Use RFC6979 for test PRNGs ae55e85 Use faster byteswapping and avoid alignment-increasing casts. 443cd4b Get rid of hex format and some binary conversions 0bada0e Merge #214: Improve signing API documentation & specification 8030d7c Improve signing API documentation & specification 7b2fc1c Merge #213: Removed gotos, which are hard to trace and maintain. 11690d3 Removed gotos, which are hard to trace and maintain. 122a1ec Merge pull request #205 035406d Merge pull request #206 2d4cd53 Merge pull request #161 34b898d Additional comments for the testing PRNG and a seeding fix. 6efd6e7 Some comments explaining some of the constants in the code. ffccfd2 x86_64 assembly optimization for scalar_4x64 67cbdf0 Merge pull request #207 039723d Benchmarks for all internal operations 6cc8425 Include a comment on secp256k1_ecdsa_sign explaining low-s. f88343f Merge pull request #203 d61e899 Add group operation counts 2473f17 Merge pull request #202 b5bbce6 Some readme updates, e.g. removal of the GMP field. f0d851e Merge pull request #201 a0ea884 Merge pull request #200 f735446 Convert the rest of the codebase to C89. bf2e1ac Convert tests to C89. (also fixes a use of bare "inline" in field) fc8285f Merge pull request #199 fff412e Merge pull request #197 4be8d6f Centralize the definition of uint128_t and use it uniformly. d9543c9 Switch scalar code to C89. fcc48c4 Remove the non-storage cmov 55422b6 Switch ecmult_gen to use storage types 41f8455 Use group element storage type in EC multiplications e68d720 Add group element storage type ff889f7 Field storage type 7137be8 Merge pull request #196 0768bd5 Get rid of variable-length hex string conversions e84e761 Merge pull request #195 792bcdb Covert several more files to C89. 45cdf44 Merge pull request #193 17db09e Merge pull request #194 402878a fix ifdef/ifndef 25b35c7 Convert field code to strict C89 (+ long long, +__int128) 3627437 C89 nits and dead code removal. a9f350d Merge pull request #191 4732d26 Convert the field/group/ecdsa constant initialization to static consts 19f3e76 Remove unused secp256k1_fe_inner_{start, stop} functions f1ebfe3 Convert the scalar constant initialization to static consts git-subtree-dir: src/secp256k1 git-subtree-split: 1897b8e90bbbdcd919427c9a8ae35b420e919d8f
127 lines
4.8 KiB
C
127 lines
4.8 KiB
C
/**********************************************************************
|
|
* Copyright (c) 2013, 2014 Pieter Wuille *
|
|
* Distributed under the MIT software license, see the accompanying *
|
|
* file COPYING or http://www.opensource.org/licenses/mit-license.php.*
|
|
**********************************************************************/
|
|
|
|
#ifndef _SECP256K1_ECMULT_GEN_IMPL_H_
|
|
#define _SECP256K1_ECMULT_GEN_IMPL_H_
|
|
|
|
#include "scalar.h"
|
|
#include "group.h"
|
|
#include "ecmult_gen.h"
|
|
|
|
typedef struct {
|
|
/* For accelerating the computation of a*G:
|
|
* To harden against timing attacks, use the following mechanism:
|
|
* * Break up the multiplicand into groups of 4 bits, called n_0, n_1, n_2, ..., n_63.
|
|
* * Compute sum(n_i * 16^i * G + U_i, i=0..63), where:
|
|
* * U_i = U * 2^i (for i=0..62)
|
|
* * U_i = U * (1-2^63) (for i=63)
|
|
* where U is a point with no known corresponding scalar. Note that sum(U_i, i=0..63) = 0.
|
|
* For each i, and each of the 16 possible values of n_i, (n_i * 16^i * G + U_i) is
|
|
* precomputed (call it prec(i, n_i)). The formula now becomes sum(prec(i, n_i), i=0..63).
|
|
* None of the resulting prec group elements have a known scalar, and neither do any of
|
|
* the intermediate sums while computing a*G.
|
|
*/
|
|
secp256k1_ge_storage_t prec[64][16]; /* prec[j][i] = 16^j * i * G + U_i */
|
|
} secp256k1_ecmult_gen_consts_t;
|
|
|
|
static const secp256k1_ecmult_gen_consts_t *secp256k1_ecmult_gen_consts = NULL;
|
|
|
|
static void secp256k1_ecmult_gen_start(void) {
|
|
secp256k1_ge_t prec[1024];
|
|
secp256k1_gej_t gj;
|
|
secp256k1_gej_t nums_gej;
|
|
secp256k1_ecmult_gen_consts_t *ret;
|
|
int i, j;
|
|
if (secp256k1_ecmult_gen_consts != NULL)
|
|
return;
|
|
|
|
/* Allocate the precomputation table. */
|
|
ret = (secp256k1_ecmult_gen_consts_t*)checked_malloc(sizeof(secp256k1_ecmult_gen_consts_t));
|
|
|
|
/* get the generator */
|
|
secp256k1_gej_set_ge(&gj, &secp256k1_ge_const_g);
|
|
|
|
/* Construct a group element with no known corresponding scalar (nothing up my sleeve). */
|
|
{
|
|
static const unsigned char nums_b32[33] = "The scalar for this x is unknown";
|
|
secp256k1_fe_t nums_x;
|
|
secp256k1_ge_t nums_ge;
|
|
VERIFY_CHECK(secp256k1_fe_set_b32(&nums_x, nums_b32));
|
|
VERIFY_CHECK(secp256k1_ge_set_xo_var(&nums_ge, &nums_x, 0));
|
|
secp256k1_gej_set_ge(&nums_gej, &nums_ge);
|
|
/* Add G to make the bits in x uniformly distributed. */
|
|
secp256k1_gej_add_ge_var(&nums_gej, &nums_gej, &secp256k1_ge_const_g);
|
|
}
|
|
|
|
/* compute prec. */
|
|
{
|
|
secp256k1_gej_t precj[1024]; /* Jacobian versions of prec. */
|
|
secp256k1_gej_t gbase;
|
|
secp256k1_gej_t numsbase;
|
|
gbase = gj; /* 16^j * G */
|
|
numsbase = nums_gej; /* 2^j * nums. */
|
|
for (j = 0; j < 64; j++) {
|
|
/* Set precj[j*16 .. j*16+15] to (numsbase, numsbase + gbase, ..., numsbase + 15*gbase). */
|
|
precj[j*16] = numsbase;
|
|
for (i = 1; i < 16; i++) {
|
|
secp256k1_gej_add_var(&precj[j*16 + i], &precj[j*16 + i - 1], &gbase);
|
|
}
|
|
/* Multiply gbase by 16. */
|
|
for (i = 0; i < 4; i++) {
|
|
secp256k1_gej_double_var(&gbase, &gbase);
|
|
}
|
|
/* Multiply numbase by 2. */
|
|
secp256k1_gej_double_var(&numsbase, &numsbase);
|
|
if (j == 62) {
|
|
/* In the last iteration, numsbase is (1 - 2^j) * nums instead. */
|
|
secp256k1_gej_neg(&numsbase, &numsbase);
|
|
secp256k1_gej_add_var(&numsbase, &numsbase, &nums_gej);
|
|
}
|
|
}
|
|
secp256k1_ge_set_all_gej_var(1024, prec, precj);
|
|
}
|
|
for (j = 0; j < 64; j++) {
|
|
for (i = 0; i < 16; i++) {
|
|
secp256k1_ge_to_storage(&ret->prec[j][i], &prec[j*16 + i]);
|
|
}
|
|
}
|
|
|
|
/* Set the global pointer to the precomputation table. */
|
|
secp256k1_ecmult_gen_consts = ret;
|
|
}
|
|
|
|
static void secp256k1_ecmult_gen_stop(void) {
|
|
secp256k1_ecmult_gen_consts_t *c;
|
|
if (secp256k1_ecmult_gen_consts == NULL)
|
|
return;
|
|
|
|
c = (secp256k1_ecmult_gen_consts_t*)secp256k1_ecmult_gen_consts;
|
|
secp256k1_ecmult_gen_consts = NULL;
|
|
free(c);
|
|
}
|
|
|
|
static void secp256k1_ecmult_gen(secp256k1_gej_t *r, const secp256k1_scalar_t *gn) {
|
|
const secp256k1_ecmult_gen_consts_t *c = secp256k1_ecmult_gen_consts;
|
|
secp256k1_ge_t add;
|
|
secp256k1_ge_storage_t adds;
|
|
int bits;
|
|
int i, j;
|
|
secp256k1_gej_set_infinity(r);
|
|
add.infinity = 0;
|
|
for (j = 0; j < 64; j++) {
|
|
bits = secp256k1_scalar_get_bits(gn, j * 4, 4);
|
|
for (i = 0; i < 16; i++) {
|
|
secp256k1_ge_storage_cmov(&adds, &c->prec[j][i], i == bits);
|
|
}
|
|
secp256k1_ge_from_storage(&add, &adds);
|
|
secp256k1_gej_add_ge(r, r, &add);
|
|
}
|
|
bits = 0;
|
|
secp256k1_ge_clear(&add);
|
|
}
|
|
|
|
#endif
|