/* -*-c-*-
*
- * $Id: mp.h,v 1.16 2002/10/15 22:57:22 mdw Exp $
+ * $Id$
*
* Simple multiprecision arithmetic
*
* (c) 1999 Straylight/Edgeware
*/
-/*----- Licensing notice --------------------------------------------------*
+/*----- Licensing notice --------------------------------------------------*
*
* This file is part of Catacomb.
*
* it under the terms of the GNU Library General Public License as
* published by the Free Software Foundation; either version 2 of the
* License, or (at your option) any later version.
- *
+ *
* Catacomb is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU Library General Public License for more details.
- *
+ *
* You should have received a copy of the GNU Library General Public
* License along with Catacomb; if not, write to the Free
* Software Foundation, Inc., 59 Temple Place - Suite 330, Boston,
* MA 02111-1307, USA.
*/
-/*----- Revision history --------------------------------------------------*
- *
- * $Log: mp.h,v $
- * Revision 1.16 2002/10/15 22:57:22 mdw
- * Handy new comparison macros.
- *
- * Revision 1.15 2002/10/15 19:18:31 mdw
- * New operation to negate numbers.
- *
- * Revision 1.14 2002/10/15 00:19:40 mdw
- * Bit setting and clearing functions.
- *
- * Revision 1.13 2002/10/06 22:52:50 mdw
- * Pile of changes for supporting two's complement properly.
- *
- * Revision 1.12 2001/06/16 12:57:43 mdw
- * Move the @mpmont_factor@ structure and rename it now that it's used for
- * Barrett simultaneous exponentiation too.
- *
- * Revision 1.11 2001/04/03 19:36:05 mdw
- * Add some simple bitwise operations so that Perl can use them.
- *
- * Revision 1.10 2000/10/08 12:03:16 mdw
- * Provide @mp_eq@ and @MP_EQ@ for rapidly testing equality of two
- * integers.
- *
- * Revision 1.9 2000/07/29 17:03:31 mdw
- * Add support for left-to-right bitscanning, for use in modular
- * exponentiation.
- *
- * Revision 1.8 2000/06/22 19:02:01 mdw
- * Add new functions.
- *
- * Revision 1.7 2000/06/17 11:45:09 mdw
- * Major memory management overhaul. Added arena support. Use the secure
- * arena for secret integers. Replace and improve the MP management macros
- * (e.g., replace MP_MODIFY by MP_DEST).
- *
- * Revision 1.6 1999/12/10 23:19:46 mdw
- * Minor bugfixes. New interface for suggested destinations.
- *
- * Revision 1.5 1999/11/22 20:50:37 mdw
- * Add support for computing Jacobi symbols.
- *
- * Revision 1.4 1999/11/21 22:13:02 mdw
- * Add mp version of MPX_BITS.
- *
- * Revision 1.3 1999/11/19 13:19:14 mdw
- * Fix const annotation.
- *
- * Revision 1.2 1999/11/17 18:02:16 mdw
- * New multiprecision integer arithmetic suite.
- *
- */
-
#ifndef CATACOMB_MP_H
#define CATACOMB_MP_H
extern mp mp_const[];
#define MP_ZERO (&mp_const[0])
-#define MP_ONE (&mp_const[1])
-#define MP_TWO (&mp_const[2])
+#define MP_ONE (&mp_const[1])
+#define MP_TWO (&mp_const[2])
#define MP_THREE (&mp_const[3])
-#define MP_FOUR (&mp_const[4])
-#define MP_FIVE (&mp_const[5])
-#define MP_TEN (&mp_const[6])
+#define MP_FOUR (&mp_const[4])
+#define MP_FIVE (&mp_const[5])
+#define MP_TEN (&mp_const[6])
#define MP_256 (&mp_const[7])
-#define MP_MONE (&mp_const[8])
+#define MP_MONE (&mp_const[8])
#define MP_NEW ((mp *)0)
#define MP_NEWSEC (&mp_const[9])
if (_mm->ref == 0 && !(_mm->f & MP_CONST)) \
mp_destroy(_mm); \
} while (0)
-
+
/* --- @mp_split@ --- *
*
* Arguments: @mp *m@ = pointer to a multiprecision integer
#define MP_SHRINK(m) do { \
mp *_mm = (m); \
MPX_SHRINK(_mm->v, _mm->vl); \
- if (!MP_LEN(_mm)) \
+ if (MP_ZEROP(_mm)) \
_mm->f &= ~MP_NEG; \
} while (0)
* @mp *a@ = source
*
* Returns: The bitwise complement of the source.
- */
+ */
extern mp *mp_not(mp */*d*/, mp */*a*/);
* Synonyms for the commonly-used functions.
*/
-#define mp_and mp_bit0001
-#define mp_or mp_bit0111
+#define mp_and mp_bit0001
+#define mp_or mp_bit0111
#define mp_nand mp_bit1110
-#define mp_nor mp_bit1000
-#define mp_xor mp_bit0110
+#define mp_nor mp_bit1000
+#define mp_xor mp_bit0110
/* --- @mp_testbit@ --- *
*
extern mp *mp_setbit(mp */*d*/, mp */*x*/, unsigned long /*n*/);
extern mp *mp_clearbit(mp */*d*/, mp */*x*/, unsigned long /*n*/);
-/* --- @mp_lsl@, @mp_lsr@ --- *
+/* --- @mp_lsl@, @mp_lslc@, @mp_lsr@ --- *
*
* Arguments: @mp *d@ = destination
* @mp *a@ = source
* @size_t n@ = number of bits to move
*
* Returns: Result, @a@ shifted left or right by @n@.
+ *
+ * Use: Bitwise shift operators. @mp_lslc@ fills the bits introduced
+ * on the right with ones instead of zeroes: it's used
+ * internally by @mp_lsl2c@, though it may be useful on its
+ * own.
*/
extern mp *mp_lsl(mp */*d*/, mp */*a*/, size_t /*n*/);
+extern mp *mp_lslc(mp */*d*/, mp */*a*/, size_t /*n*/);
extern mp *mp_lsr(mp */*d*/, mp */*a*/, size_t /*n*/);
/* --- @mp_not2c@ --- *
*/
#define mp_and2c mp_bit00012c
-#define mp_or2c mp_bit01112c
+#define mp_or2c mp_bit01112c
#define mp_nand2c mp_bit11102c
#define mp_nor2c mp_bit10002c
#define mp_xor2c mp_bit01102c
/* --- Other handy macros --- */
-#define MP_ISNEG(x) ((x)->f & MP_NEG)
-#define MP_ISZERO(x) MP_EQ((x), MP_ZERO)
-#define MP_ISPOS(x) (!MP_ISNEG(x) && !MP_ISZERO(x))
+#define MP_NEGP(x) ((x)->f & MP_NEG)
+#define MP_ZEROP(x) (!MP_LEN(x))
+#define MP_POSP(x) (!MP_NEGP(x) && !MP_ZEROP(x))
+#define MP_ODDP(x) (!MP_ZEROP(x) && ((x)->v[0] & 1u))
+#define MP_EVENP(x) (!MP_ODDP(x))
/*----- Arithmetic operations ---------------------------------------------*/
extern void mp_div(mp **/*qq*/, mp **/*rr*/, mp */*a*/, mp */*b*/);
+/* --- @mp_exp@ --- *
+ *
+ * Arguments: @mp *d@ = fake destination
+ * @mp *a@ = base
+ * @mp *e@ = exponent
+ *
+ * Returns: Result, %$a^e$%.
+ */
+
+extern mp *mp_exp(mp */*d*/, mp */*a*/, mp */*e*/);
+
/* --- @mp_odd@ --- *
*
* Arguments: @mp *d@ = pointer to destination integer
extern void mp_gcd(mp **/*gcd*/, mp **/*xx*/, mp **/*yy*/,
mp */*a*/, mp */*b*/);
+/* -- @mp_modinv@ --- *
+ *
+ * Arguments: @mp *d@ = destination
+ * @mp *x@ = argument
+ * @mp *p@ = modulus
+ *
+ * Returns: The inverse %$x^{-1} \bmod p$%.
+ *
+ * Use: Computes a modular inverse. An assertion fails if %$p$%
+ * has no inverse.
+ */
+
+extern mp *mp_modinv(mp */*d*/, mp */*x*/, mp */*p*/);
+
/* --- @mp_jacobi@ --- *
*
- * Arguments: @mp *a@ = an integer less than @n@
- * @mp *n@ = an odd integer
+ * Arguments: @mp *a@ = an integer
+ * @mp *n@ = another integer
*
* Returns: @-1@, @0@ or @1@ -- the Jacobi symbol %$J(a, n)$%.
*
- * Use: Computes the Jacobi symbol. If @n@ is prime, this is the
- * Legendre symbol and is equal to 1 if and only if @a@ is a
- * quadratic residue mod @n@. The result is zero if and only if
- * @a@ and @n@ have a common factor greater than one.
+ * Use: Computes the Kronecker symbol %$\jacobi{a}{n}$%. If @n@ is
+ * prime, this is the Legendre symbol and is equal to 1 if and
+ * only if @a@ is a quadratic residue mod @n@. The result is
+ * zero if and only if @a@ and @n@ have a common factor greater
+ * than one.
+ *
+ * If @n@ is composite, then this computes the Kronecker symbol
+ *
+ * %$\jacobi{a}{n}=\jacobi{a}{u}\prod_i\jacobi{a}{p_i}^{e_i}$%
+ *
+ * where %$n = u p_0^{e_0} \ldots p_{n-1}^{e_{n-1}}$% is the
+ * prime factorization of %$n$%. The missing bits are:
+ *
+ * * %$\jacobi{a}{1} = 1$%;
+ * * %$\jacobi{a}{-1} = 1$% if @a@ is negative, or 1 if
+ * positive;
+ * * %$\jacobi{a}{0} = 0$%;
+ * * %$\jacobi{a}{2}$ is 0 if @a@ is even, 1 if @a@ is
+ * congruent to 1 or 7 (mod 8), or %$-1$% otherwise.
+ *
+ * If %$n$% is positive and odd, then this is the Jacobi
+ * symbol. (The Kronecker symbol is a consistant domain
+ * extension; the Jacobi symbol was implemented first, and the
+ * name stuck.)
*/
extern int mp_jacobi(mp */*a*/, mp */*n*/);
* work if %$p$% is composite: you must factor the modulus, take
* a square root mod each factor, and recombine the results
* using the Chinese Remainder Theorem.
+ *
+ * We guarantee that the square root returned is the smallest
+ * one (i.e., the `positive' square root).
*/
extern mp *mp_modsqrt(mp */*d*/, mp */*a*/, mp */*p*/);
+/* --- @mp_modexp@ --- *
+ *
+ * Arguments: @mp *d@ = fake destination
+ * @mp *x@ = base of exponentiation
+ * @mp *e@ = exponent
+ * @mp *n@ = modulus (must be positive)
+ *
+ * Returns: The value %$x^e \bmod n$%.
+ */
+
+extern mp *mp_modexp(mp */*d*/, mp */*x*/, mp */*e*/, mp */*n*/);
+
/*----- Test harness support ----------------------------------------------*/
#include <mLib/testrig.h>