ecmult_const_impl.h File Reference

#include "scalar.h"
#include "group.h"
#include "ecmult_const.h"
#include "ecmult_impl.h"

Go to the source code of this file.

Macros
#define	ECMULT_CONST_TABLE_GET_GE(r, pre, n, w)

Functions
static int	secp256k1_wnaf_const (int *wnaf, secp256k1_scalar s, int w, int size)
static void	secp256k1_ecmult_const (secp256k1_gej *r, const secp256k1_ge *a, const secp256k1_scalar *scalar, int size)

Macro Definition Documentation

ECMULT_CONST_TABLE_GET_GE

#define ECMULT_CONST_TABLE_GET_GE	(		r,
			pre,
			n,
			w
	)

Value:

do { \
    int m; \
    int abs_n = (n) * (((n) > 0) * 2 - 1); \
    int idx_n = abs_n / 2; \
    secp256k1_fe neg_y; \
    VERIFY_CHECK(((n) & 1) == 1); \
    VERIFY_CHECK((n) >= -((1 << ((w)-1)) - 1)); \
    VERIFY_CHECK((n) <=  ((1 << ((w)-1)) - 1)); \
    VERIFY_SETUP(secp256k1_fe_clear(&(r)->x)); \
    VERIFY_SETUP(secp256k1_fe_clear(&(r)->y)); \
    for (m = 0; m < ECMULT_TABLE_SIZE(w); m++) { \
        /* This loop is used to avoid secret data in array indices. See
         * the comment in ecmult_gen_impl.h for rationale. */ \
        secp256k1_fe_cmov(&(r)->x, &(pre)[m].x, m == idx_n); \
        secp256k1_fe_cmov(&(r)->y, &(pre)[m].y, m == idx_n); \
    } \
    (r)->infinity = 0; \
    secp256k1_fe_negate(&neg_y, &(r)->y, 1); \
    secp256k1_fe_cmov(&(r)->y, &neg_y, (n) != abs_n); \
} while(0)

Function Documentation

secp256k1_ecmult_const()

static void secp256k1_ecmult_const ( secp256k1_gej *  r, const secp256k1_ge *  a, const secp256k1_scalar *  scalar, int  size  )

static

secp256k1_wnaf_const()

static int secp256k1_wnaf_const ( int *  wnaf, secp256k1_scalar  s, int  w, int  size  )

static

Convert a number to WNAF notation. The number becomes represented by sum(2^{wi} * wnaf[i], i=0..WNAF_SIZE(w)+1) - return_val. It has the following guarantees:

• each wnaf[i] an odd integer between -(1 << w) and (1 << w)
• each wnaf[i] is nonzero
• the number of words set is always WNAF_SIZE(w) + 1

Adapted from The Width-w NAF Method Provides Small Memory and Fast Elliptic Scalar Multiplications Secure against Side Channel Attacks, Okeya and Tagaki. M. Joye (Ed.) CT-RSA 2003, LNCS 2612, pp. 328-443, 2003. Springer-Verlagy Berlin Heidelberg 2003

Numbers reference steps of Algorithm SPA-resistant Width-w NAF with Odd Scalar on pp. 335