Look-Up Table Based Large Finite Field Multiplication in Memory Constrained Cryptosystems (Extended Abstract)
In this article, a look-up table based algorithm for GF(2n) multiplication is presented. In each iteration of the algorithm, a group of bits of one of the input operands are examined and two look-up tables are accessed. The group size determines the table sizes but does not affect the utilization of the processor resources. It can be used for both software and hardware realizations and is particularly suitable for implementations in memory constrained environment, such as, smart cards and embedded cryptosystems.
Unable to display preview. Download preview PDF.
- 1.E.D. Mastrovito, VLSI Architectures for Computations in Galois Fields. PhD thesis, Dept. Elect. Eng., Linköping University, Linköping, Sweden, 1991.Google Scholar
- 2.C. Koc and B. Sunar, “Mastrovito Multiplier for All Trinomials,” IEEE Trans. Computers, 1999.Google Scholar
- 5.G. Harper, A. Menezes, and S. Vanstone, “Public-key cryptsystems with very small key lengths,” inAdvances in Cryptology-EUROCRYPT’ 92, Lecture Notes in Computer Science, pp. 163–173, Springer-Verlag, 1992.Google Scholar
- 10.Certicom Research, “GEC1: Recommended Elliptic Curve Domain Parameters,” in Standards for Efficient Cryptography Group, http://www.secg.org, 1999.