Journal of Electrical and Computer Engineering

Research Article

Revisiting Sum of Residues Modular Multiplication

Algorithm 1

A Typical Example of Classical Modular Multiplication.
Ensure: 𝐶 ≡ 𝐴 × 𝐵 m o d 𝑀
  𝐶 = 0
for 𝑖 = 𝑛 − 1 downto 0 do
   𝐶 = 𝑟 𝐶 + 𝑎 𝑖 𝐵 { P a r t i a l p r o d u c t a c c u m u l a t i o n }
   𝑞 𝑖 = Q D S ( 𝐶 , 𝑀 ) { Q u o t i e n t d i g i t s e l e c t i o n }
   𝐶 = 𝐶 − 𝑞 𝑖 𝑀 { R e d u c t i o n s t e p }
end for