16a3cc07e8
This header contains a static array that replaces the ecmult_context pre_g and pre_g_128 tables. The gen_ecmult_static_pre_g program generates this header file.
63 lines
3.1 KiB
C
63 lines
3.1 KiB
C
/***********************************************************************
|
|
* Copyright (c) 2013, 2014, 2017 Pieter Wuille, Andrew Poelstra *
|
|
* Distributed under the MIT software license, see the accompanying *
|
|
* file COPYING or https://www.opensource.org/licenses/mit-license.php.*
|
|
***********************************************************************/
|
|
|
|
#ifndef SECP256K1_ECMULT_H
|
|
#define SECP256K1_ECMULT_H
|
|
|
|
#include "group.h"
|
|
#include "scalar.h"
|
|
#include "scratch.h"
|
|
|
|
/* Noone will ever need more than a window size of 24. The code might
|
|
* be correct for larger values of ECMULT_WINDOW_SIZE but this is not
|
|
* not tested.
|
|
*
|
|
* The following limitations are known, and there are probably more:
|
|
* If WINDOW_G > 27 and size_t has 32 bits, then the code is incorrect
|
|
* because the size of the memory object that we allocate (in bytes)
|
|
* will not fit in a size_t.
|
|
* If WINDOW_G > 31 and int has 32 bits, then the code is incorrect
|
|
* because certain expressions will overflow.
|
|
*/
|
|
#if ECMULT_WINDOW_SIZE < 2 || ECMULT_WINDOW_SIZE > 24
|
|
# error Set ECMULT_WINDOW_SIZE to an integer in range [2..24].
|
|
#endif
|
|
|
|
/** The number of entries a table with precomputed multiples needs to have. */
|
|
#define ECMULT_TABLE_SIZE(w) (1L << ((w)-2))
|
|
|
|
typedef struct {
|
|
/* For accelerating the computation of a*P + b*G: */
|
|
secp256k1_ge_storage (*pre_g)[]; /* odd multiples of the generator */
|
|
secp256k1_ge_storage (*pre_g_128)[]; /* odd multiples of 2^128*generator */
|
|
} secp256k1_ecmult_context;
|
|
|
|
static void secp256k1_ecmult_context_init(secp256k1_ecmult_context *ctx);
|
|
static void secp256k1_ecmult_context_build(secp256k1_ecmult_context *ctx, void **prealloc);
|
|
static void secp256k1_ecmult_context_finalize_memcpy(secp256k1_ecmult_context *dst, const secp256k1_ecmult_context *src);
|
|
static void secp256k1_ecmult_context_clear(secp256k1_ecmult_context *ctx);
|
|
static int secp256k1_ecmult_context_is_built(const secp256k1_ecmult_context *ctx);
|
|
|
|
/** Double multiply: R = na*A + ng*G */
|
|
static void secp256k1_ecmult(const secp256k1_ecmult_context *ctx, secp256k1_gej *r, const secp256k1_gej *a, const secp256k1_scalar *na, const secp256k1_scalar *ng);
|
|
|
|
typedef int (secp256k1_ecmult_multi_callback)(secp256k1_scalar *sc, secp256k1_ge *pt, size_t idx, void *data);
|
|
|
|
/**
|
|
* Multi-multiply: R = inp_g_sc * G + sum_i ni * Ai.
|
|
* Chooses the right algorithm for a given number of points and scratch space
|
|
* size. Resets and overwrites the given scratch space. If the points do not
|
|
* fit in the scratch space the algorithm is repeatedly run with batches of
|
|
* points. If no scratch space is given then a simple algorithm is used that
|
|
* simply multiplies the points with the corresponding scalars and adds them up.
|
|
* Returns: 1 on success (including when inp_g_sc is NULL and n is 0)
|
|
* 0 if there is not enough scratch space for a single point or
|
|
* callback returns 0
|
|
*/
|
|
static int secp256k1_ecmult_multi_var(const secp256k1_callback* error_callback, const secp256k1_ecmult_context *ctx, secp256k1_scratch *scratch, secp256k1_gej *r, const secp256k1_scalar *inp_g_sc, secp256k1_ecmult_multi_callback cb, void *cbdata, size_t n);
|
|
|
|
#endif /* SECP256K1_ECMULT_H */
|