mirror of https://github.com/starwels/secp256k1
14 changed files with 319 additions and 149 deletions
@ -0,0 +1,54 @@
@@ -0,0 +1,54 @@
|
||||
// Copyright (c) 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_SCALAR_ |
||||
#define _SECP256K1_SCALAR_ |
||||
|
||||
#include "num.h" |
||||
|
||||
/** A scalar modulo the group order of the secp256k1 curve. */ |
||||
typedef struct { |
||||
secp256k1_num_t n; |
||||
} secp256k1_scalar_t; |
||||
|
||||
/** Initialize a scalar. */ |
||||
void static secp256k1_scalar_init(secp256k1_scalar_t *r); |
||||
|
||||
/** Clear a scalar to prevent the leak of sensitive data. */ |
||||
void static secp256k1_scalar_clear(secp256k1_scalar_t *r); |
||||
|
||||
/** Free a scalar. */ |
||||
void static secp256k1_scalar_free(secp256k1_scalar_t *r); |
||||
|
||||
/** Access bits from a scalar. */ |
||||
int static secp256k1_scalar_get_bits(const secp256k1_scalar_t *a, int offset, int count); |
||||
|
||||
/** Set a scalar from a big endian byte array. */ |
||||
void static secp256k1_scalar_set_bin(secp256k1_scalar_t *r, const unsigned char *bin, int len, int *overflow); |
||||
|
||||
/** Convert a scalar to a byte array. */ |
||||
void static secp256k1_scalar_get_bin(unsigned char *bin, int len, const secp256k1_scalar_t* a); |
||||
|
||||
/** Add two scalars together (modulo the group order). */ |
||||
void static secp256k1_scalar_add(secp256k1_scalar_t *r, const secp256k1_scalar_t *a, const secp256k1_scalar_t *b); |
||||
|
||||
/** Multiply two scalars (modulo the group order). */ |
||||
void static secp256k1_scalar_mul(secp256k1_scalar_t *r, const secp256k1_scalar_t *a, const secp256k1_scalar_t *b); |
||||
|
||||
/** Compute the inverse of a scalar (modulo the group order). */ |
||||
void static secp256k1_scalar_inverse(secp256k1_scalar_t *r, const secp256k1_scalar_t *a); |
||||
|
||||
/** Compute the complement of a scalar (modulo the group order). */ |
||||
void static secp256k1_scalar_negate(secp256k1_scalar_t *r, const secp256k1_scalar_t *a); |
||||
|
||||
/** Check whether a scalar equals zero. */ |
||||
int static secp256k1_scalar_is_zero(const secp256k1_scalar_t *a); |
||||
|
||||
/** Check whether a scalar is higher than the group order divided by 2. */ |
||||
int static secp256k1_scalar_is_high(const secp256k1_scalar_t *a); |
||||
|
||||
/** Convert a scalar to a number. */ |
||||
void static secp256k1_scalar_get_num(secp256k1_num_t *r, const secp256k1_scalar_t *a); |
||||
|
||||
#endif |
@ -0,0 +1,73 @@
@@ -0,0 +1,73 @@
|
||||
// Copyright (c) 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_SCALAR_IMPL_H_ |
||||
#define _SECP256K1_SCALAR_IMPL_H_ |
||||
|
||||
#include <string.h> |
||||
|
||||
#include "scalar.h" |
||||
|
||||
#include "group.h" |
||||
|
||||
void static secp256k1_scalar_init(secp256k1_scalar_t *r) { |
||||
secp256k1_num_init(&r->n); |
||||
} |
||||
|
||||
void static secp256k1_scalar_clear(secp256k1_scalar_t *r) { |
||||
secp256k1_num_clear(&r->n); |
||||
} |
||||
|
||||
void static secp256k1_scalar_free(secp256k1_scalar_t *r) { |
||||
secp256k1_num_free(&r->n); |
||||
} |
||||
|
||||
int static secp256k1_scalar_get_bits(const secp256k1_scalar_t *a, int offset, int count) { |
||||
return secp256k1_num_get_bits(&a->n, offset, count); |
||||
} |
||||
|
||||
void static secp256k1_scalar_set_bin(secp256k1_scalar_t *r, const unsigned char *bin, int len, int *overflow) { |
||||
secp256k1_num_set_bin(&r->n, bin, len); |
||||
if (overflow) { |
||||
*overflow = secp256k1_num_cmp(&r->n, &secp256k1_ge_consts->order) >= 0; |
||||
} |
||||
secp256k1_num_mod(&r->n, &secp256k1_ge_consts->order); |
||||
} |
||||
|
||||
void static secp256k1_scalar_get_bin(unsigned char *bin, int len, const secp256k1_scalar_t* a) { |
||||
secp256k1_num_get_bin(bin, len, &a->n); |
||||
} |
||||
|
||||
void static secp256k1_scalar_add(secp256k1_scalar_t *r, const secp256k1_scalar_t *a, const secp256k1_scalar_t *b) { |
||||
secp256k1_num_add(&r->n, &a->n, &b->n); |
||||
secp256k1_num_mod(&r->n, &secp256k1_ge_consts->order); |
||||
} |
||||
|
||||
void static secp256k1_scalar_mul(secp256k1_scalar_t *r, const secp256k1_scalar_t *a, const secp256k1_scalar_t *b) { |
||||
secp256k1_num_mod_mul(&r->n, &a->n, &b->n, &secp256k1_ge_consts->order); |
||||
} |
||||
|
||||
void static secp256k1_scalar_inverse(secp256k1_scalar_t *r, const secp256k1_scalar_t *a) { |
||||
secp256k1_num_mod_inverse(&r->n, &a->n, &secp256k1_ge_consts->order); |
||||
} |
||||
|
||||
void static secp256k1_scalar_negate(secp256k1_scalar_t *r, const secp256k1_scalar_t *a) { |
||||
secp256k1_num_sub(&r->n, &secp256k1_ge_consts->order, &a->n); |
||||
} |
||||
|
||||
int static secp256k1_scalar_is_zero(const secp256k1_scalar_t *a) { |
||||
return secp256k1_num_is_zero(&a->n); |
||||
} |
||||
|
||||
int static secp256k1_scalar_is_high(const secp256k1_scalar_t *a) { |
||||
return secp256k1_num_cmp(&a->n, &secp256k1_ge_consts->half_order) > 0; |
||||
} |
||||
|
||||
void static secp256k1_scalar_get_num(secp256k1_num_t *r, const secp256k1_scalar_t *a) { |
||||
unsigned char c[32]; |
||||
secp256k1_num_get_bin(c, 32, &a->n); |
||||
secp256k1_num_set_bin(r, c, 32); |
||||
} |
||||
|
||||
#endif |
Loading…
Reference in new issue