The normal form and modilied normal form for binary redundant representation are defined. A redundant binary algorithm to compute modular exponentiation for very large integers is proposed. It is shown that the propos...The normal form and modilied normal form for binary redundant representation are defined. A redundant binary algorithm to compute modular exponentiation for very large integers is proposed. It is shown that the proposed algorithm requires the minimum number of basic operations (modular multiplications) among all possible binary redundant representations.展开更多
文摘The normal form and modilied normal form for binary redundant representation are defined. A redundant binary algorithm to compute modular exponentiation for very large integers is proposed. It is shown that the proposed algorithm requires the minimum number of basic operations (modular multiplications) among all possible binary redundant representations.
