Time-Space Efficient Exponentiation over GF(2~m)

摘要

The modular exponentiation on the finite field is the basic operation in most public key crypto systems. In this paper, we propose a multi-plier/squarer which simultaneously processes the modular multiplication and squaring over GF(2~m) based on cellular automata. For effective exponentiation on GF(2~m), we use a proposed multiplier/squarer. Since the cellular automata architecture is simple, regular, modular and cascadable, it can be utilized efficiently for the implementation of VLSI.