An Algorithm to Solve the Congruence Equation AX <cd02261.gif>B (Mod M) Using Only Multiplications Mod M

Hatsukazu TANAKA; Seiko KANEKU

Copy

Hatsukazu TANAKA, Seiko KANEKU, "An Algorithm to Solve the Congruence Equation AX B (Mod M) Using Only Multiplications Mod M" in IEICE TRANSACTIONS on transactions, vol. E60-E, no. 10, pp. 551-551, October 1977, doi: .
Abstract: An algorithm is presented to solve the congruence equation of the type AX B (mod M) using Fermat's theorem, where M is any prime. It uses only integer multiplication mod M. If p is an integer such that 2^p11M2^p1, and M3 or p3, the number N of necessary multiplications mod M satisfies p1N2p2.
URL: https://global.ieice.org/en_transactions/transactions/10.1587/e60-e_10_551/_p

Copy

@ARTICLE{e60-e_10_551,
author={Hatsukazu TANAKA, Seiko KANEKU, },
journal={IEICE TRANSACTIONS on transactions},
title={An Algorithm to Solve the Congruence Equation AX B (Mod M) Using Only Multiplications Mod M},
year={1977},
volume={E60-E},
number={10},
pages={551-551},
abstract={An algorithm is presented to solve the congruence equation of the type AX B (mod M) using Fermat's theorem, where M is any prime. It uses only integer multiplication mod M. If p is an integer such that 2^p11M2^p1, and M3 or p3, the number N of necessary multiplications mod M satisfies p1N2p2.},
keywords={},
doi={},
ISSN={},
month={October},}

Copy

TY - JOUR
TI - An Algorithm to Solve the Congruence Equation AX B (Mod M) Using Only Multiplications Mod M
T2 - IEICE TRANSACTIONS on transactions
SP - 551
EP - 551
AU - Hatsukazu TANAKA
AU - Seiko KANEKU
PY - 1977
DO -
JO - IEICE TRANSACTIONS on transactions
SN -
VL - E60-E
IS - 10
JA - IEICE TRANSACTIONS on transactions
Y1 - October 1977
AB - An algorithm is presented to solve the congruence equation of the type AX B (mod M) using Fermat's theorem, where M is any prime. It uses only integer multiplication mod M. If p is an integer such that 2^p11M2^p1, and M3 or p3, the number N of necessary multiplications mod M satisfies p1N2p2.
ER -