In this paper, two different normal basis multiplication algorithms for software implementation are proposed over GF(2^n). The first algorithm is suitable for high complexity normal bases and the second algorithm is fast for type-I optimal normal bases and low complexity normal bases. The ANSI C source program is also included in this paper
