new ModPowProd(bases, modulus)
Pre-computes values to be used for simultaneous
exponentiation for a given list b of k bases and a modulus m. The
method verificatum.arithm.ModPowProd#modPowProd then takes
a list of exponents e and outputs the modular power product
g[0] ^ e[0] * ... * g[k - 1] ^ e[k - 1] mod m.
The number of exponents must match the number of bases for which pre-computation is performed.
Parameters:
Name | Type | Description |
---|---|---|
bases |
List of bases. | |
modulus |
Modulus. |
- Source:
Methods
(static) naive(bases, exponents, modulus)
Compute a power-product using the given bases,
exponents, and modulus. This is a naive implementation for simple
use and to debug verificatum.arithm.ModPowProd#modPowProd.
Parameters:
Name | Type | Description |
---|---|---|
bases |
Bases. | |
exponents |
Exponents. | |
modulus |
Modulus. |
- Source:
Returns:
Power product.
modPowProd(exponents)
Computes a power-product using the given exponents.
Parameters:
Name | Type | Description |
---|---|---|
exponents |
Exponents. |
- Source:
Returns:
Power product.