A Reconfigurable Dual-Field Multiplier for GF(P) and GF(2{sup}n)

摘要

This paper proposes a dual-field multiplier for the cryptographic system on GF(P) and GF(2{sup}n) both with multiple key-sizes. The supported key-sizes are 192,224 and 256 bits over GF(P) and 163,191 and 233 bits over GF(2{sup}n). To avoid the time-consuming division required in previous multiplication algorithms on GF(P), we predict the value of division using some intermediate values. Simulation results show that the number of cycles required for multiplication is equal to the key-sizes on GF(2{sup}n) and about 1.5 · log_2(P) on GF(P).