Scalable Hardware Architecture for Montgomery Inversion Computation in Dual-Field
Zibin Dai, Qin Fan, Xiaohui Yang · 2009
Computing the inverse of a number in finite fields GF(p) or GF(2n) is equally important for cryptographic applications. A novel scalable and unified architecture for a Montgomery inversion hardware that operates in both GF(p) and GF(2n) is proposed. The scalable design is the novel modification performed on the fixed hardware to make it occupy a small area and operate with better or similar speed, and it takes less number of clock cycle as the fixed datapath is large and can also achieve high clock frequency. Finally this work has been verified by modeling it in Verilog-HDL, implementing it under 0.18 ¿m CMOS technology. The result indicates that our work has advanced performance than other works.