Home | History | Annotate | Download | only in libtommath

Lines Matching refs:variable

691 This will assign the value of the 32-bit variable $b$ to the mp\_int $a$.  Unlike mp\_set() this function will always
1060 function simply copies $a$ over to ``c'' and zeroes $d$. The variable $d$ may be passed as a \textbf{NULL}
1488 normalizing the inputs the reduced results are always of the form $aR$ for some variable $a$. This allows
1561 This computes $Y \equiv G^X \mbox{ (mod }P\mbox{)}$ using a variable width sliding window algorithm. This function
1665 Which is a function that must read $len$ bytes (and return the amount stored) into $dst$. The $dat$ variable is simply
1680 This will generate a prime in $a$ using $t$ tests of the primality testing algorithms. The variable $size$
1681 specifies the bit length of the prime desired. The variable $flags$ specifies one of several options available