Searched refs:inverse (Results 1 - 9 of 9) sorted by relevance
| /barrelfish-master/lib/openssl-1.0.0d/crypto/idea/ |
| H A D | i_skey.c | 62 static IDEA_INT inverse(unsigned int xin);
106 *(tp++)=inverse(fp[0]);
109 *(tp++)=inverse(fp[3]);
127 static IDEA_INT inverse(unsigned int xin) function
|
| /barrelfish-master/usr/eclipseclp/Opium/demo/ |
| H A D | screen.pl | 24 inverse :- put(27), put(91), put(55), put(109). label
|
| /barrelfish-master/usr/eclipseclp/documents/libman/ |
| H A D | fdglobal.tex | 77 \item[\biptxtref{inverse(+Succ, +Pred)}{inverse/2}{../bips/lib/ic_global/inverse-2.html}]\ \\
|
| H A D | gfd.tex | 848 \item[\biptxtrefni{inverse(+Succ,+Pred)}{inverse/2!gfd}{../bips/lib/gfd/inverse-2.html}]
852 \biptxtrefni{inverse(+Succ,+SuccOffset,+Pred,+PredOffset)}{inverse/4!gfd}{../bips/lib/gfd/inverse-4.html}.
|
| /barrelfish-master/usr/eclipseclp/Contrib/ |
| H A D | map.pl | 220 % unifies Inverse with the inverse of a finite invertible map.
|
| /barrelfish-master/lib/tommath/ |
| H A D | tommath.tex | 4027 extensively in this algorithm and should be precomputed. Let $\rho$ represent the negative of the modular inverse of $n_0$ modulo $\beta$.
4101 for the Barrett algorithm. Additionally if $n > 1$ and $n$ is odd there will exist a modular inverse $\rho$. $\rho$ must be calculated in
4979 value of $(1/a) \mbox{ mod }c$ is computed using the modular inverse (\textit{see \ref{sec;modinv}}). If no inverse exists the algorithm
5020 negative the algorithm tries to perform a modular exponentiation with the modular inverse of the base $G$. The temporary variable $tmpG$ is assigned
5021 the modular inverse of $G$ and $tmpX$ is assigned the absolute value of $X$. The algorithm will recuse with these new values with a positive
6341 The modular inverse of a number actually refers to the modular multiplicative inverse. Essentially for any integer $a$ such that $(a, p) = 1$ there
6342 exist another integer $b$ such that $ab \equiv 1 \mbox{ (mod }p\mbox{)}$. The integer $b$ is called the multiplicative inverse of $a$ which is
6346 The simplest approach is to compute the algebraic inverse o
[all...] |
| H A D | bn.tex | 217 \hline Modular inverse odd moduli only & BN\_MP\_INVMOD\_SLOW\_C \\
218 \hline Modular inverse (both, smaller/slower) & BN\_FAST\_MP\_INVMOD\_C \\
1814 Computes the multiplicative inverse of $a$ modulo $b$ and stores the result in $c$ such that $ac \equiv 1 \mbox{ (mod }b\mbox{)}$.
|
| /barrelfish-master/usr/eclipseclp/documents/megalog/ |
| H A D | database-sec.tex | 678 This is in a sense the inverse of the \verb-<++/2- predicate above.
|
| /barrelfish-master/usr/eclipseclp/documents/applications/ |
| H A D | tutorial.tex | 200 \item If there is a connection (Node1, Node2) between two nodes, then we cannot have the inverse connection (Node2, Node1) as well.
942 The difference between versions 2 and 3 lies in the order of the elements in the result list. Version 2 produces the elements in the inverse order of version 1, whereas version 3 produces them in the same order as version 1. This shows that the {\it fromto} statement can be used to build lists forwards or backwards. Please note that the predicate {\it q/3} is also different in variants 2 and 3.
|
Completed in 141 milliseconds