For many applications from the areas of cryptography and coding, finite field multiplication is the most resource and time consuming operation. In this paper, optimized high performance parallel GF(2 233 ) multipliers for an FPGA realization were designed and the time and area complexities were analyzed. One of the multipliers uses a new hybrid structure to implement the Karatsuba algorithm. Fo...

A static, generalized input± output framework for calculating simple multipliers is presented for Australian data. In this framework, capital investment and imports are internalized into domestic inter-industrial intermediate demand, non-square matrices are introduced in order to enable the inclusion of ® ner detail commodity data, and matrices in both monetary and physical units are employed. ...