1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
|
/* Test mpz_powm, mpz_mul. mpz_mod, mpz_mod_ui, mpz_div_ui.
Copyright (C) 1991, 1993, 1994, 1996, 1999, 2000 Free Software Foundation,
Inc.
This file is part of the GNU MP Library.
The GNU MP Library is free software; you can redistribute it and/or modify
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.
The GNU MP Library 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 the GNU MP Library; see the file COPYING.LIB. If not, write to
the Free Software Foundation, Inc., 59 Temple Place - Suite 330, Boston,
MA 02111-1307, USA. */
#include <stdio.h>
#include "gmp.h"
#include "gmp-impl.h"
#include "urandom.h"
void debug_mp ();
#ifndef SIZE
#define SIZE 50
#endif
#ifndef EXP_SIZE
#define EXP_SIZE 2
#endif
main (argc, argv)
int argc;
char **argv;
{
mpz_t base, exp, mod;
mpz_t r1, r2, t1, exp2, base2;
mp_size_t base_size, exp_size, mod_size;
int i;
int reps = 2500;
if (argc == 2)
reps = atoi (argv[1]);
mpz_init (base);
mpz_init (exp);
mpz_init (mod);
mpz_init (r1);
mpz_init (r2);
mpz_init (t1);
mpz_init (exp2);
mpz_init (base2);
for (i = 0; i < reps; i++)
{
do
{
base_size = urandom () % 2 * SIZE - SIZE;
mpz_random2 (base, base_size);
exp_size = urandom () % (EXP_SIZE + 1);
mpz_random2 (exp, exp_size);
/* Loop until mathematically well-defined. */
}
while (mpz_cmp_ui (base, 0) == 0 && mpz_cmp_ui (exp, 0) == 0);
do
{
mod_size = urandom () % SIZE /* - SIZE/2 */;
mpz_random2 (mod, mod_size);
}
while (mpz_cmp_ui (mod, 0) == 0);
#if 0
putc ('\n', stderr);
debug_mp (base, -16);
debug_mp (exp, -16);
debug_mp (mod, -16);
#endif
mpz_powm (r1, base, exp, mod);
mpz_set_ui (r2, 1);
mpz_set (base2, base);
mpz_set (exp2, exp);
mpz_mod (r2, r2, mod); /* needed when exp==0 and mod==1 */
while (mpz_cmp_ui (exp2, 0) != 0)
{
mpz_mod_ui (t1, exp2, 2);
if (mpz_cmp_ui (t1, 0) != 0)
{
mpz_mul (r2, r2, base2);
mpz_mod (r2, r2, mod);
}
mpz_mul (base2, base2, base2);
mpz_mod (base2, base2, mod);
mpz_div_ui (exp2, exp2, 2);
}
#if 0
debug_mp (r1, -16);
debug_mp (r2, -16);
#endif
if (mpz_cmp (r1, r2) != 0)
abort ();
}
exit (0);
}
dump_abort (dividend, divisor)
MP_INT *dividend, *divisor;
{
fprintf (stderr, "ERROR\n");
fprintf (stderr, "dividend = "); debug_mp (dividend, -16);
fprintf (stderr, "divisor = "); debug_mp (divisor, -16);
abort();
}
void
debug_mp (x, base)
MP_INT *x;
{
mpz_out_str (stderr, base, x); fputc ('\n', stderr);
}
|
