|
MySQL 5.6.14 Source Code Document
|
do modular arithmetics in Montgomery representation for increased speed More...
#include <modarith.hpp>


Public Member Functions | |
| MontgomeryRepresentation (const Integer &modulus) | |
| bool | IsMontgomeryRepresentation () const |
| Integer | ConvertIn (const Integer &a) const |
| Integer | ConvertOut (const Integer &a) const |
| const Integer & | MultiplicativeIdentity () const |
| const Integer & | Multiply (const Integer &a, const Integer &b) const |
| const Integer & | Square (const Integer &a) const |
| const Integer & | MultiplicativeInverse (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 |
Public Member Functions inherited from TaoCrypt::ModularArithmetic | |
| ModularArithmetic (const Integer &modulus=Integer::One()) | |
| ModularArithmetic (const ModularArithmetic &ma) | |
| const Integer & | GetModulus () const |
| void | SetModulus (const Integer &newModulus) |
| const Integer & | Half (const Integer &a) const |
| bool | Equal (const Integer &a, const Integer &b) const |
| const Integer & | Identity () const |
| const Integer & | Add (const Integer &a, const Integer &b) const |
| Integer & | Accumulate (Integer &a, const Integer &b) const |
| const Integer & | Inverse (const Integer &a) const |
| const Integer & | Subtract (const Integer &a, const Integer &b) const |
| Integer & | Reduce (Integer &a, const Integer &b) const |
| const Integer & | Double (const Integer &a) const |
| bool | IsUnit (const Integer &a) const |
| const Integer & | Divide (const Integer &a, const Integer &b) const |
| unsigned int | MaxElementBitLength () const |
| unsigned int | MaxElementByteLength () const |
Public Member Functions inherited from TaoCrypt::AbstractRing | |
| AbstractRing (const AbstractRing &source) | |
| AbstractRing & | operator= (const AbstractRing &source) |
| virtual Element | Exponentiate (const Element &a, const Integer &e) const |
| virtual const AbstractGroup & | MultiplicativeGroup () const |
Public Member Functions inherited from TaoCrypt::AbstractGroup | |
| 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 |
Additional Inherited Members | |
Public Types inherited from TaoCrypt::ModularArithmetic | |
| typedef int | RandomizationParameter |
| typedef Integer | Element |
Static Public Attributes inherited from TaoCrypt::ModularArithmetic | |
| static const RandomizationParameter | DefaultRandomizationParameter |
Protected Attributes inherited from TaoCrypt::ModularArithmetic | |
| Integer | modulus |
| Integer | result |
| Integer | result1 |
do modular arithmetics in Montgomery representation for increased speed
Definition at line 125 of file modarith.hpp.