Crypto++
Public Types | Public Member Functions | Static Public Attributes | Protected Attributes | List of all members
MontgomeryRepresentation Class Reference

do modular arithmetics in Montgomery representation for increased speed More...

#include <modarith.h>

Inheritance diagram for MontgomeryRepresentation:
ModularArithmetic AbstractRing< Integer > AbstractGroup< Integer >

Public Types

typedef int RandomizationParameter
 
typedef Integer Element
 

Public Member Functions

 MontgomeryRepresentation (const Integer &modulus)
 
virtual ModularArithmeticClone () const
 
bool IsMontgomeryRepresentation () const
 
Integer ConvertIn (const Integer &a) const
 
Integer ConvertOut (const Integer &a) const
 
const IntegerMultiplicativeIdentity () const
 
const IntegerMultiply (const Integer &a, const Integer &b) const
 
const IntegerSquare (const Integer &a) const
 
const IntegerMultiplicativeInverse (const Integer &a) const
 
Integer CascadeExponentiate (const Integer &x, const Integer &e1, const Integer &y, const Integer &e2) const
 
void SimultaneousExponentiate (Element *results, const Element &base, const Integer *exponents, unsigned int exponentsCount) const
 
void DEREncode (BufferedTransformation &bt) const
 
void DEREncodeElement (BufferedTransformation &out, const Element &a) const
 
void BERDecodeElement (BufferedTransformation &in, Element &a) const
 
const IntegerGetModulus () const
 
void SetModulus (const Integer &newModulus)
 
const IntegerHalf (const Integer &a) const
 
bool Equal (const Integer &a, const Integer &b) const
 
const IntegerIdentity () const
 
const IntegerAdd (const Integer &a, const Integer &b) const
 
IntegerAccumulate (Integer &a, const Integer &b) const
 
const IntegerInverse (const Integer &a) const
 
const IntegerSubtract (const Integer &a, const Integer &b) const
 
IntegerReduce (Integer &a, const Integer &b) const
 
const IntegerDouble (const Integer &a) const
 
bool IsUnit (const Integer &a) const
 
const IntegerDivide (const Integer &a, const Integer &b) const
 
unsigned int MaxElementBitLength () const
 
unsigned int MaxElementByteLength () const
 
Element RandomElement (RandomNumberGenerator &rng, const RandomizationParameter &ignore_for_now=0) const
 
bool operator== (const ModularArithmetic &rhs) const
 
virtual Element Exponentiate (const Element &a, const Integer &e) const
 
virtual const AbstractGroup
< Integer > & 
MultiplicativeGroup () const
 
virtual bool InversionIsFast () const
 
virtual Element ScalarMultiply (const Element &a, const Integer &e) const
 
virtual Element CascadeScalarMultiply (const Element &x, const Integer &e1, const Element &y, const Integer &e2) const
 
virtual void SimultaneousMultiply (Element *results, const Element &base, const Integer *exponents, unsigned int exponentsCount) const
 

Static Public Attributes

static const RandomizationParameter DefaultRandomizationParameter
 

Protected Attributes

Integer m_modulus
 
Integer m_result
 
Integer m_result1
 

Detailed Description

do modular arithmetics in Montgomery representation for increased speed

Note
the Montgomery representation represents each congruence class [a] as a*rn, where r is a convenient power of 2

Definition at line 122 of file modarith.h.


The documentation for this class was generated from the following file: