Effective implementation of algorithms (Master Thesis)
Effective and error-free implementation of algorithms
math::powermod::MultmodExtended< shift > Class Template Reference

#include <multmod_extended.h>

List of all members.

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,"")

Detailed Description

template<int shift>
class math::powermod::MultmodExtended< shift >

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.

Parameters:
shiftnumber of bits reserved for the computation

Member Function Documentation

template<int shift>
template<typename T >
static T math::powermod::MultmodExtended< shift >::max_argument ( T   UNUSEDx) [inline, static]
template<int shift>
template<typename T >
static T math::powermod::MultmodExtended< shift >::multmod ( a,
b,
modulo 
) [inline, static]
Precondition:
  • T integer type
template<int shift>
math::powermod::MultmodExtended< shift >::STATIC_ASSERT ( shift  ,
,
""   
) [private]

The documentation for this class was generated from the following file:
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Defines