Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Aggarwal, Anay"'
Autor:
Aggarwal, Anay, Isaacs, Manu
We present a fast algorithm for modular exponentiation when the factorization of the modulus is known. Let $a,n,m$ be positive integers and suppose $m$ factors canonically as $\prod_{i=1}^k p_i^{e_i}$. Choose integer parameters $t_i\in [1, e_i]$ for
Externí odkaz:
http://arxiv.org/abs/2401.10497