fp-gmp.c File Reference

#include "fp-gmp.h"
#include "../fp-counters.h"
#include "../../primes.h"
#include <gmp.h>

Include dependency graph for fp-gmp.c:

Go to the source code of this file.

Functions
void	fp_enc (fp a, fp const b)
void	fp_dec (fp a, fp const b)
void	fp_pow (fp b, const fp e, const fp a)
void	fp_cswap (fp x, fp y, uint8_t c)
void	fp_copy (fp b, const fp a)
void	fp_add (fp c, const fp a, const fp b)
void	fp_sub (fp c, const fp a, const fp b)
void	fp_mul (fp c, const fp a, const fp b)
void	fp_sqr (fp b, const fp a)
bool	fp_issquare (fp const a)
void	fp_inv (fp x)
void	fp_random (fp x)

Variables
const fp	fp_0 = {0x0}

Function Documentation

fp_add()

void fp_add	(	fp	c,
		const fp	a,
		const fp	b )

Definition at line 864 of file fp-gmp.c.

{
    // (void)mpn_add_n(c, a, b, NUMBER_OF_WORDS);
    // CNT_FP_ADD_INC();
    // reduce_once(c);
    (void)mpn_add_n(c, a, b, NUMBER_OF_WORDS);
    mpn_cnd_sub_n(mpn_cmp(c, p, NUMBER_OF_WORDS) > 0, c, c, p, NUMBER_OF_WORDS);
    CNT_FP_ADD_INC();
}

References a, CNT_FP_ADD_INC, and p.

fp_copy()

void fp_copy	(	fp	b,
		const fp	a )

Definition at line 856 of file fp-gmp.c.

{
    for (uint8_t i = 0; i < NUMBER_OF_WORDS; i++)
    {
        b[i] = a[i];
    }
}

References a, and i.

fp_cswap()

void fp_cswap	(	fp	x,
		fp	y,
		uint8_t	c )

Definition at line 840 of file fp-gmp.c.

{
 
    // uint64_t tmp, c64;
 
    // c64 = (uint64_t)-c;
    // for (int i = 0; i < NUMBER_OF_WORDS; i++)
    // {
    //     tmp = (y[i] ^ x[i]) & c64;
    //     x[i] ^= tmp;
    //     y[i] ^= tmp;
    // }
 
    mpn_cnd_swap(c, x, y, NUMBER_OF_WORDS);
}

fp_dec()

void fp_dec	(	fp	a,
		fp const	b )

Definition at line 800 of file fp-gmp.c.

{
#ifdef MONTGOMERY
    fp_mul(a, b, uintbig_1);
    CNT_FP_MUL_DEC();
#else
    //(void) a;
    //(void) b;
    fp_copy(a, b);
#endif
}

References a, CNT_FP_MUL_DEC, fp_copy, fp_mul, and uintbig_1.

fp_enc()

void fp_enc	(	fp	a,
		fp const	b )

Definition at line 789 of file fp-gmp.c.

{
#ifdef MONTGOMERY
    fp_mul(a, b, r_squared_mod_p);
    CNT_FP_MUL_DEC();
#else
    //(void) a;
    //(void) b;
    fp_copy(a, b);
#endif
}

References a, CNT_FP_MUL_DEC, fp_copy, fp_mul, and r_squared_mod_p.

fp_inv()

void fp_inv

(

fp

x

)

Definition at line 975 of file fp-gmp.c.

{
#if defined(USE_GMP_SEC_FUNCTIONS) || defined(MONTGOMERY)
    static __thread uint64_t tp[itch_size];
#endif
#ifdef MONTGOMERY
    fp_dec(x, x);
    fp tmp;
    fp_copy(tmp, x);
    mpn_sec_invert(x, tmp, p, NUMBER_OF_WORDS, (unsigned int)(2 * NUMBER_OF_WORDS * mp_bits_per_limb), tp);
    fp_enc(x, x);
#else
#ifndef USE_GMP_SEC_FUNCTIONS
    mpz_t res, mpzx, mpzp;
    mpz_init(res);
    mpz_roinit_n(mpzx, x, NUMBER_OF_WORDS);
    mpz_roinit_n(mpzp, p, NUMBER_OF_WORDS);
    mpz_invert(res, mpzx, mpzp);
    int i = 0;
    for (; i < res->_mp_size; ++i)
    {
        x[i] = ((uint64_t *)res->_mp_d)[i];
    }
    for (; i < NUMBER_OF_WORDS; ++i)
    {
        x[i] = 0;
    }
    mpz_clear(res);
#else
    fp tmp;
    fp_copy(tmp, x);
    mpn_sec_invert(x, tmp, p, NUMBER_OF_WORDS, (unsigned int)(2 * NUMBER_OF_WORDS * mp_bits_per_limb), tp);
#endif
#endif
}

References fp_copy, fp_dec, fp_enc, i, itch_size, and p.

fp_issquare()

bool fp_issquare

(

fp const

a

)

Definition at line 968 of file fp-gmp.c.

{
    mpz_t mpzx, mpzp;
    int s = mpz_legendre(mpz_roinit_n(mpzx, a, NUMBER_OF_WORDS), mpz_roinit_n(mpzp, p, NUMBER_OF_WORDS));
    return s + 1;
}

References a, and p.

fp_mul()

void fp_mul	(	fp	c,
		const fp	a,
		const fp	b )

Definition at line 891 of file fp-gmp.c.

{
#ifdef MONTGOMERY
    static __thread uint64_t tp[itch_size];
 
    // mp_size_t size = mpn_sec_mul_itch(NUMBER_OF_WORDS, 1) ;
    uint64_t A[NUMBER_OF_WORDS + 1] = {0x0};
    uint64_t tmp_1[NUMBER_OF_WORDS + 1] = {0x0};
    uint64_t tmp_2[NUMBER_OF_WORDS + 2] = {0x0};
    uint64_t a_i[1] = {0x0};
    for (int i = 0; i < NUMBER_OF_WORDS; i++)
    {
        // tmp_1 = x_i * y
        a_i[0] = a[i];
        mpn_sec_mul(tmp_1, b, NUMBER_OF_WORDS, a_i, 1, tp);
 
        // tmp_2 = A + x_i * y
        mpn_add(tmp_2, A, NUMBER_OF_WORDS + 1, tmp_1, NUMBER_OF_WORDS + 1);
 
        // tmp_1 = u_i * m
        mpn_sec_mul(tmp_1, p, NUMBER_OF_WORDS, tmp_2, 1, tp);
 
        // tmp_1 = A + x_i * y + u_i * m
        mpn_add(tmp_1, tmp_1, NUMBER_OF_WORDS + 1, tmp_2, NUMBER_OF_WORDS + 2);
 
        // A = (A + x_i * y + u_i * m) / r
        mpn_copyd(A, tmp_1 + 1, NUMBER_OF_WORDS);
 
        A[NUMBER_OF_WORDS] = 0;
    }
 
    mpn_cnd_sub_n(mpn_cmp(A, p, NUMBER_OF_WORDS) > 0, c, A, p, NUMBER_OF_WORDS);
 
#else
#ifndef USE_GMP_SEC_FUNCTIONS
    uint64_t tmp[NUMBER_OF_WORDS * 2];
    uint64_t thrash[NUMBER_OF_WORDS + 1];
    mpn_mul_n(tmp, a, b, NUMBER_OF_WORDS);
    mpn_tdiv_qr(thrash, c, 0, tmp, 2 * NUMBER_OF_WORDS, p, NUMBER_OF_WORDS);
#else
    static __thread uint64_t tp[itch_size];
    uint64_t tmp[NUMBER_OF_WORDS * 2];
    mpn_sec_mul(tmp, a, NUMBER_OF_WORDS, b, NUMBER_OF_WORDS, tp);
    mpn_sec_div_r(tmp, 2 * NUMBER_OF_WORDS, p, NUMBER_OF_WORDS, tp);
    fp_copy(c, tmp);
#endif
#endif
 
    CNT_FP_MUL_INC();
}

References a, CNT_FP_MUL_INC, fp_copy, i, itch_size, and p.

fp_pow()

void fp_pow	(	fp	b,
		const fp	e,
		const fp	a )

Definition at line 812 of file fp-gmp.c.

{
    // It is required that e > 0.
    if (fp_iszero(e))
    {
        fp_set1(b);
    }
    else
    {
        fp tmp;
        fp_copy(tmp, a);
        fp_dec(tmp, tmp);
        mp_size_t pow_size = mpn_sec_powm_itch(NUMBER_OF_WORDS, NUMBER_OF_WORDS, NUMBER_OF_WORDS);
        uint64_t tp_pow[pow_size];
        mpn_sec_powm(b, tmp, NUMBER_OF_WORDS, e, NUMBER_OF_WORDS, p, NUMBER_OF_WORDS, tp_pow);
        fp_enc(b, b);
    }
}

References a, fp_copy, fp_dec, fp_enc, and p.

fp_random()

void fp_random

(

fp

x

)

Definition at line 1047 of file fp-gmp.c.

{
    while (1)
    {
        randombytes(x, sizeof(fp));
        uint64_t m = ((uint64_t)1 << pbits % 64) - 1;
        x[NUMBER_OF_WORDS - 1] &= m;
 
        for (size_t i = NUMBER_OF_WORDS - 1; i < NUMBER_OF_WORDS; --i)
            if (x[i] < p[i])
                return;
            else if (x[i] > p[i])
                break;
    }
}

References i, p, pbits, and randombytes().

Here is the call graph for this function:

fp_sqr()

void fp_sqr	(	fp	b,
		const fp	a )

Definition at line 942 of file fp-gmp.c.

{
#ifdef MONTGOMERY
    // fp_mul(b, a, a);
    // CNT_FP_MUL_DEC();
 
    uint64_t tmp[NUMBER_OF_WORDS * 2];
    mpn_sqr(tmp, a, NUMBER_OF_WORDS);
    fp_mont_redc(b, tmp);
 
#else
#ifndef USE_GMP_SEC_FUNCTIONS
    uint64_t tmp[NUMBER_OF_WORDS * 2];
    uint64_t thrash[NUMBER_OF_WORDS + 1];
    mpn_sqr(tmp, a, NUMBER_OF_WORDS);
    mpn_tdiv_qr(thrash, b, 0, tmp, 2 * NUMBER_OF_WORDS, p, NUMBER_OF_WORDS);
#else
    fp_mul(b, a, a);
    CNT_FP_MUL_DEC();
//     mpn_sec_sqr(tmp, a, NUMBER_OF_WORDS, tp);
//     mpn_sec_div_r(tmp, 2 * NUMBER_OF_WORDS, p, NUMBER_OF_WORDS, tp);
#endif
#endif
    CNT_FP_SQR_INC();
}

References a, CNT_FP_MUL_DEC, CNT_FP_SQR_INC, fp_mont_redc(), fp_mul, and p.

Here is the call graph for this function:

fp_sub()

void fp_sub	(	fp	c,
		const fp	a,
		const fp	b )

Definition at line 874 of file fp-gmp.c.

{
    // mp_limb_t borrow = mpn_sub_n(c, a, b, NUMBER_OF_WORDS);
    // CNT_FP_ADD_INC();
    // if (borrow)
    // {
    //     mpn_add_n(c, c, p, NUMBER_OF_WORDS);
    // }
 
    mpn_cnd_add_n(mpn_sub_n(c, a, b, NUMBER_OF_WORDS), c, c, p, NUMBER_OF_WORDS);
    CNT_FP_ADD_INC();
}

References a, CNT_FP_ADD_INC, and p.

Variable Documentation

fp_0

const fp fp_0 = {0x0}

Definition at line 787 of file fp-gmp.c.

{0x0};