mirror of
https://github.com/data61/MP-SPDZ.git
synced 2026-04-20 03:01:31 -04:00
37 lines
911 B
C++
37 lines
911 B
C++
/*
|
|
* Square.cpp
|
|
*
|
|
*/
|
|
|
|
#include "Square.h"
|
|
|
|
template<>
|
|
void Square<gf2n_short>::to(gf2n_short& result)
|
|
{
|
|
int128 sum;
|
|
for (int i = 0; i < gf2n_short::degree(); i++)
|
|
sum ^= int128(rows[i].get()) << i;
|
|
result = sum;
|
|
}
|
|
|
|
template <>
|
|
void Square<gfp1>::to(gfp1& result)
|
|
{
|
|
const int L = gfp1::N_LIMBS;
|
|
mp_limb_t product[2 * L], sum[2 * L], tmp[L][2 * L];
|
|
memset(tmp, 0, sizeof(tmp));
|
|
memset(sum, 0, sizeof(sum));
|
|
for (int i = 0; i < gfp1::length(); i++)
|
|
{
|
|
memcpy(&(tmp[i/64][i/64]), &(rows[i]), sizeof(rows[i]));
|
|
if (i % 64 == 0)
|
|
memcpy(product, tmp[i/64], sizeof(product));
|
|
else
|
|
mpn_lshift(product, tmp[i/64], 2 * L, i % 64);
|
|
mpn_add_fixed_n<2 * L>(sum, product, sum);
|
|
}
|
|
mp_limb_t q[2 * L], ans[2 * L];
|
|
mpn_tdiv_qr(q, ans, 0, sum, 2 * L, gfp1::get_ZpD().get_prA(), L);
|
|
result.assign((void*) ans);
|
|
}
|