Look-up table based large finite field multiplication in memory constrained cryptosystems

摘要: In this article, a look-up table based algorithm for GF(2 n ) multiplication is presented. each iteration of the algorithm, group bits one input operands are examined and two tables accessed. The size determines sizes but does not affect utilization processor resources. It can be used both software hardware realizations particularly suitable implementations in memory constrained environment, such as, smart cards embedded cryptosystems.