Effective implementation of algorithms (Master Thesis)
Effective and error-free implementation of algorithms
|
#include <multmod_extended.h>
Static Public Member Functions | |
template<typename T > | |
static T | max_argument (T UNUSED(x)) |
template<typename T > | |
static T | multmod (T a, T b, T modulo) |
Private Member Functions | |
STATIC_ASSERT (shift > 0,"") |
Extended modular multiplication. Does not require bigger types for temporaries.
The computation is done by using some type, the drawback is that we need to reserve several bits for our computations.
shift | number of bits reserved for the computation |
static T math::powermod::MultmodExtended< shift >::max_argument | ( | T | UNUSEDx | ) | [inline, static] |
static T math::powermod::MultmodExtended< shift >::multmod | ( | T | a, |
T | b, | ||
T | modulo | ||
) | [inline, static] |
math::powermod::MultmodExtended< shift >::STATIC_ASSERT | ( | shift | , |
0 | , | ||
"" | |||
) | [private] |