GR ¨OBNER-SHIRSHOV BASIS AND ITS APPLICATION

Abstract

An efficient algorithm for the multiplication in a binary finite filed using a normal basis representation of F2m is discussed and proposed for software implementation of elliptic curve cryptography. The algorithm is developed by using the storage scheme of sparse matrices.

This article was migrated from the previous system via automation. The abstract may not be written correctly. Please view the PDF file.