LINT (void); | Constructor 1: an uninitialized |
LINT (const char* str, int base); | Constructor 2:
|
LINT (const UCHAR* byte, int len); | Constructor 3:
|
LINT (const char* str); | Constructor 4:
|
LINT (const LINT&); | Constructor 5:
|
LINT (signed int); | Constructor 6:
|
LINT (signed long); | Constructor 7:
|
LINT (unsigned char); | Constructor 8:
|
LINT (USHORT); | Constructor 9:
|
LINT (unsigned int); | Constructor 10:
|
LINT (unsigned long); | Constructor 11:
|
LINT (const CLINT); | Constructor 12:
|
inline char* binstr (void) const; | representation of a |
inline char* decstr (void) const; | representation of a |
inline void disp (char* str); | display of a |
Static long flags (ostream& s); | read static |
static long flags (void); | read static |
LINT& fswap (LINT& b); | exchange of implicit argument |
inline char* hexstr (void) const; | representation of a |
UCHAR* lint2byte (int* len) const; | transformation of a |
char* lint2str (USHORT base, const int showbase = 0) const; | representation of a |
inline char* octstr (void) const; | representation of a |
const LINT& operator = (const LINT& b); | assignment |
Void purge (void); | clear implicit argument |
static long restoref (long int flags); | reset |
static long restoref (ostream& s, long int flags); | set the |
static long setf (long int flags); | set status bits in flags in |
static long setf (ostream& s, long int flags); | set status bits of value flags in |
static long unsetf (long int flags); | unset status bits of flags in |
static long unsetf (ostream& s, long int flags); | unset status bits in flags in |
void fswap (LINT& a, LINT& b); | exchange of |
UCHAR* lint2byte (const LINT& a, int* len); | transformation of |
char* lint2str (const LINT& a, USHORT base, int showbase); | representation of |
ostream& LintBin (ostream& s); |
|
ostream& LintDec (ostream& s); |
|
ostream& LintHex (ostream& s); |
|
ostream& LintLwr (ostream& s); |
|
ostream& LintNobase (ostream& s); |
|
ostream& LintNolength (ostream& s); | manipulator for the omission of binary length in the output |
ostream& LintOct (ostream& s); |
|
ostream& LintShowbase (ostream& s); |
|
ostream& LintShowlength (ostream& s); |
|
ostream& LintUpr (ostream& s); |
|
const int operator != (const LINT& a, const LINT& b); | test |
const int operator > (const LINT& a, const LINT& b); | comparison |
fstream& operator << (fstream& s, const LINT& ln); | overloaded insert operator for writing |
ofstream& operator << (ofstream& s, const LINT& ln); | overloaded insert operator for writing |
ostream& operator << (ostream& s, const LINT& ln); | overloaded insert operator for output of |
const int operator <= (const LINT& a, const LINT& b); | comparison |
const int operator == (const LINT& a, const LINT& b); | test |
const int operator > (const LINT& a, const LINT& b); | comparison |
const int operator >= (const LINT& a, const LINT& b); | comparison |
fstream& operator >> (fstream& s, LINT& ln); | overloaded extract operator for reading |
ifstream& operator >> (ifstream& s, LINT& ln); | overloaded extract operator for reading LINT integers from files, input stream of type |
void purge (LINT& a); | clear by overwriting |
LINT_omanip<int> ResetLintFlags (int flag); | manipulator to unset status bits of value flag in the |
LINT_omanip<int> SetLintFlags (int flag); | manipulator for setting status bits of the value flag in the |
const LINT& add (const LINT& b); | addition |
const LINT& divr (const LINT& d, LINT& r); | division with remainder |
const LINT& mul (const LINT& b); | multiplication |
const LINT operator -- (int); | decrement operator (postfix) |
const LINT& operator -- (void); | decrement operator (prefix) |
const LINT& operator %= (const LINT& b); | remainder and assignment |
const LINT& operator *= (const LINT& b); | multiplication and assignment |
const LINT& operator /= (const LINT& b); | division and assignment |
const LINT operator ++ (int); | increment operator (postfix) |
const LINT& operator ++ (void); | increment operator (prefix) |
const LINT& operator += (const LINT& b); | addition and assignment |
const LINT& operator -= (const LINT& b); | subtraction and assignment |
const LINT& sqr (void); | squaring |
const LINT& sub (const LINT& b); | subtraction |
const LINT add (const LINT& a, const LINT& b); | addition |
const LINT divr (const LINT& a, const LINT& b, LINT& r); | division with remainder |
const LINT mul (const LINT& a, const LINT& b); | multiplication |
const LINT operator - (const LINT& a, const LINT& b); | subtraction |
const LINT operator % (const LINT& a, const LINT& b); | remainder |
const LINT operator * (const LINT& a, const LINT& b); | multiplication |
const LINT operator / (const LINT& a, const LINT& b); | division |
const LINT operator + (const LINT& a, const LINT& b); | addition |
const LINT sqr (const LINT& a); | squaring |
const LINT sub (const LINT& a, const LINT& b); | subtraction |
const LINT& madd (const LINT& b, const LINT& m); | modular addition, |
int mequ (LINT& b, const LINT& m) const; | comparison of |
const LINT& mexp (const LINT& e, const LINT& m); | modular exponentiation with Montgomery reduction for odd modulus |
const LINT& mexp (USHORT u, const LINT& m); | modular exponentiation with |
const LINT& mexp2 (USHORT u, const LINT& m); | modular exponentiation with power of two exponent 2u, |
const LINT& mexp5m (const LINT& e, const LINT& m); | modular exponentiation with Montgomery reduction for odd modulus |
const LINT& mexpkm (const LINT& e, const LINT& m); | modular exponentiation with Montgomery reduction for odd modulus |
const LINT& mmul (const LINT& b, const LINT& m); | modular multiplication, |
const LINT& mod (const LINT& m); | remainder |
const LINT& mod2 (USHORT u); | remainder modulo power of two 2 |
const LINT& msqr (const LINT& m); | modular squaring, |
const LINT& msub (const LINT& b, const LINT& m); | modular subtraction, |
LINT madd (const LINT& a, const LINT& b, const LINT& m); | modular addition, |
Int mequ (const LINT& a, const LINT& b, const LINT& m); | comparison of |
LINT mexp (const LINT& a, const LINT& e, const LINT& m); | modular exponentiation with Montgomery reduction for odd modulus |
LINT mexp (const LINT& a, USHORT u, const LINT& m); | modular exponentiation with |
LINT mexp (USHORT u, const LINT& e, const LINT& m); | modular exponentiation with |
LINT mexp2 (const LINT& a, USHORT u, const LINT& m); | modular exponentiation with power of two exponent 2 |
LINT mexp5m (const LINT& a, const LINT& e, const LINT& m); | modular exponentiation with Montgomery reduction, only for odd modulus |
LINT mexpkm (const LINT& a, const LINT& b, const LINT& m); | modular exponentiation with Montgomery reduction, only for odd modulus |
LINT mmul (const LINT& a, const LINT& b, const LINT& m); | modular multiplication, |
LINT mod (const LINT& a, const LINT& m); | remainder |
LINT mod2 (const LINT& a, USHORT u); | remainder modulo power of two 2 |
LINT msqr (const LINT& a, const LINT& m); | modular squaring, |
LINT msub (const LINT& a, const LINT& b, const LINT& m); | modular subtraction, |
const LINT& clearbit (const unsigned int i); | clear a bit at position |
const LINT& operator &= (const LINT& b); | AND and assignment, |
const LINT& operator ^= (const LINT& b); | XOR and assignment, |
const LINT& operator |= (const LINT& b); | OR and assignment, |
const LINT& operator <<= (int i); | left shift and assignment, |
const LINT& operator >>= (int i); | right shift and assignment, |
const LINT& setbit (unsigned int i); | set a bit at position |
const LINT& shift (int i); | shift (left and right) by |
const int testbit (unsigned int i) const; | test a bit at position |
const LINT operator & (const LINT& a, const LINT& b); | AND, |
const LINT operator ^ (const LINT& a, const LINT& b); | XOR, |
const LINT operator | (const LINT& a, const LINT& b); | OR, |
const LINT operator << (const LINT& a, int i); | left shift, |
const LINT operator >> (const LINT& a, int i); | right shift, |
const LINT shift (const LINT& a, int i); | shift (left and right) by |
LINT chinrem (const LINT& m, const LINT& b, const LINT& n) const; | return a solution |
LINT gcd (const LINT& b); | return gcd of |
LINT introot (void) const; | return integer part of the |
LINT introot (const USHORT b) const; | return integer part of the |
LINT inv (const LINT& b) const; | return the multiplicative inverse of |
int iseven (void) const; | test |
int isodd (void) const; | test |
int isprime (int nsp = 302, int rnds = 0) const; | test |
LINT issqr (void) const; | test |
int jacobi (const LINT& b) const; | return the Jacobi symbol ( |
LINT lcm (const LINT& b) const; | return the least common multiple of |
unsigned int ld (void) const; | return |
LINT root (void) const; | return the integer part of the square root of |
LINT root (const LINT& p) const; | return the square root of |
LINT root (const LINT& p, const LINT& q) const; | return the square root of |
int twofact (LINT& odd) const; | return the even part of |
LINT xgcd (const LINT& b, LINT& u, int& sign_u, LINT& v, int& sign_v) const; | extended Euclidean algorithm with return of gcd of |
LINT chinrem (unsigned noofeq, LINT** coeff); | return a solution of a system of simultaneous linear congruences. In |
LINT extendprime (const LINT& pmin, const LINT& pmax, const LINT& a, const LINT& q, const LINT& f); | return a prime |
LINT extendprime (USHORT l, const LINT& a, const LINT& q, const LINT& f); | return a prime |
LINT findprime (const LINT& pmin, const LINT& pmax, const LINT& f); | return a prime |
LINT findprime (USHORT l); | return a prime |
LINT findprime (USHORT l, const LINT& f); | return a prime |
LINT gcd (const LINT& a, const LINT& b); | return gcd of |
LINT introot (const LINT& a); | return the integer part of |
LINT introot (const LINT& a, const USHORT b); | return the integer part of the |
LINT inv (const LINT& a, const LINT& b); | return the multiplicative inverse of |
int iseven (const LINT& a); | test |
int isodd (const LINT& a); | test |
int isprime (const LINT& p int nsp = 302, int rnds = 0); | test |
LINT issqr (const LINT& a); | test |
Int jacobi (const LINT& a, const LINT& b); | return the Jacobi symbol ( |
LINT lcm (const LINT& a, const LINT& b); | return the least common multiple of |
unsigned int ld (const LINT& a); | return |
LINT nextprime (const LINT& a, const LINT& f); | return the smallest prime |
LINT primroot (unsigned noofprimes, LINT** primes); | return a primitive root modulo p. In |
LINT root (const LINT& a); | return the integer part of the square root of |
LINT root (const LINT& a, const LINT& p); | return the square root of |
LINT root (const LINT& a, const LINT& p, const LINT& q); | return the square root of |
LINT strongprime (const LINT& pmin, const LINT& pmax, const LINT& f); | return a strong prime p with |
LINT strongprime (const LINT& pmin, const LINT& pmax, USHORT lt, USHORT lr, USHORT ls, const LINT& f); | return a strong prime p with |
LINT strongprime (USHORT l); | return a strong prime p of length |
LINT strongprime (USHORT l, const LINT& f); | return a strong prime p of length |
LINT strongprime (USHORT l, USHORT lt, USHORT lr, USHORT ls, LINT& f); | return a strong prime p of length |
int twofact (const LINT& even, LINT& odd); | return the even part of |
LINT xgcd (const LINT& a, const LINT& b, LINT& u, int& sign_u, LINT& v, int& sign_v); | extended Euclidean algorithm with return of gcd of |
LINT randBBS (const LINT& rmin, const LINT& rmax); | return a |
LINT randBBS (int l); | return a |
LINT randl (const LINT& rmin, const LINT& rmax); | return a |
LINT randl (const int l); | return a |
int seedBBS (const LINT& seed); | initialization of BBS random number generator with initial value |
void seedl (const LINT& seed); | initialization of the 64-bit random number generator based on linear congruences with initial value |
LINT_ERRORS Get_Warning_Status (void); | query error status of a |
static void Set_LINT_Error_Handler (void (*)(LINT_ERRORS err, const char*, int, int)); | activation of a user routine for handling errors with |
3.136.233.153