|
Powmod - inert power function with remainder
|
|
Calling Sequence
|
|
Powmod(a, n, b, x)
Powmod(a, n, b)
|
|
|
Parameters
|
|
|
a
|
-
|
polynomial in x
|
|
n
|
-
|
integer
|
|
b
|
-
|
polynomial in x
|
|
x
|
-
|
name
|
|
|
|
|
|
Description
|
|
|
•
|
The Powmod function is a placeholder for representing  or  . Powmod is more efficient than computing Power(a, n) separately. It is used in conjunction with either mod or modp1.
|
|
•
|
The call Powmod(a, n, b, x) mod p computes  . The polynomials a and b must have rational coefficients or coefficients over a finite field specified by RootOfs.
|
|
•
|
The call modp1(Powmod(a, n, b), p) computes  . The polynomials a and b must be in the modp1 representation and p must be a positive integer.
|
|
|
Download Help Document
Was this information helpful?
