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) |
Optimized version of MultmodExtended
This is previous version with fixed shift=1, but we optimized modular arithmetic using only additions/subtractions
static T math::powermod::MultmodExtendedOpt::max_argument | ( | T | UNUSEDx | ) | [inline, static] |
static T math::powermod::MultmodExtendedOpt::multmod | ( | T | a, |
T | b, | ||
T | modulo | ||
) | [inline, static] |