mirror of
https://github.com/data61/MP-SPDZ.git
synced 2026-04-20 03:01:31 -04:00
82 lines
1.6 KiB
C++
82 lines
1.6 KiB
C++
|
|
#include "Share.h"
|
|
//#include "Tools/random.h"
|
|
#include "Math/gfp.h"
|
|
#include "Math/gf2n.h"
|
|
#include "Math/operators.h"
|
|
#include "Math/FixedVec.h"
|
|
#include "Math/Integer.h"
|
|
|
|
|
|
template<class T>
|
|
void Share<T>::mul_by_bit(const Share<T>& S,const T& aa)
|
|
{
|
|
a.mul(S.a,aa);
|
|
mac.mul(S.mac,aa);
|
|
}
|
|
|
|
template<>
|
|
void Share<gf2n>::mul_by_bit(const Share<gf2n>& S, const gf2n& aa)
|
|
{
|
|
a.mul_by_bit(S.a,aa);
|
|
mac.mul_by_bit(S.mac,aa);
|
|
}
|
|
|
|
|
|
|
|
|
|
template<class T>
|
|
T combine(const vector< Share<T> >& S)
|
|
{
|
|
T ans=S[0].a;
|
|
for (unsigned int i=1; i<S.size(); i++)
|
|
{ ans.add(ans,S[i].a); }
|
|
return ans;
|
|
}
|
|
|
|
|
|
|
|
|
|
template<class T>
|
|
inline void Share<T>::pack(octetStream& os, bool full) const
|
|
{
|
|
a.pack(os);
|
|
if (full)
|
|
mac.pack(os);
|
|
}
|
|
|
|
template<class T>
|
|
inline void Share<T>::unpack(octetStream& os, bool full)
|
|
{
|
|
a.unpack(os);
|
|
if (full)
|
|
mac.unpack(os);
|
|
}
|
|
|
|
|
|
template<class T>
|
|
bool check_macs(const vector< Share<T> >& S,const T& key)
|
|
{
|
|
T val=combine(S);
|
|
|
|
// Now check the MAC is valid
|
|
val.mul(val,key);
|
|
for (unsigned i=0; i<S.size(); i++)
|
|
{ val.sub(val,S[i].mac); }
|
|
if (!val.is_zero()) { return false; }
|
|
return true;
|
|
}
|
|
|
|
template class Share<gf2n>;
|
|
template class Share<gfp>;
|
|
template gf2n combine(const vector< Share<gf2n> >& S);
|
|
template gfp combine(const vector< Share<gfp> >& S);
|
|
template bool check_macs(const vector< Share<gf2n> >& S,const gf2n& key);
|
|
template bool check_macs(const vector< Share<gfp> >& S,const gfp& key);
|
|
|
|
#ifdef USE_GF2N_LONG
|
|
template class Share<gf2n_short>;
|
|
template gf2n_short combine(const vector< Share<gf2n_short> >& S);
|
|
template bool check_macs(const vector< Share<gf2n_short> >& S,const gf2n_short& key);
|
|
#endif
|