github.com/aquanetwork/aquachain@v1.7.8/crypto/secp256k1/libsecp256k1/src/ecmult.h (about)

     1  /**********************************************************************
     2   * Copyright (c) 2013, 2014, 2017 Pieter Wuille, Andrew Poelstra      *
     3   * Distributed under the MIT software license, see the accompanying   *
     4   * file COPYING or http://www.opensource.org/licenses/mit-license.php.*
     5   **********************************************************************/
     6  
     7  #ifndef SECP256K1_ECMULT_H
     8  #define SECP256K1_ECMULT_H
     9  
    10  #include "num.h"
    11  #include "group.h"
    12  #include "scalar.h"
    13  #include "scratch.h"
    14  
    15  typedef struct {
    16      /* For accelerating the computation of a*P + b*G: */
    17      secp256k1_ge_storage (*pre_g)[];    /* odd multiples of the generator */
    18  #ifdef USE_ENDOMORPHISM
    19      secp256k1_ge_storage (*pre_g_128)[]; /* odd multiples of 2^128*generator */
    20  #endif
    21  } secp256k1_ecmult_context;
    22  
    23  static void secp256k1_ecmult_context_init(secp256k1_ecmult_context *ctx);
    24  static void secp256k1_ecmult_context_build(secp256k1_ecmult_context *ctx, const secp256k1_callback *cb);
    25  static void secp256k1_ecmult_context_clone(secp256k1_ecmult_context *dst,
    26                                             const secp256k1_ecmult_context *src, const secp256k1_callback *cb);
    27  static void secp256k1_ecmult_context_clear(secp256k1_ecmult_context *ctx);
    28  static int secp256k1_ecmult_context_is_built(const secp256k1_ecmult_context *ctx);
    29  
    30  /** Double multiply: R = na*A + ng*G */
    31  static void secp256k1_ecmult(const secp256k1_ecmult_context *ctx, secp256k1_gej *r, const secp256k1_gej *a, const secp256k1_scalar *na, const secp256k1_scalar *ng);
    32  
    33  typedef int (secp256k1_ecmult_multi_callback)(secp256k1_scalar *sc, secp256k1_ge *pt, size_t idx, void *data);
    34  
    35  /**
    36   * Multi-multiply: R = inp_g_sc * G + sum_i ni * Ai.
    37   * Chooses the right algorithm for a given number of points and scratch space
    38   * size. Resets and overwrites the given scratch space. If the points do not
    39   * fit in the scratch space the algorithm is repeatedly run with batches of
    40   * points.
    41   * Returns: 1 on success (including when inp_g_sc is NULL and n is 0)
    42   *          0 if there is not enough scratch space for a single point or
    43   *          callback returns 0
    44   */
    45  static int secp256k1_ecmult_multi_var(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);
    46  
    47  #endif /* SECP256K1_ECMULT_H */