1
0
mirror of https://github.com/trezor/trezor-firmware.git synced 2024-12-05 05:58:23 +00:00
trezor-firmware/crypto/ed25519-donna/curve25519-donna-32bit.h

80 lines
2.6 KiB
C
Raw Normal View History

2016-04-22 15:47:48 +00:00
/*
Public domain by Andrew M. <liquidsun@gmail.com>
See: https://github.com/floodyberry/curve25519-donna
32 bit integer curve25519 implementation
*/
typedef uint32_t bignum25519[10];
/* out = in */
void curve25519_copy(bignum25519 out, const bignum25519 in);
2016-04-22 15:47:48 +00:00
/* out = a + b */
void curve25519_add(bignum25519 out, const bignum25519 a, const bignum25519 b);
2016-04-22 15:47:48 +00:00
void curve25519_add_after_basic(bignum25519 out, const bignum25519 a, const bignum25519 b);
2016-04-22 15:47:48 +00:00
void curve25519_add_reduce(bignum25519 out, const bignum25519 a, const bignum25519 b);
2016-04-22 15:47:48 +00:00
/* out = a - b */
void curve25519_sub(bignum25519 out, const bignum25519 a, const bignum25519 b);
2017-05-16 18:19:58 +00:00
/* out = in * scalar */
void curve25519_scalar_product(bignum25519 out, const bignum25519 in, const uint32_t scalar);
2016-04-22 15:47:48 +00:00
/* out = a - b, where a is the result of a basic op (add,sub) */
void curve25519_sub_after_basic(bignum25519 out, const bignum25519 a, const bignum25519 b);
2016-04-22 15:47:48 +00:00
void curve25519_sub_reduce(bignum25519 out, const bignum25519 a, const bignum25519 b);
2016-04-22 15:47:48 +00:00
/* out = -a */
void curve25519_neg(bignum25519 out, const bignum25519 a);
2016-04-22 15:47:48 +00:00
/* out = a * b */
#define curve25519_mul_noinline curve25519_mul
void curve25519_mul(bignum25519 out, const bignum25519 a, const bignum25519 b);
2016-04-22 15:47:48 +00:00
/* out = in * in */
void curve25519_square(bignum25519 out, const bignum25519 in);
2016-04-22 15:47:48 +00:00
/* out = in ^ (2 * count) */
void curve25519_square_times(bignum25519 out, const bignum25519 in, int count);
2016-04-22 15:47:48 +00:00
/* Take a little-endian, 32-byte number and expand it into polynomial form */
void curve25519_expand(bignum25519 out, const unsigned char in[32]);
2016-04-22 15:47:48 +00:00
/* Take a fully reduced polynomial form number and contract it into a
* little-endian, 32-byte array
*/
void curve25519_contract(unsigned char out[32], const bignum25519 in);
2016-04-22 15:47:48 +00:00
/* if (iswap) swap(a, b) */
void curve25519_swap_conditional(bignum25519 a, bignum25519 b, uint32_t iswap);
/* uint32_t to Zmod(2^255-19) */
void curve25519_set(bignum25519 r, uint32_t x);
/* set d */
void curve25519_set_d(bignum25519 r);
/* set 2d */
void curve25519_set_2d(bignum25519 r);
/* set sqrt(-1) */
void curve25519_set_sqrtneg1(bignum25519 r);
/* constant time Zmod(2^255-19) negative test */
int curve25519_isnegative(const bignum25519 f);
/* constant time Zmod(2^255-19) non-zero test */
int curve25519_isnonzero(const bignum25519 f);
/* reduce Zmod(2^255-19) */
void curve25519_reduce(bignum25519 r, const bignum25519 in);
void curve25519_divpowm1(bignum25519 r, const bignum25519 u, const bignum25519 v);
/* Zmod(2^255-19) from byte array to bignum25519 expansion with modular reduction */
void curve25519_expand_reduce(bignum25519 out, const unsigned char in[32]);