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
|
.TH ZMODMUL 3 libzahl
.SH NAME
zmodmul - Calculate a modular product of two big integer
.SH SYNOPSIS
.nf
#include <zahl.h>
void zmodmul(z_t \fIproduct\fP, z_t \fImultiplier\fP, z_t \fImultiplicand\fP, z_t \fImodulator\fP);
.fi
.SH DESCRIPTION
.B zmodmul
calculates the product of a
.I multiplier
and a
.IR multiplicand ,
modulus a
.IR modulator ,
and stores the result in
.IR product .
That is,
.I product
gets
.RI ( multiplier
⋅
.IR multiplicand )
Mod
.IR modulator .
.P
It is safe to call
.B zmodmul
with non-unique parameters.
.P
See
.BR zmod (3)
for details on modulation.
.SH RATIONALE
It is possible to calculate the modular product
with a faster algorithm than calculating the
product and than the modulus of that product.
.SH SEE ALSO
.BR zmodsqr (3),
.BR zmodpow (3),
.BR zstr (3),
.BR zadd (3),
.BR zsub (3),
.BR zmul (3),
.BR zdiv (3),
.BR zmod (3),
.BR zneg (3),
.BR zabs (3),
.BR zpow (3)
|
