logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Return

Efficient multiplication beyond optimal normal bases

delete2003-04-01
delete27
PRE
AI
A
Arash Reyhani-Masoleh
M
M.A. Hasan
DOI：10.1109/TC.2003.1190584delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
In cryptographic applications, the use of normal bases to represent elements of the finite field GF(2(m)) is quite advantageous, especially for hardware implementation. In this article, we consider an important field operation, namely, multiplication which is used in many cryptographic functions. We present a class of algorithms for normal basis multiplication in GF(2(m)). Our proposed multiplication algorithm for composite finite fields requires a significantly lower number of bit level operations and, hence, can reduce the space complexity of cryptographic systems.
Keywords:
finite fields
multiplication
normal bases
composite fields
optimal bases

Journal

IEEE Transactions on Computers cover
IEEE Transactions on Computers
IF:
3.8
Papers:
5.3K
Citations:
9.8K

Organization

No organization information available