AN ALGORITHM FOR MULTIPLICATIONS IN F2m

Article Sidebar

PDF
Published: May 15, 2002
DOI: https://doi.org/10.14403/jcms.2002.15.2.85
Keywords:
Elliptic Curve Cryptography, Binary finite field, Normal basis
Mathematics Subject Classification (2020):
Primary 94A60

Main Article Content

SeYoung Oh
ChungSup Yoon

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.




Article Details

Issue
Vol. 15 No. 2 (2002)
Section
Articles