Crypto++  5.6.3
Free C++ class library of cryptographic schemes
Public Types | Public Member Functions | Static Public Attributes | List of all members
ModularArithmetic Class Reference

Ring of congruence classes modulo n. More...

+ Inheritance diagram for ModularArithmetic:

Public Types

typedef int RandomizationParameter
 
typedef Integer Element
 
- Public Types inherited from AbstractRing< Integer >
typedef Integer Element
 
- Public Types inherited from AbstractGroup< Integer >
typedef Integer Element
 

Public Member Functions

 ModularArithmetic (const Integer &modulus=Integer::One())
 
 ModularArithmetic (const ModularArithmetic &ma)
 
 ModularArithmetic (BufferedTransformation &bt)
 
virtual ModularArithmeticClone () 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)
 
virtual bool IsMontgomeryRepresentation () const
 
virtual Integer ConvertIn (const Integer &a) const
 
virtual Integer ConvertOut (const Integer &a) const
 
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
 
const IntegerMultiplicativeIdentity () const
 
const IntegerMultiply (const Integer &a, const Integer &b) const
 
const IntegerSquare (const Integer &a) const
 
bool IsUnit (const Integer &a) const
 
const IntegerMultiplicativeInverse (const Integer &a) const
 
const IntegerDivide (const Integer &a, const Integer &b) 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
 
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
 
- Public Member Functions inherited from AbstractRing< Integer >
 AbstractRing (const AbstractRing &source)
 
AbstractRingoperator= (const AbstractRing &source)
 
virtual Element Exponentiate (const Element &a, const Integer &e) const
 
virtual const AbstractGroup< Integer > & MultiplicativeGroup () const
 
- Public Member Functions inherited from AbstractGroup< Integer >
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
 

Detailed Description

Ring of congruence classes modulo n.

Note
this implementation represents each congruence class as the smallest non-negative integer in that class

Definition at line 27 of file modarith.h.


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