An Efficient Reconfigurable Montgomery Multiplier Architecture for GF(n)
R.V. Kamala, M. Sudhakar, M. Srinivas · 2006
In this paper, the authors propose an efficient reconfigurable Montgomery multiplier for Galois prime field GF(n) that employs carry-save addition. The multiplier can operate for any operand length 'k' where 1